Passivity-based Analysis and Design for Population Dynamics with Conformity Biases
Abstract
This paper addresses mechanisms for boundedly rational decision makers in discrete choice problem. First, we introduce two mathematical models of population dynamics with conformity biases. We next analyze the models in terms of -passivity, and show that the conformity biases work to break passivity of decision makers. Based on the passivity perspective, we propose mechanisms so as to induce decision makers to a desired population state. Furthermore, we analyze a convergence property of designed mechanisms, and present parameter conditions to guarantee stable inducements.
Population dynamics, Bounded rationality, Conformity bias, Behavior modification, Passivity
1 Introduction
Human behavior is a critically important factor in design and analysis of large-scale social systems like transportation network [1] and energy management systems [2, 3, 4]. As seen in these publications, a typical approach to address such systems involving humans is to model social decisions/dynamics assuming human rationality, against the background of expected utility theory [5]. Meanwhile, behavioral economics has pointed out that human rationality may be bounded due to information and/or cognitive constraints, as typified by prospect theory [6] or dual-process theory [7]. It is highly uncertain that any system designed under the assumption of human rationality will work when their rationality is bounded. Motivated by the issue, boundedly rational human/social models have begun to be investigated in the field of systems and control[8, 9]. Among various types of bounded rationality, in this paper, we focus on so-called conformity bias [10], tendency to follow the majority, that is observed in the scenes of parking location choice [11] and evacuation decision [12].
One of the decision making issues is discrete choice problem which decision makers choose a strategy from finite number of options [13]. Indeed, some significant issues in society are categorized as discrete choice: route selection in transportation networks [14], choice of energies [15], and water distribution [16], for example. Meanwhile, when we deal with systems including large scale of population, it should be required to consider decision models as a population [17]. Discrete choice behavior by large populations is well-addressed in evolutionary game theory, in which various types of population dynamics have been presented, e.g., logit dynamics [18, 19], Smith dynamics [20] and pairwise comparison dynamics [21]. Meanwhile, some recent publications have pointed out relations between population dynamics and passivity [22, 23, 24]. The researches in [22, 23] analyze passivity for generally formulated population dynamics, and [24] particularly focuses on the decision model in water distribution system. However, the models dealt with in the above literature do not explicitly consider influences of biases. Although several publications [25, 26] deal with bounded rationality in population dynamics, they address the models without focusing on passivity.
In social systems, it is sometimes preferred to induce humans to a desired social state. From the viewpoint of inducement for populations, behavior modification mechanism might be a key concept to achieve a desired behavior. This includes incentive [27] which is an economic approach, or nudge [28] which is an informational one. These kinds of mechanisms have recently attracted the attention of control community [29, 30], and more specifically, the ones for population dynamics have also been studied [31, 32]. Whereas, the publication which explicitly consider bounded rationality is rare. The authors in [25] propose a nudging mechanism for biased population dynamics, and analyze stability by using singular perturbation.
In this paper, we address mechanisms for discrete choice problem under bounded rationality. First, we introduce a well-used population dynamics model, called the logit dynamics, and its -passivity [23]. Next, we extend the decision making model to the one with conformity biases. We show two types of the bias models respectively addressed in [33] and [25]. We then analyze the biased logit dynamics in terms of -passivity, and reveal the impacts of conformity biases. Inspired by passivity-based control methods, we propose mechanisms so as to achieve desired social behavior for two types of biased models, respectively. Furthermore, we analyze their convergence, and show parameter conditions in order to stabilize the proposed mechanisms.
We summarize the contributions of this paper as follows:
-
•
the impact by conformity biases to population dynamics is shown in terms of passivity, and
-
•
passivity-based mechanisms are presented, which stably achieve desired social state.
Parts of the contents in this paper are similar to the previous work in [34]. Meanwhile, variation of bias models and exact analysis of mechanisms are the incremental contributions added anew in this paper.
2 Model Description
2.1 Preliminaries: -Passivity
This subsection introduces -passivity [23] which is a similar concept to passive systems [35]. Suppose a system represented by the state space model
where is the state, is the input, and is a function. Then, is called -passive from to if there exists a positive semi-definite function and a scalar such that
for all input , all initial state and all . The positive semi-definite function is particularly called a storage function. In addition, is called -input-strictly-passive if the above inequality is satisfied with some positive scalar . As widely known, if is differentiable, we can replace the above inequality with .
In the same way as passivity shortage [36], we define -output-passivity-shortage. The system is called -output-passivity-short from to if there exists a positive semi-definite function , and a scalar such that
for all input , all initial state and all . We call the value as an impact coefficient. If is differentiable, the above inequality is equivalent to .
Feedback system composed of strictly passive component and passivity-short one is related to the Lyapunov stability [35, 37]. Consider a -input-strictly-passive system whose input is and state is , which satisfies for a differentiable storage function and . We also suppose a -output-passivity-short system whose input is and state is , which satisfies for a differentiable storage function and . Then, the feedback interconnection under and provides
If holds and is radially unbounded, the above inequality suggests stability of the feedback system in the sense of Lyapunov [35]. In other words, -input-strictly-passive systems can stabilize -output-passivity-short ones by negative feedback.
2.2 Dynamic Decision Making Model under Rationality
This subsection introduces the logit dynamics [19, 23] which is a well-used dynamical discrete choice model.
Consider the situation that decision makers choose a strategy from available strategies. We denote the strategy set as . Suppose that the population of the decision makers can be represented as a continuum value. We now define as the strategy choice distribution set, where describes dimensional vector whose elements are all . We denote the relative interior of the set as . The population state implies the distribution of strategy choice. Specifically, the -th element of , denoted by , implies a fraction of the decision makers selecting strategy .
Let us define a cost vector of which -th element corresponds to the cost for choosing strategy . Then, the logit dynamics [19, 23] is represented as
(1) |
where is a positive constant which indicates the update rate. The function corresponds to the steady state of (1) and follows
(2) |
where implies -th element of , and is a constant. The system (1) is known to guarantee for any time . Remarking that for any pair satisfying , the logit dynamics (1) can be interpreted as an approximated model of best response, i.e., rational decision making [18].
The logit dynamics (1) is also known to satisfy -passivity as below.
Remark that the storage function has a kind of radial unboundedness. See Appendix 6 for the details.
2.3 Bias Models
The logit model (1) corresponds to an approximation of rational strategy choice. Meanwhile, in behavioral economics field, it has been pointed out that human’s decision process is sometimes biased relying on population state. This subsection introduces two models of conformity bias. In particular, we represent these bias models as the ones to affect the cost . Hereafter, we refer to as a biased cost. Alternatively, the actual cost is denoted by , which is basically supposed to be non-negative.
First, we introduce the bias model which is a generalization of interactions model [33]. In this model, the biased cost is given by
(4) |
where is the bias function, whose -th element obeys . The function is assumed to satisfy the following:
Assumption 1
The function obeys the following items:
-
(i)
is continuous in and continuously differentiable in .
-
(ii)
is decreasing in , and uniformly bounded by with some .
-
(iii)
The first derivative is uniformly bounded by with some .
The item (ii) in Assumption 1 implies that if is a majority strategy, the decision makers get a lower impression of cost than the actual cost . Hence, has the tendency that the strategy chosen by many people intensifies its own popularity, which corresponds to conformity bias. The first derivative implies the dependency of on , i.e., this corresponds to the strength of the bias. In particular, , which is the maximum of , can be interpreted as the maximal bias-strength. In the sequel, we call the decision making model composed of (1) and (4) as Model 1. The block diagram of Model 1 is illustrated in Fig. 1.

In this paper, we address another model of conformity bias, presented in [25, 34]. For given , in this model, the biased cost obeys
(5) |
where is the bias matrix. The -th diagonal element () is the bias function for strategy . Throughout this paper, we set the following assumption for the bias function .
Assumption 2
The function obeys the following items:
-
(i)
is continuous in and continuously differentiable in .
-
(ii)
is decreasing in , and uniformly bounded by with some .
-
(iii)
The first derivative is uniformly bounded by with some .
In the subsequent discussion, we call the model composed of (1) and (5) as Model 2. Under Assumption 2, the biased cost for strategy decreases when gets large. In other words, the majority strategy tends to be well chosen. Since is the dependency of on , this implies the strength of the bias and its maximum value represents the maximal bias-strength of Model 2. The block diagram of Model 2 is illustrated in Fig. 2.

3 Passivity Analysis of Decision Making Models
In this section, we analyze the biased decision making models, introduced in the last section, in terms of -passivity.
First, we consider Model 1, which is composed of (1) and (4). From (4), the signal is given by
(6) |
where is negative definite because of Assumption 1. From Lemma 1 and (6), we have the following lemma.
Proof 3.1.
Focusing on the -passivity, the block diagram of Model 1 can be represented as Fig. 3. Lemma 2 suggests that a positive feedback by appears on the outside of the non-biased logit model, as shown in Fig. 3. We can confirm from (7) that the impact coefficient incrementally varies according to strength of the bias . In other words, the conformity bias modeled in (4) violates passivity of decision making.


We next analyze Model 2. Here, we define the diagonal matrix which is negative definite due to Assumption 2. Then, the bias model (5) yields
(8) |
where is a diagonal matrix. Substituting (8) to the inequality in Lemma 1, we can prove the following lemma which is a particular case of [34, Lemma 5].
Lemma 3.2 ([34]).
Proof 3.3.
The block diagram of Model 2 can be illustrated in Fig. 4 by replacing the input and the output as and . Lemma 3.2 reveals that the matrix appears as a positive feedback on the original logit model (1), which is -passive. The impact coefficient in (9) increases with which is the strength of the bias . This result suggests that the conformity bias represented in (5) destabilizes the decision making.
4 Passivity-based Design of Mechanisms
In this section, we propose behavior modification mechanisms to lead decision makers to desired social state. Particularly, we focus on the output-passivity-shortage of the decision making models, shown in the last section, and design mechanism based on passivity paradigm. In the sequel, we assume that the population state is observable, and the desired population state, denoted as , is given as a constant vector. In this paper, a mechanism indicates the system to update the actual cost111In the case of incentive design, the cost is added to decision makers as an economic input. Whereas, in the case of nudge, it is announced to them as an informational input. by using and . The goal in this section is to design mechanisms so as to ensure the inducement for Model 1 and Model 2, respectively.
4.1 Mechanism for Model 1
In this subsection, we consider a mechanism for Model 1. The structure of the mechanism is illustrated in Fig. 5. The gray part in Fig. 5 implies Model 1, and the block is the mechanism. Notice that the system enclosed by the red line is -output-passivity-short, as proved in Lemma 2. In terms of passivity theory, positive energy generated from an output-passivity-short system can be canceled out by negative feedback of an input-strictly-passive system. Hence, we can expect to implement a stable mechanism by designing so as to satisfy input-strict-passivity of the system enclosed by blue line.

Based on the above concept, we propose the mechanism inspired by Proportional-Integral controller, as below:
(10a) | ||||
(10b) |
where and is a design parameter. The mechanism (10) satisfies the following lemma.
Lemma 4.4.
The system (10) is -input-strictly-passive from to for the storage function .
Proof 4.5.
The result in Lemma 4.4 suggests that the system from to , enclosed by the blue line in Fig. 5, is -input-strictly-passive if we apply (10) to . Thus, it is expected that the mechanism (10) cancels out the positive energy in (7) and induces the population state to the desired state .
As a preparation for convergence analysis, we introduce the following lemma about the storage function under the mechanism (10).
Lemma 4.6.
Consider the system (10). Let a signal achieves when . For this specific signal , holds for any .
Proof 4.7.
See Appendix 7.1.
We are now ready to prove the following theorem. In the proof, we use the notation as the set of all signals satisfying .
Theorem 4.8.
Proof 4.9.
We define the function . From Lemma 2 and Lemma 4.4, we obtain
(12) |
under . Denote the initial values of and by and , respectively. Then, holds for any time . Remarking , this implies due to Lemma 4.6. Thus, we can apply the LaSalle’s invariance principle [38], and hence solution of (1), (4) and (10) for any initial conditions and converges to the largest invariant set satisfying .
Consider the state trajectories such that holds. From (12), implies . Hence, should be constant. Focusing on (10), holds and should be constant. If , identically holds and thus should diverge. However, the divergence contradicts . Accordingly, is constant and is satisfied.
As a result, by invoking the LaSalle’s invariance principle, we can prove that asymptotically converges to .
4.2 Mechanism for Model 2
Let us consider to design a mechanism for Model 2. Its structure is illustrated in Fig. 6: The gray part is the decision makers, and is the mechanism. Similar to 4.1, we design to guarantee the passivity from to .

Applying the mechanism (10) to , the following -passivity is satisfied, that is proved in the previous work [34].
By using (10) for , certainly, the whole system in Fig. 6 is composed of the feedback of a -output-passivity-short system and a -input-strictly-passive system. However, the analysis in [34] leaves an important issue about signal boundedness. In [34], the boundedness of the signal is given by an assumption, which is not theoretically guaranteed. In particular, to certify the upper bound of signal , denoted by , is the most significant problem to cancel out the positive energy in (9). Therefore, we should redesign a mechanism for Model 2 to guarantee the existence of , with keeping passivity.
To solve the above issue, we propose the following mechanism.
(13a) | ||||
(13b) |
where and are design parameters, is a parameter satisfying , and is a constant. Remark that (13a) ensures for all time. Thus, the system (13) guarantees the existence of such that holds for all time. About the time derivative of , holds from (13b).
For the passivity analysis of (13), we consider the primitive function of . Under Assumption 2, is continuous. Hence, we can define the following function:
(16) |
For , clearly holds and this reveals that is convex. We denote as the convex conjugate of [39]. Due to the convexity of ,
(17) |
is satisfied [39]. By using these results, we can prove the following lemma.
Lemma 4.10.
Proof 4.11.
Due to the convexity of ,
holds and hence the function becomes positive semi-definite. We first consider the time when mode switch does not happen in (13a) for -th element. Then, the time derivative of along (13) is given by
(18) |
If , then holds and hence
(19) |
Under , holds. Thus, we have
(20) |
If , we obtain and . Then,
(21) |
holds. Since is decreasing function, we obtain . From this inequality and , we have
(22) |
Next, we consider the time when a mode switch occurs in (13a) for -th element. Since is not differentiable at satisfying , we now take in the upper Dini derivative, denoted by . From the results in (20) and (22), we can confirm that
holds for all time . Therefore, we obtain
(23) |
Integrating (23) in time completes the proof.
Thanks to the result in Lemma 4.10, it is revealed that the proposed mechanism (13) guarantees both -input-strict-passivity and the existence of . In other words, the remained issue in the previous method [34] can be cleared by (13). Thus, we can expected to achieve the passivity-based mechanism for Model 2.
Here we introduce the following lemma, which will be used in convergence analysis.
Lemma 4.12.
Consider the system (13). Let a signal achieves when . For this specific signal , holds for any .
Proof 4.13.
See Appendix 7.2.
From Lemma 3.2, Lemma 4.10 and Lemma 4.12, we are now ready to analyze convergence of the proposed mechanism (13) for Model 2. We should remark that the LaSalle’s invariance principle [38] cannot be applied due to non-smoothness of the storage function . Alternatively, we discuss the convergence by using the invariance principle for non-smooth Lyapunov functions [40]. Then, the following theorem can be proven.
Theorem 4.14.
Proof 4.15.
Define the function . From Lemma 3.2 and Lemma 4.10, the upper Dini derivative of satisfies
(24) |
Under , is satisfied and hence holds. Denote the initial values of and by and , respectively. Then, holds for all time. This implies and from Lemma 4.12 and . Accordingly, the invariance principle for non-smooth function [40] is applicable, and trajectories generated by (1), (5) and (13) for any initial conditions and converge to the largest invariant set satisfying .
Let us now suppose the situation under . From (24), yields and hence must be constant. If , then -th element of (13a) follows , which contradicts the boundedness of . Thus, is identically satisfied. If holds for some , must hold. However, this contradicts the fact given by and . Therefore, is satisfied when holds.
In summary, the invariance principle for non-smooth function [40] proves that asymptotically converges to .
Thanks to the upper bound condition ensured by (13), the stability and convergence of the feedback system in Fig. 6 can be exactly guaranteed under the gain condition . Similar to Theorem 4.8, the result in Theorem 4.14 suggests the tendency that large gain will be required for strongly biased decision makers. The quantitative inequality is calculated as a result of passivity-based analysis.
Remark 4.16.
The authors in [32] and [25] proposed a similar nudging mechanism to (10), with assuming that the signal is observable. This assumption is different from the one dealt with in this paper. Whereas, the information is not easy to get from the decision makers since it is implicit variable. Although might be estimated by using and , there is another difficulty of identifying . Thus, we suppose the observation of population state , which is commonly used in the field of evolutionary game [23].
Remark 4.17.
In [25], the authors addressed the biased population dynamics, and analyzed the convergence of nudging mechanism based on singular perturbation. The convergence condition in [25] implicitly relies on the update rate of the decision makers (1). Meanwhile, the result in Theorem 4.14 shows two advantages against [25]. The first one is to explicitly clarify a quantitative condition for stability, which is a benefit of passivity-based analysis. In addition, the proposed mechanism in this paper can design the parameter independently of the update rate , which is the second contribution against the nudging method in [25].
5 Conclusion
In this paper, we addressed design of mechanisms for decision makers with conformity biases. We first introduced two types of bias models addressed in [33] and [25]. Next, we analyzed the population dynamics with the bias models in terms of -passivity. Then, we clarified that conformity biases appear as positive feedback terms, and they break passivity of dynamic decision making. We furthermore presented passivity-based mechanisms for biased population dynamics, and showed convergence conditions for the proposed mechanisms. Accordingly, we confirmed that high gain feedback should have been required for the decision makers with strong biases.
6 Radial Unboundedness of Storage Function
The storage function , defined in (3), satisfies the following lemma.
Lemma 6.18.
Define and . Under , then
holds.
Proof 6.19.
Let us first focus on the second term in the right hand side of (3), which is a convex optimization about . Remarking that works as a barrier function to the inequality constraints, is an optimal solution if and only if there exists satisfying the following conditions:
(25a) | |||
(25b) |
From (25a), we obtain and hence
(26) |
Applying (25b) to (26), we have
(27) |
Hence, we can calculate the second term in the right hand side of (3) as
Thus, the storage function is given as
Let us next focus on the terms depending on . Due to the property of the Log-Sum-Exp function [39],
is satisfied. Noticing that holds and there exists such that , we obtain
(28) |
We now consider the case that happens. Then, goes to infinity due to (28). Therefore, since is finite, holds. This completes the proof.
7 Proof of Lemmas
7.1 Proof of Lemma 4.6
Due to and , the signal of (10a) satisfies . Hence, the system (10) satisfies . Define
When happens, and hold due to the constraint . Then, is also satisfied. Let us consider and defined in Lemma 6.18 under (4). Due to and , we have . Thus, holds when happens. From the above discussion and Lemma 6.18, when the system (10) achieves under , holds. This completes the proof of Lemma 4.6.
7.2 Proof of Lemma 4.12
Before we prove Lemma 4.12, we show the following lemma.
Lemma 7.20.
Consider the signal generated by (13). For any constant and for any signal , the signal is bounded.
Proof 7.21.
Let us suppose the case that the system (13a) satisfies for all . Since (13a) guarantees , must hold for all . Then, there exists a time such that holds for any time . In other words, (13a) follows for any . This yields and hence must be constant for any time . This contradicts the assumption satisfying .
References
- [1] G. Como, K. Savla, D. Acemoglu, M.A. Dahleh and E. Frazzoli, “Stability analysis of transportation networks with multiscale driver decisions,” SIAM Journal on Control and Optimization, vol. 51, no. 1, pp. 230–252, 2013.
- [2] C.J. Day, B.F. Hobbs and J. Pang, “Oligopolistic competition in power networks: A conjectured supply function approach,” IEEE Transactions on Power Systems, vol. 17, no. 3, pp. 597–607, 2002.
- [3] E. Bompard, Y.C. Ma, R. Napoli, G. Gross and T. Guler, “Comparative analysis of game theory models for assessing the performances of network constrained electricity markets,” IET Generation, Transmission & Distribution, vol. 4, no. 3, pp. 386–399, 2010.
- [4] N. Li, L. Chen and M. Dahleh, “Demand response using linear supply function bidding,” IEEE Transactions on Smart Grid vol. 6, no. 4, pp. 1827–1838, 2015.
- [5] R. Sugden, “Rational choice: A survey of contributions from economics and philosophy,” The Economic Journal, vol. 101, no. 407, pp. 751–85, 1991.
- [6] D. Kahneman and A. Tversky, “Prospect theory: An analysis of decision under risk,” Econometrica, vol. 47, no. 2, pp. 263–291, 1979.
- [7] I. Brocas and J.D. Carrillo, “Dual-process theories of decision-making: A selective survey,” Journal of Economic Psychology, vol. 41, pp. 45–54, 2014.
- [8] Y. Guan, A.M. Annaswamy and H.E. Tseng, “Cumulative prospect theory based dynamic pricing for shared mobility on demand services,” Proc. IEEE 58th Conference on Decision and Control, pp. 2239–2244, 2019.
- [9] D.M. Mason, L. Stella and D. Bauso, “Evolutionary game dynamics for crowd behavior in emergency evacuations,” Proc. IEEE 59th Conference on Decision and Control, pp. 1672–1677, 2020.
- [10] T. Kameda and D. Nakanishi, “Cost-benefit analysis of social/cultural learning in a nonstationary uncertain environment: An evolutionary simulation and an experiment with human subjects,” Evolution and Human Behavior, vol. 23, no. 5, pp. 373–393, 2002.
- [11] D. Fukuda and S. Morichi, “Incorporating aggregate behavior in an individual’s discrete choice: An application to analyzing illegal bicycle parking behavior,” Transportation Research Part A, vol. 41, no. 4, pp. 313–325, 2007.
- [12] J. Urata and E. Hato, “Modeling the cooperation network formation process for evacuation systems design in disaster areas with a focus on Japanese megadisasters,” Leadership and Management in Engineering, vol. 12, no. 4, pp. 231–246, 2012.
- [13] K. Train, Discrete Choice Methods with Simulation, SUNY-Oswego, Department of Economics, 2003.
- [14] K. Srinivasan and H. Mahmassani, “Modeling inertia and compliance mechanisms in route choice behavior under real-time information,” Transportation Research Record: Journal of the Transportation Research Board, no. 1725, pp. 45–53, 2000.
- [15] J. Sagebiel, “Preference heterogeneity in energy discrete choice experiments: A review on methods for model selection,” Renewable and Sustainable Energy Reviews, vol. 69, pp. 804–811, 2017.
- [16] E. Ramírez-Llanos and N. Quijano, “A population dynamics approach for the water distribution problem,” International Journal of Control, vol. 83, pp. 1947–1964, 2010.
- [17] W. Mei, N.E. Friedkin, K. Lewis and F. Bullo, “Dynamic models of appraisal networks explaining collective learning,” IEEE Transactions on Automatic Control, vol. 63, no. 9, pp. 2898–2912, 2018.
- [18] J. Hofbauer and E. Hopkins, “Learning in perturbed asymmetric games,” Games and Economic Behavior, vol. 52, no. 1, pp. 133–152, 2005.
- [19] J. Hofbauer and W.H. Sandholm, “Evolution in games with randomly disturbed payoffs,” Journal of Economic Theory, vol. 132, no. 1, pp. 47–69, 2007.
- [20] M.J. Smith, “The stability of a dynamic model of traffic assignment: An application of a method of Lyapunov,” Transportation Science, vol. 18, no. 3, pp. 245–252, 1984.
- [21] W.H. Sandholm, “Pairwise comparison dynamics and evolutionary foundations for Nash equilibrium,” Games, vol. 1, no. 1, pp. 3–17, 2010.
- [22] M.J. Fox and J.S. Shamma, “Population games, stable games, and passivity,” Games, vol. 4, no. 4, pp. 561–583, 2013.
- [23] S. Park, J.S. Shamma and N.C. Martins, “Passivity and evolutionary game dynamics,” Proc. IEEE 57th Conference on Decision and Control, pp. 3553–3560, 2018.
- [24] A. Pashaie, L. Pavel and C.J. Damaren, “A population game approach for dynamic resource allocation problems,” International Journal of Control, vol. 90, no. 9, pp. 1957–1972, 2017.
- [25] Y. Cheng and C. Langbort, “On informational nudging for boundedlly rational decision makers,” Proc. IEEE 57th Conference on Decision and Control, pp. 4591–4796, 2018.
- [26] W. Zhao, H. Yang, X. Deng and C. Zhong, “Stability of equilibria for population games with uncertain parameters under bounded rationality,” Journal of Inequalities and Applications, vol. 2021, no. 15, 2021.
- [27] J.J. Laffont and D. Martimort, The Theory of Incentives: The Principal-Agent Model, Princeton University Press, 2002.
- [28] R.H. Thaler and C.R. Sunstein, Nudge: Improving Decisions about Health, Wealth, and Happiness, Yale University Press, 2008.
- [29] L.J. Ratliff, R. Dong, H. Ohlsson and S.S. Sastry, “Incentive design and utility learning via energy disaggregation,” IFAC Proceedings Volumes, vol. 47, no. 3, pp. 3158–3163, 2014.
- [30] M. Shakarami, A. Cherukuri and N. Monshizadeh, “Nudging the aggregative behavior of noncooperative agents,” Proc. IEEE 59th Conference on Decision and Control, pp. 2579–2584, 2020.
- [31] J.S. Weitz, C. Eksin, K. Paarporn, S.P. Brown and W.C. Ratcliff, “An oscillating tragedy of the commons in replicator dynamics with game-environment feedback,” Proc. the National Academy of Sciences, vol. 113, no. 47, E7518–E7525, 2016.
- [32] Y. Cheng and C. Langbort, “A model of informational nudging in transportation networks,” Proc. IEEE 55th Conference on Decision and Control, pp. 7598–7604, 2016.
- [33] W.A. Brock and S.N. Durlauf, “Interactions-based models,” Handbook of Econometrica, vol. 5, pp. 3297–3380, 2001.
- [34] S. Yamashita, T. Hatanaka, Y. Wasa, N. Hayashi, K. Hirata and K. Uchida, “Passivity-based analysis and nudging design for dynamics social model with bounded rationality,” IFAC-PapersOnLine, vol. 53, no. 5, pp. 338–343, 2020.
- [35] T. Hatanaka, N. Chopra, M. Fujita and M.W. Spong, Passivity-Based Control and Estimation in Networked Robotics, Springer-Verlag, 2015.
- [36] Z. Qu and M.A. Simaan, “Modularized design for cooperative control and plug-and-play operation of networked heterogeneous systems,” Automatica, vol. 50, no. 9, pp. 2405–2414, 2014.
- [37] R. Sepulchre, M. Jankovic and P.V. Kokotovic, Constructive Nonlinear Control, Springer, London, 2012.
- [38] H.K. Khalil, Nonlinear Systems, 3rd edition, Prentice Hall, 2002.
- [39] S. Boyd and L. Vandenberghe, Convex Optimization, Cambridge University Press, 2004.
- [40] D. Shevitz and B. Paden, “Lyapunov stability theory of nonsmooth systems,” IEEE Transactions on Automatic Control, vol. 39, no. 9, pp. 1910–1914, 1994.