This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

Passivity-based Analysis and Design for Population Dynamics with Conformity Biases

Shunya Yamashita    \IEEEmembershipStudent Member, IEEE    Kodai Irifune    Takeshi Hatanaka    \IEEEmembershipSenior Member, IEEE   
Yasuaki Wasa
   \IEEEmembershipMember, IEEE    Kenji Hirata    \IEEEmembershipMember, IEEE and Kenko Uchida    \IEEEmembershipMember, IEEE This work was supported in part by JST-Mirai Program under Grant 18077648, and in part by JSPS KAKENHI under Grant 21J13956. S. Yamashita, K. Irifune and T. Hatanaka are with the School of Engineering, Tokyo Institute of Technology, Tokyo 152-8550, Japan (e-mail: [email protected]; [email protected]; [email protected]). Y. Wasa and K. Uchida are with the School of Advanced Science and Engineering, Waseda University, Tokyo 169-8555, Japan (e-mail: [email protected]; [email protected]). K. Hirata is with the Faculty of Engineering, University of Toyama, Toyama 930-8555, Japan (e-mail: [email protected]).
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 δ\delta-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.

{IEEEkeywords}

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 δ\delta-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 δ\delta-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: δ\delta-Passivity

This subsection introduces δ\delta-passivity [23] which is a similar concept to passive systems [35]. Suppose a system Σ\Sigma represented by the state space model

x˙=f(x,u),\displaystyle\dot{x}=f(x,u),

where xnx\in\mathbb{R}^{n} is the state, unu\in\mathbb{R}^{n} is the input, and f:n×nnf:\mathbb{R}^{n}\times\mathbb{R}^{n}\to\mathbb{R}^{n} is a function. Then, Σ\Sigma is called δ\delta-passive from u˙\dot{u} to x˙\dot{x} if there exists a positive semi-definite function S:n×n[0,)S:\mathbb{R}^{n}\times\mathbb{R}^{n}\to[0,\infty) and a scalar ρ0\rho\geq 0 such that

S(u(t),x(t))S(u(0),x(0))0tx˙(t^)u˙(t^)ρu˙(t^)2dt^\displaystyle S(u(t),x(t))-S(u(0),x(0))\leq\int_{0}^{t}\dot{x}^{\top}(\hat{t})\dot{u}(\hat{t})-\rho||\dot{u}(\hat{t})||^{2}d\hat{t}

for all input uu, all initial state x(0)x(0) and all t0t\geq 0. The positive semi-definite function SS is particularly called a storage function. In addition, Σ\Sigma is called δ\delta-input-strictly-passive if the above inequality is satisfied with some positive scalar ρ>0\rho>0. As widely known, if SS is differentiable, we can replace the above inequality with S˙(u(t),x(t))x˙(t)u˙(t)ρu˙(t)2\dot{S}(u(t),x(t))\leq\dot{x}^{\top}(t)\dot{u}(t)-\rho||\dot{u}(t)||^{2}.

In the same way as passivity shortage [36], we define δ\delta-output-passivity-shortage. The system Σ\Sigma is called δ\delta-output-passivity-short from u˙\dot{u} to x˙\dot{x} if there exists a positive semi-definite function S:n×n[0,)S:\mathbb{R}^{n}\times\mathbb{R}^{n}\to[0,\infty), and a scalar γ0\gamma\geq 0 such that

S(u(t),x(t))S(u(0),x(0))0tx˙(t^)u˙(t^)+γx˙(t^)2dt^\displaystyle S(u(t),x(t))-S(u(0),x(0))\leq\int_{0}^{t}\dot{x}^{\top}(\hat{t})\dot{u}(\hat{t})+\gamma||\dot{x}(\hat{t})||^{2}d\hat{t}

for all input uu, all initial state x(0)x(0) and all t0t\geq 0. We call the value γ\gamma as an impact coefficient. If SS is differentiable, the above inequality is equivalent to S˙(u(t),x(t))x˙(t)u˙(t)+γx˙(t)2\dot{S}(u(t),x(t))\leq\dot{x}^{\top}(t)\dot{u}(t)+\gamma||\dot{x}(t)||^{2}.

Feedback system composed of strictly passive component and passivity-short one is related to the Lyapunov stability [35, 37]. Consider a δ\delta-input-strictly-passive system whose input is u1u_{1} and state is x1x_{1}, which satisfies S˙1x˙1u˙1ρu˙12\dot{S}_{1}\leq\dot{x}_{1}^{\top}\dot{u}_{1}-\rho\|\dot{u}_{1}\|^{2} for a differentiable storage function S1S_{1} and ρ>0\rho>0. We also suppose a δ\delta-output-passivity-short system whose input is u2u_{2} and state is x2x_{2}, which satisfies S˙2x˙2u˙2+γx˙22\dot{S}_{2}\leq\dot{x}_{2}^{\top}\dot{u}_{2}+\gamma\|\dot{x}_{2}\|^{2} for a differentiable storage function S2S_{2} and γ>0\gamma>0. Then, the feedback interconnection under u1=x2u_{1}=x_{2} and u2=x1u_{2}=-x_{1} provides

S˙1+S˙2(γρ)x˙12.\displaystyle\dot{S}_{1}+\dot{S}_{2}\leq(\gamma-\rho)\|\dot{x}_{1}\|^{2}.

If γρ\gamma\leq\rho holds and S1+S2S_{1}+S_{2} is radially unbounded, the above inequality suggests stability of the feedback system in the sense of Lyapunov [35]. In other words, δ\delta-input-strictly-passive systems can stabilize δ\delta-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 nn available strategies. We denote the strategy set as 𝒜:={1,2,,n}\mathcal{A}:=\{1,2,\ldots,n\}. Suppose that the population of the decision makers can be represented as a continuum value. We now define 𝒮:={x[0,1]n1nx=1}\mathcal{S}:=\{x\in[0,1]^{n}\mid\textbf{1}_{n}^{\top}x=1\} as the strategy choice distribution set, where 1n\textbf{1}_{n} describes nn dimensional vector whose elements are all 11. We denote the relative interior of the set 𝒮\mathcal{S} as int(𝒮)\textrm{int}(\mathcal{S}). The population state π𝒮\pi\in\mathcal{S} implies the distribution of strategy choice. Specifically, the kk-th element of π\pi, denoted by πk[0,1]\pi_{k}\in[0,1], implies a fraction of the decision makers selecting strategy k𝒜k\in\mathcal{A}.

Let us define a cost vector τn\tau\in\mathbb{R}^{n} of which kk-th element τk\tau_{k}\in\mathbb{R} corresponds to the cost for choosing strategy k𝒜k\in\mathcal{A}. Then, the logit dynamics [19, 23] is represented as

π˙=η(Q(τ)π),π(0)int(𝒮),\displaystyle\dot{\pi}=\eta\left(Q(\tau)-\pi\right),\ \pi(0)\in\textrm{int}(\mathcal{S}), (1)

where η\eta is a positive constant which indicates the update rate. The function Q:nint(𝒮)Q:\mathbb{R}^{n}\to\textrm{int}(\mathcal{S}) corresponds to the steady state of (1) and follows

Qk(τ)=exp(βτk)l𝒜exp(βτl),\displaystyle Q_{k}(\tau)=\frac{\exp(-\beta\tau_{k})}{\sum\limits_{l\in\mathcal{A}}\exp(-\beta\tau_{l})}, (2)

where Qk:n(0,1)Q_{k}:\mathbb{R}^{n}\to(0,1) implies kk-th element of QQ, and β>0\beta>0 is a constant. The system (1) is known to guarantee π(t)int(𝒮)\pi(t)\in\textrm{int}(\mathcal{S}) for any time t0t\geq 0. Remarking that Qk(τ)>Qi(τ)Q_{k}(\tau)>Q_{i}(\tau) for any pair kik\neq i satisfying τk<τi\tau_{k}<\tau_{i}, 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 δ\delta-passivity as below.

Lemma 1 ([23])

The logit dynamics (1) is δ\delta-passive from τ˙-\dot{\tau} to π˙\dot{\pi} for the storage function

S(τ,π):=\displaystyle S(\tau,\pi):=\ η(πτ+1βl𝒜πllogπl)\displaystyle\eta\left(\pi^{\top}\tau+\frac{1}{\beta}\sum_{l\in\mathcal{A}}\pi_{l}\log{\pi_{l}}\right)
ηminω𝒮(ωτ+1βl𝒜ωllogωl),\displaystyle\ -\eta\min_{\omega\in\mathcal{S}}\left(\omega^{\top}\tau+\frac{1}{\beta}\sum_{l\in\mathcal{A}}\omega_{l}\log{\omega_{l}}\right), (3)

i.e., S˙τ˙π˙\dot{S}\leq-\dot{\tau}^{\top}\dot{\pi} holds.

Remark that the storage function S(τ,π)S(\tau,\pi) 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 τ\tau. Hereafter, we refer to τ\tau as a biased cost. Alternatively, the actual cost is denoted by TnT\in\mathbb{R}^{n}, 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 τ\tau is given by

τ=T+B(π),\displaystyle\tau=T+B(\pi), (4)

where B:𝒮nB:\mathcal{S}\to\mathbb{R}^{n} is the bias function, whose kk-th element obeys bk(πk)b_{k}(\pi_{k}). The function bk:[0,1]b_{k}:[0,1]\to\mathbb{R} is assumed to satisfy the following:

Assumption 1

The function bk(k𝒜)b_{k}\ (k\in\mathcal{A}) obeys the following items:

  • (i)

    bkb_{k} is continuous in [0,1][0,1] and continuously differentiable in (0,1)(0,1).

  • (ii)

    bkb_{k} is decreasing in πk\pi_{k}, and uniformly bounded by [bL,bH][b^{L},b^{H}] with some bHbLb^{H}\geq b^{L}.

  • (iii)

    The first derivative bk\nabla b_{k} is uniformly bounded by [cH,cL][-c^{H},-c^{L}] with some cHcL>0c^{H}\geq c^{L}>0.

The item (ii) in Assumption 1 implies that if k𝒜k\in\mathcal{A} is a majority strategy, the decision makers get a lower impression of cost than the actual cost TkT_{k}. Hence, B(π)B(\pi) has the tendency that the strategy chosen by many people intensifies its own popularity, which corresponds to conformity bias. The first derivative bk\nabla b_{k} implies the dependency of bkb_{k} on πk\pi_{k}, i.e., this corresponds to the strength of the bias. In particular, cHc^{H}, which is the maximum of |bk(πk)||\nabla b_{k}(\pi_{k})|, 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.

Refer to caption
Figure 1: Block diagram of Model 1. The system colored by khaki is the logit model (1).

In this paper, we address another model of conformity bias, presented in [25, 34]. For given TT, in this model, the biased cost τ\tau obeys

τ=W(π)T,\displaystyle\tau=W(\pi)T, (5)

where W(π)=diag(w1(π1),w2(π2),,wn(πn))W(\pi)=\textrm{diag}(w_{1}(\pi_{1}),w_{2}(\pi_{2}),\ldots,w_{n}(\pi_{n})) is the bias matrix. The kk-th diagonal element wk:[0,1]w_{k}:[0,1]\to\mathbb{R} (k𝒜k\in\mathcal{A}) is the bias function for strategy kk. Throughout this paper, we set the following assumption for the bias function wkw_{k}.

Assumption 2

The function wk(k𝒜)w_{k}\ (k\in\mathcal{A}) obeys the following items:

  • (i)

    wkw_{k} is continuous in [0,1][0,1] and continuously differentiable in (0,1)(0,1).

  • (ii)

    wkw_{k} is decreasing in πk\pi_{k}, and uniformly bounded by [wL,wH][w^{L},w^{H}] with some wHwL>0w^{H}\geq w^{L}>0.

  • (iii)

    The first derivative wk\nabla w_{k} is uniformly bounded by [vH,vL][-v^{H},-v^{L}] with some vHvL>0v^{H}\geq v^{L}>0.

In the subsequent discussion, we call the model composed of (1) and (5) as Model 2. Under Assumption 2, the biased cost for strategy kk decreases when πk\pi_{k} gets large. In other words, the majority strategy tends to be well chosen. Since |wk||\nabla w_{k}| is the dependency of wkw_{k} on πk\pi_{k}, this implies the strength of the bias and its maximum value vHv^{H} represents the maximal bias-strength of Model 2. The block diagram of Model 2 is illustrated in Fig. 2.

Refer to caption
Figure 2: Block diagram of Model 2. The khaki part implies (1).

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 δ\delta-passivity.

First, we consider Model 1, which is composed of (1) and (4). From (4), the signal τ˙\dot{\tau} is given by

τ˙=T˙+B(π)π˙,\displaystyle\dot{\tau}=\dot{T}+B^{\prime}(\pi)\dot{\pi}, (6)

where B(π):=diag(b1(π1),b2(π2),,bn(πn))B^{\prime}(\pi):=\textrm{diag}(\nabla b_{1}(\pi_{1}),\nabla b_{2}(\pi_{2}),\dots,\nabla b_{n}(\pi_{n})) is negative definite because of Assumption 1. From Lemma 1 and (6), we have the following lemma.

Lemma 2

Under Assumption 1, the system (1) with (4) is δ\delta-output-passivity-short from T˙-\dot{T} to π˙\dot{\pi}.

Proof 3.1.

Consider the function S(τ,π)S(\tau,\pi) defined in (3) with substituting τ=T+B(π)\tau=T+B(\pi). From Lemma 1, we have

S˙\displaystyle\dot{S} τ˙π˙\displaystyle\leq-\dot{\tau}^{\top}\dot{\pi}
=(T˙+B(π)π˙)π˙\displaystyle=-(\dot{T}+B^{\prime}(\pi)\dot{\pi})^{\top}\dot{\pi}
=T˙π˙π˙B(π)π˙\displaystyle=-\dot{T}^{\top}\dot{\pi}-\dot{\pi}^{\top}B^{\prime}(\pi)\dot{\pi}
T˙π˙+cHπ˙2.\displaystyle\leq-\dot{T}^{\top}\dot{\pi}+c^{H}\|\dot{\pi}\|^{2}. (7)

This completes the proof.

Focusing on the δ\delta-passivity, the block diagram of Model 1 can be represented as Fig. 3. Lemma 2 suggests that a positive feedback by B(π)-B^{\prime}(\pi) 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 cHc^{H}. In other words, the conformity bias modeled in (4) violates passivity of decision making.

Refer to caption
Figure 3: Block diagram of Model 1 expressed along δ\delta-passivity. The khaki part is δ\delta-passive (Lemma 1).
Refer to caption
Figure 4: Block diagram of Model 2 expressed along δ\delta-passivity.

We next analyze Model 2. Here, we define the diagonal matrix W(π):=diag(w1(π1),w2(π2),,wn(πn))W^{\prime}(\pi):=\textrm{diag}(\nabla w_{1}(\pi_{1}),\nabla w_{2}(\pi_{2}),\dots,\nabla w_{n}(\pi_{n})) which is negative definite due to Assumption 2. Then, the bias model (5) yields

τ˙\displaystyle\dot{\tau} =W(π)T˙+diag(W(π)π˙)T\displaystyle=W(\pi)\dot{T}+\textrm{diag}(W^{\prime}(\pi)\dot{\pi})T
=W(π)T˙Φ(T,π)π˙,\displaystyle=W(\pi)\dot{T}-\Phi(T,\pi)\dot{\pi}, (8)

where Φ(T,π):=W(π)diag(T)\Phi(T,\pi):=-W^{\prime}(\pi)\textrm{diag}(T) 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]).

Suppose that there exists a constant Tmax>0T_{\max}>0 such that Tk(t)TmaxT_{k}(t)\leq T_{\max} holds for all k𝒜k\in\mathcal{A} and for all t0t\geq 0. Under Assumption 2, the system (1) with (5) is δ\delta-output-passivity-short from T˙-\dot{T} to y:=W(π)π˙y:=W(\pi)\dot{\pi}.

Proof 3.3.

Consider the function S(τ,π)S(\tau,\pi) with substituting τ=W(π)T\tau=W(\pi)T. From Lemma 1 and (8), we obtain

S˙\displaystyle\dot{S} τ˙π˙\displaystyle\leq-\dot{\tau}^{\top}\dot{\pi}
=(W(π)T˙Φ(T,π)π˙)π˙\displaystyle=-\left(W(\pi)\dot{T}-\Phi(T,\pi)\dot{\pi}\right)^{\top}\dot{\pi}
=T˙W(π)π˙+π˙Φ(T,π)π˙\displaystyle=-\dot{T}^{\top}W(\pi)\dot{\pi}+\dot{\pi}^{\top}\Phi(T,\pi)\dot{\pi}
=T˙y+y(W(π))1Φ(T,π)(W(π))1y\displaystyle=-\dot{T}^{\top}y+y^{\top}(W(\pi))^{-1}\Phi(T,\pi)(W(\pi))^{-1}y
T˙y+vHTmax(wL)2y2.\displaystyle\leq-\dot{T}^{\top}y+\frac{v^{H}T_{\max}}{(w^{L})^{2}}\|y\|^{2}. (9)

This completes the proof.

The block diagram of Model 2 can be illustrated in Fig. 4 by replacing the input and the output as T˙-\dot{T} and yy. Lemma 3.2 reveals that the matrix Φ(T,π)\Phi(T,\pi) appears as a positive feedback on the original logit model (1), which is δ\delta-passive. The impact coefficient in (9) increases with vHv^{H} which is the strength of the bias W(π)W(\pi). This result suggests that the conformity bias represented in (5) destabilizes the decision making.

Both of Lemmas 2 and 3.2 indicate that the positive feedback paths attributed by the conformity biases violate δ\delta-passivity of the original rational model (1). Therefore, we conclude that the conformity bias works to destabilize the dynamic 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 π\pi is observable, and the desired population state, denoted as πint(𝒮)\pi^{*}\in\textrm{int}(\mathcal{S}), 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 T(t)T(t) is added to decision makers as an economic input. Whereas, in the case of nudge, it is announced to them as an informational input. TT by using π\pi and π\pi^{*}. The goal in this section is to design mechanisms so as to ensure the inducement limtπ(t)=π\lim_{t\to\infty}\pi(t)=\pi^{*} 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 Σ1\Sigma_{1} is the mechanism. Notice that the system enclosed by the red line is δ\delta-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 Σ1\Sigma_{1} so as to satisfy input-strict-passivity of the system enclosed by blue line.

Refer to caption
Figure 5: Block diagram of a mechanism for Model 1. The gray part corresponds to the decision makers. The system enclosed by the red line is δ\delta-output-passivity-short (Lemma 2). The system Σ1\Sigma_{1} is a mechanism for Model 1 to make the system of blue line δ\delta-passive.

Based on the above concept, we propose the mechanism inspired by Proportional-Integral controller, as below:

μ˙\displaystyle\dot{\mu} =ρ(ππ),\displaystyle=\rho\left(\pi-\pi^{*}\right), (10a)
T\displaystyle T =μ+κ(ππ),\displaystyle=\mu+\kappa(\pi-\pi^{*}), (10b)

where ρ>0\rho>0 and κ>0\kappa>0 is a design parameter. The mechanism (10) satisfies the following lemma.

Lemma 4.4.

The system (10) is δ\delta-input-strictly-passive from π˙\dot{\pi} to T˙\dot{T} for the storage function H(π):=ρ2ππ2H(\pi):=\frac{\rho}{2}\|\pi-\pi^{*}\|^{2}.

Proof 4.5.

From (10b), T˙=μ˙+κπ˙\dot{T}=\dot{\mu}+\kappa\dot{\pi} holds. Noticing this result and (10a), we have

H˙\displaystyle\dot{H} =ρ(ππ)π˙=μ˙π˙\displaystyle=\rho(\pi-\pi^{*})^{\top}\dot{\pi}=\dot{\mu}^{\top}\dot{\pi}
=T˙π˙κπ˙2.\displaystyle=\dot{T}^{\top}\dot{\pi}-\kappa\|\dot{\pi}\|^{2}. (11)

This result shows the δ\delta-input-strict-passivity of (10).

The result in Lemma 4.4 suggests that the system from π˙\dot{\pi} to T˙\dot{T}, enclosed by the blue line in Fig. 5, is δ\delta-input-strictly-passive if we apply (10) to Σ1\Sigma_{1}. Thus, it is expected that the mechanism (10) cancels out the positive energy in (7) and induces the population state π\pi to the desired state π\pi^{*}.

As a preparation for convergence analysis, we introduce the following lemma about the storage function SS under the mechanism (10).

Lemma 4.6.

Consider the system (10). Let a signal π(t)int(𝒮)\pi(t)\in\textrm{int}(\mathcal{S}) achieves T(t)\|T(t)\|\to\infty when tt\to\infty. For this specific signal π(t)\pi(t), S(T+B(π),π)S(T+B(\pi),\pi)\to\infty holds for any πint(𝒮)\pi^{*}\in\textrm{int}(\mathcal{S}).

Proof 4.7.

See Appendix 7.1.

We are now ready to prove the following theorem. In the proof, we use the notation \mathcal{L}_{\infty} as the set of all signals u:[0,)nu:[0,\infty)\to\mathbb{R}^{n} satisfying supt[0,)u(t)<\sup_{t\in[0,\infty)}\|u(t)\|<\infty.

Theorem 4.8.

Consider the feedback system composed of (1), (4) and (10). When κ>cH\kappa>c^{H} holds, the population state π\pi achieves limtπ(t)=π\lim_{t\to\infty}\pi(t)=\pi^{*}.

Proof 4.9.

We define the function V1:=S(T+B(π),π)+H(π)V_{1}:=S(T+B(\pi),\pi)+H(\pi). From Lemma 2 and Lemma 4.4, we obtain

V˙1\displaystyle\dot{V}_{1} T˙π˙+cHπ˙2+T˙π˙κπ˙2\displaystyle\leq-\dot{T}^{\top}\dot{\pi}+c^{H}\|\dot{\pi}\|^{2}+\dot{T}^{\top}\dot{\pi}-\kappa\|\dot{\pi}\|^{2}
=(κcH)π˙20\displaystyle=-(\kappa-c^{H})\|\dot{\pi}\|^{2}\leq 0 (12)

under κ>cH\kappa>c^{H}. Denote the initial values of SS and HH by S0S_{0} and H0H_{0}, respectively. Then, V1S0+H0<V_{1}\leq S_{0}+H_{0}<\infty holds for any time t0t\geq 0. Remarking πint(𝒮)\pi\in\textrm{int}(\mathcal{S}), this implies TT\in\mathcal{L}_{\infty} 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 T(0)nT(0)\in\mathbb{R}^{n} and π(0)int(𝒮)\pi(0)\in\textrm{int}(\mathcal{S}) converges to the largest invariant set satisfying V˙1=0\dot{V}_{1}=0.

Consider the state trajectories such that V˙10\dot{V}_{1}\equiv 0 holds. From (12), V˙10\dot{V}_{1}\equiv 0 implies π˙0\dot{\pi}\equiv 0. Hence, π\pi should be constant. Focusing on (10), T˙μ˙\dot{T}\equiv\dot{\mu} holds and μ˙=ρ(ππ)\dot{\mu}=\rho(\pi-\pi^{*}) should be constant. If ππ\pi\neq\pi^{*}, T˙0\dot{T}\neq 0 identically holds and thus TT should diverge. However, the divergence contradicts TT\in\mathcal{L}_{\infty}. Accordingly, TT is constant and ππ\pi\equiv\pi^{*} is satisfied.

As a result, by invoking the LaSalle’s invariance principle, we can prove that π\pi asymptotically converges to π\pi^{*}.

Theorem 4.8 shows that the mechanism (10) can induce the decision makers of Model 1 to desired state if we design the parameter κ\kappa large enough. The right hand side of the convergence condition κ>cH\kappa>c^{H} is given by the bias-strength. Hence, for the strongly biased decision makers, κ\kappa is needed to be set large.

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 Σ2\Sigma_{2} is the mechanism. Similar to 4.1, we design Σ2\Sigma_{2} to guarantee the passivity from yy to T˙\dot{T}.

Refer to caption
Figure 6: Block diagram of a mechanism for Model 2. The gray part corresponds to the decision makers. The system enclosed by the red line is δ\delta-output-passivity-short (Lemma 3.2). The system Σ2\Sigma_{2} is a mechanism for Model 2 to make the system in blue line δ\delta-passive.

Applying the mechanism (10) to Σ2\Sigma_{2}, the following δ\delta-passivity is satisfied, that is proved in the previous work [34].

Fact 1 ([34]).

Under Assumption 2, the system (10) is δ\delta-input-strictly-passive from yy to T˙\dot{T}.

By using (10) for Σ2\Sigma_{2}, certainly, the whole system in Fig. 6 is composed of the feedback of a δ\delta-output-passivity-short system and a δ\delta-input-strictly-passive system. However, the analysis in [34] leaves an important issue about signal boundedness. In [34], the boundedness of the signal TT is given by an assumption, which is not theoretically guaranteed. In particular, to certify the upper bound of signal TT, denoted by TmaxT_{\max}, 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 TmaxT_{\max}, with keeping passivity.

To solve the above issue, we propose the following mechanism.

μ˙\displaystyle\dot{\mu} =min{ρ(ππ),αμ},μ(0)0,\displaystyle=\min\left\{\rho\left(\pi-\pi^{*}\right),-\alpha\mu\right\},\ \mu(0)\leq 0, (13a)
T\displaystyle T =T¯1n+μ+κ(ππ),\displaystyle=\bar{T}\textbf{1}_{n}+\mu+\kappa(\pi-\pi^{*}), (13b)

where ρ>0\rho>0 and κ>0\kappa>0 are design parameters, α>0\alpha>0 is a parameter satisfying α>12κ\alpha>\frac{1}{2\kappa}, and T¯>0\bar{T}>0 is a constant. Remark that (13a) ensures μ0\mu\leq 0 for all time. Thus, the system (13) guarantees the existence of Tmax<T¯+κT_{\max}<\bar{T}+\kappa such that TkTmaxk𝒜T_{k}\leq T_{\max}\ \forall k\in\mathcal{A} holds for all time. About the time derivative of TT, T˙=μ˙+κπ˙\dot{T}=\dot{\mu}+\kappa\dot{\pi} holds from (13b).

For the passivity analysis of (13), we consider the primitive function of wkw_{k}. Under Assumption 2, wkw_{k} is continuous. Hence, we can define the following function:

Fk(πk)\displaystyle F_{k}(\pi_{k}) :={0πk(0ϕwk(θ)𝑑θ)𝑑ϕifπk[0,1],otherwise.\displaystyle:=\left\{\begin{array}[]{cl}\displaystyle{\int_{0}^{\pi_{k}}\left(\int_{0}^{\phi}w_{k}(\theta)d\theta\right)d\phi}&\textrm{if}\ \pi_{k}\in[0,1],\\ \infty&\textrm{otherwise}.\end{array}\right. (16)

For πk(0,1)\pi_{k}\in(0,1), 2Fk(πk)=wk(πk)wL\nabla^{2}F_{k}(\pi_{k})=w_{k}(\pi_{k})\geq w^{L} clearly holds and this reveals that FkF_{k} is convex. We denote Fk:F^{\star}_{k}:\mathbb{R}\to\mathbb{R} as the convex conjugate of FkF_{k} [39]. Due to the convexity of FkF_{k},

πk=Fk(Fk(πk)),πk(0,1)\displaystyle\pi_{k}=\nabla F^{\star}_{k}(\nabla F_{k}(\pi_{k})),\ \pi_{k}\in(0,1) (17)

is satisfied [39]. By using these results, we can prove the following lemma.

Lemma 4.10.

Define ζk:=Fk(min{πk,πkαρμk})\zeta_{k}:=\nabla F_{k}(\min\{\pi_{k},\pi_{k}^{*}-\frac{\alpha}{\rho}\mu_{k}\}) and ζk:=Fk(πk)\zeta_{k}^{*}:=\nabla F_{k}(\pi_{k}^{*}) for each k𝒜k\in\mathcal{A}. Under Assumption 2, the system (13) is δ\delta-input-strictly-passive from yy to T˙\dot{T} for the storage function

U(μ,π)\displaystyle U(\mu,\pi) :=k𝒜Uk(μk,πk),\displaystyle:=\sum_{k\in\mathcal{A}}U_{k}(\mu_{k},\pi_{k}),
Uk(μk,πk)\displaystyle U_{k}(\mu_{k},\pi_{k}) :=ρ(Fk(ζk)Fk(ζk)(ζkζk)Fk(ζk)).\displaystyle:=\rho\left(F^{\star}_{k}(\zeta_{k})-F^{\star}_{k}(\zeta_{k}^{*})-(\zeta_{k}-\zeta_{k}^{*})\nabla F^{\star}_{k}(\zeta_{k}^{*})\right).
Proof 4.11.

Due to the convexity of FkF^{\star}_{k},

Fk(ζk)Fk(ζk)(ζkζk)Fk(ζk)\displaystyle F^{\star}_{k}(\zeta_{k})-F^{\star}_{k}(\zeta_{k}^{*})\geq(\zeta_{k}-\zeta_{k}^{*})\nabla F^{\star}_{k}(\zeta_{k}^{*})

holds and hence the function UkU_{k} becomes positive semi-definite. We first consider the time when mode switch does not happen in (13a) for kk-th element. Then, the time derivative of UkU_{k} along (13) is given by

U˙k=ρ(Fk(ζk)Fk(ζk))ζ˙k.\displaystyle\dot{U}_{k}=\rho\left(\nabla F^{\star}_{k}(\zeta_{k})-\nabla F^{\star}_{k}(\zeta_{k}^{*})\right)\dot{\zeta}_{k}. (18)

If πkπkαρμk\pi_{k}-\pi_{k}^{*}\leq-\frac{\alpha}{\rho}\mu_{k}, then ζk=Fk(πk)\zeta_{k}=\nabla F_{k}(\pi_{k}) holds and hence

U˙k\displaystyle\dot{U}_{k} =ρ(πkπk)2Fk(πk)π˙k\displaystyle=\rho(\pi_{k}-\pi_{k}^{*})\nabla^{2}F_{k}(\pi_{k})\dot{\pi}_{k}
=ρ(πkπk)yk.\displaystyle=\rho(\pi_{k}-\pi_{k}^{*})y_{k}. (19)

Under πkπkαρμk\pi_{k}-\pi_{k}^{*}\leq-\frac{\alpha}{\rho}\mu_{k}, T˙k=ρ(πkπk)+κπ˙k\dot{T}_{k}=\rho\left(\pi_{k}-\pi_{k}^{*}\right)+\kappa\dot{\pi}_{k} holds. Thus, we have

U˙k\displaystyle\dot{U}_{k} =T˙kykκπ˙kyk\displaystyle=\dot{T}_{k}y_{k}-\kappa\dot{\pi}_{k}y_{k}
=T˙kykκwk(πk)π˙k2\displaystyle=\dot{T}_{k}y_{k}-\kappa w_{k}(\pi_{k})\dot{\pi}_{k}^{2}
T˙kykκ2wk(πk)π˙k2.\displaystyle\leq\dot{T}_{k}y_{k}-\frac{\kappa}{2}w_{k}(\pi_{k})\dot{\pi}_{k}^{2}. (20)

If πkπk>αρμk\pi_{k}-\pi_{k}^{*}>-\frac{\alpha}{\rho}\mu_{k}, we obtain ζk=Fk(πkαρμk)\zeta_{k}=\nabla F_{k}(\pi_{k}^{*}-\frac{\alpha}{\rho}\mu_{k}) and μ˙k=αμk\dot{\mu}_{k}=-\alpha\mu_{k}. Then,

U˙k\displaystyle\dot{U}_{k} =ρ(πkαρμkπk)2Fk(πkαρμk)(αμ˙k)\displaystyle=\rho\left(\pi_{k}^{*}-\frac{\alpha}{\rho}\mu_{k}-\pi_{k}^{*}\right)\nabla^{2}F_{k}\left(\pi_{k}^{*}-\frac{\alpha}{\rho}\mu_{k}\right)(-\alpha\dot{\mu}_{k})
=α2wk(πkαρμk)μkμ˙k\displaystyle=\alpha^{2}w_{k}\left(\pi_{k}^{*}-\frac{\alpha}{\rho}\mu_{k}\right)\mu_{k}\dot{\mu}_{k}
=αwk(πkαρμk)μ˙k2\displaystyle=-\alpha w_{k}\left(\pi_{k}^{*}-\frac{\alpha}{\rho}\mu_{k}\right)\dot{\mu}_{k}^{2} (21)

holds. Since wkw_{k} is decreasing function, we obtain wk(πkαρμk)wk(πk)w_{k}(\pi_{k}^{*}-\frac{\alpha}{\rho}\mu_{k})\geq w_{k}(\pi_{k}). From this inequality and T˙=μ˙+κπ˙\dot{T}=\dot{\mu}+\kappa\dot{\pi}, we have

U˙k\displaystyle\dot{U}_{k} αwk(πk)μ˙k2\displaystyle\leq-\alpha w_{k}(\pi_{k})\dot{\mu}_{k}^{2}
=12κwk(πk)μ˙k2(α12κ)wk(πk)μ˙k2\displaystyle=-\frac{1}{2\kappa}w_{k}(\pi_{k})\dot{\mu}_{k}^{2}-\left(\alpha-\frac{1}{2\kappa}\right)w_{k}(\pi_{k})\dot{\mu}_{k}^{2}
12κwk(πk)(T˙kκπ˙k)2\displaystyle\leq-\frac{1}{2\kappa}w_{k}(\pi_{k})\left(\dot{T}_{k}-\kappa\dot{\pi}_{k}\right)^{2}
=T˙kwk(πk)π˙k12κwk(πk)T˙k2κ2wk(πk)π˙k2\displaystyle=\dot{T}_{k}w_{k}(\pi_{k})\dot{\pi}_{k}-\frac{1}{2\kappa}w_{k}(\pi_{k})\dot{T}_{k}^{2}-\frac{\kappa}{2}w_{k}(\pi_{k})\dot{\pi}_{k}^{2}
T˙kykκ2wk(πk)π˙k2.\displaystyle\leq\dot{T}_{k}y_{k}-\frac{\kappa}{2}w_{k}(\pi_{k})\dot{\pi}_{k}^{2}. (22)

Next, we consider the time when a mode switch occurs in (13a) for kk-th element. Since Uk(μk,πk)U_{k}(\mu_{k},\pi_{k}) is not differentiable at (μk,πk)(\mu_{k},\pi_{k}) satisfying πkπk=αμk\pi_{k}-\pi_{k}^{*}=-\alpha\mu_{k}, we now take in the upper Dini derivative, denoted by D+UkD^{+}U_{k}. From the results in (20) and (22), we can confirm that

D+UkT˙kykκ2wk(πk)π˙k2\displaystyle D^{+}U_{k}\leq\dot{T}_{k}y_{k}-\frac{\kappa}{2}w_{k}(\pi_{k})\dot{\pi}_{k}^{2}

holds for all time t0t\geq 0. Therefore, we obtain

D+U\displaystyle D^{+}U T˙yκ2π˙W(π)π˙\displaystyle\leq\dot{T}^{\top}y-\frac{\kappa}{2}\dot{\pi}^{\top}W(\pi)\dot{\pi}
=T˙yκ2y(W(π))1y\displaystyle=\dot{T}^{\top}y-\frac{\kappa}{2}y^{\top}\left(W(\pi)\right)^{-1}y
T˙yκ2wHy2.\displaystyle\leq\dot{T}^{\top}y-\frac{\kappa}{2w^{H}}\|y\|^{2}. (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 δ\delta-input-strict-passivity and the existence of TmaxT_{\max}. 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 π(t)int(𝒮)\pi(t)\in\textrm{int}(\mathcal{S}) achieves T(t)\|T(t)\|\to\infty when tt\to\infty. For this specific signal π(t)\pi(t), S(W(π)T,π)S(W(\pi)T,\pi)\to\infty holds for any πint(𝒮)\pi^{*}\in\textrm{int}(\mathcal{S}).

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 U(μ,π)U(\mu,\pi). 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.

Consider the feedback system composed of (1), (5) and (13) under Assumption 2. When κ>2vHTmaxwL\kappa>\frac{2v^{H}T_{\max}}{w^{L}} holds, the population state π\pi achieves limtπ(t)=π\lim_{t\to\infty}\pi(t)=\pi^{*}.

Proof 4.15.

Define the function V2:=S(W(π)T,π)+U(μ,π)V_{2}:=S(W(\pi)T,\pi)+U(\mu,\pi). From Lemma 3.2 and Lemma 4.10, the upper Dini derivative of V2V_{2} satisfies

D+V2\displaystyle D^{+}V_{2} T˙y+π˙Φ(T,π)π˙+T˙yκ2π˙W(π)π˙\displaystyle\leq-\dot{T}^{\top}y+\dot{\pi}^{\top}\Phi(T,\pi)\dot{\pi}+\dot{T}^{\top}y-\frac{\kappa}{2}\dot{\pi}^{\top}W(\pi)\dot{\pi}
=π˙(Φ(T,π)κ2W(π))π˙.\displaystyle=\dot{\pi}^{\top}\left(\Phi(T,\pi)-\frac{\kappa}{2}W(\pi)\right)\dot{\pi}. (24)

Under κ>2vHTmaxwL\kappa>\frac{2v^{H}T_{\max}}{w^{L}}, Φ(T,π)κ2W(π)0\Phi(T,\pi)-\frac{\kappa}{2}W(\pi)\prec 0 is satisfied and hence D+V20D^{+}V_{2}\leq 0 holds. Denote the initial values of SS and UU by S0S_{0} and U0U_{0}, respectively. Then, V2S0+U0<V_{2}\leq S_{0}+U_{0}<\infty holds for all time. This implies TT\in\mathcal{L}_{\infty} and μ\mu\in\mathcal{L}_{\infty} from Lemma 4.12 and πint(𝒮)\pi\in\textrm{int}(\mathcal{S}). Accordingly, the invariance principle for non-smooth function [40] is applicable, and trajectories generated by (1), (5) and (13) for any initial conditions T(0)nT(0)\in\mathbb{R}^{n} and π(0)int(𝒮)\pi(0)\in\textrm{int}(\mathcal{S}) converge to the largest invariant set satisfying D+V2=0D^{+}{V}_{2}=0.

Let us now suppose the situation under D+V20D^{+}V_{2}\equiv 0. From (24), D+V20D^{+}V_{2}\equiv 0 yields π˙0\dot{\pi}\equiv 0 and hence π\pi must be constant. If πk<πk\pi_{k}<\pi^{*}_{k}, then kk-th element of (13a) follows μ˙kρ(πkπk)<0\dot{\mu}_{k}\equiv\rho(\pi_{k}-\pi_{k}^{*})<0, which contradicts the boundedness of μ\mu. Thus, ππ\pi\geq\pi^{*} is identically satisfied. If πk>πk\pi_{k}>\pi^{*}_{k} holds for some k𝒜k\in\mathcal{A}, l𝒜(πlπl)πkπk>0\sum_{l\in\mathcal{A}}(\pi_{l}-\pi_{l}^{*})\geq\pi_{k}-\pi_{k}^{*}>0 must hold. However, this contradicts the fact 1n(ππ)0\textbf{1}_{n}^{\top}(\pi-\pi^{*})\equiv 0 given by πint(𝒮)\pi\in\textrm{int}(\mathcal{S}) and πint(𝒮)\pi^{*}\in\textrm{int}(\mathcal{S}). Therefore, ππ\pi\equiv\pi^{*} is satisfied when D+V20D^{+}V_{2}\equiv 0 holds.

In summary, the invariance principle for non-smooth function [40] proves that π\pi asymptotically converges to π\pi^{*}.

Thanks to the upper bound condition Tk(t)Tmaxk𝒜,t0T_{k}(t)\leq T_{\max}\ \forall k\in\mathcal{A},\forall t\geq 0 ensured by (13), the stability and convergence of the feedback system in Fig. 6 can be exactly guaranteed under the gain condition κ>2vHTmaxwL\kappa>\frac{2v^{H}T_{\max}}{w^{L}}. Similar to Theorem 4.8, the result in Theorem 4.14 suggests the tendency that large gain κ\kappa 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 Q(τ)Q(\tau) is observable. This assumption is different from the one dealt with in this paper. Whereas, the information Q(τ)Q(\tau) is not easy to get from the decision makers since it is implicit variable. Although Q(τ)Q(\tau) might be estimated by using π\pi and π˙\dot{\pi}, there is another difficulty of identifying η\eta. Thus, we suppose the observation of population state π\pi, 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 η\eta 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 κ\kappa independently of the update rate η\eta, 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 δ\delta-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.

\appendices

6 Radial Unboundedness of Storage Function

The storage function S(τ,π)S(\tau,\pi), defined in (3), satisfies the following lemma.

Lemma 6.18.

Define τH:=max{τ1,τ2,,τn}\tau^{H}:=\max\{\tau_{1},\tau_{2},\dots,\tau_{n}\} and τL:=min{τ1,τ2,,τn}\tau^{L}:=\min\{\tau_{1},\tau_{2},\dots,\tau_{n}\}. Under πint(𝒮)\pi\in\rm{int}(\mathcal{S}), then

τHτLS(τ,π)\displaystyle\tau^{H}-\tau^{L}\to\infty\ \Rightarrow\ S(\tau,\pi)\to\infty

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 ω\omega. Remarking that l𝒜ωllogωl\sum_{l\in\mathcal{A}}\omega_{l}\log{\omega_{l}} works as a barrier function to the inequality constraints, ωn\omega^{*}\in\mathbb{R}^{n} is an optimal solution if and only if there exists λ\lambda^{*}\in\mathbb{R} satisfying the following conditions:

τk+1β(1+logωk)+λ=0k𝒜,\displaystyle\tau_{k}+\frac{1}{\beta}\left(1+\log\omega_{k}^{*}\right)+\lambda^{*}=0\ \ \forall k\in\mathcal{A}, (25a)
𝟏nω=1.\displaystyle{\bf 1}_{n}^{\top}\omega^{*}=1. (25b)

From (25a), we obtain logωk=βτkβλ1\log\omega_{k}^{*}=-\beta\tau_{k}-\beta\lambda^{*}-1 and hence

ωk=exp(βτkβλ1).\displaystyle\omega_{k}^{*}=\textrm{exp}\left(-\beta\tau_{k}-\beta\lambda^{*}-1\right). (26)

Applying (25b) to (26), we have

exp(βλ1)l𝒜exp(βτl)=1,\displaystyle\textrm{exp}\left(-\beta\lambda^{*}-1\right)\sum_{l\in\mathcal{A}}\textrm{exp}\left(-\beta\tau_{l}\right)=1,
\displaystyle\therefore\ λ=1β(1+log(l𝒜exp(βτl))).\displaystyle\lambda^{*}=\frac{1}{\beta}\left(-1+\log\left(\sum_{l\in\mathcal{A}}\textrm{exp}\left(-\beta\tau_{l}\right)\right)\right). (27)

Hence, we can calculate the second term in the right hand side of (3) as

minω𝒮(ωτ+1βl𝒜ωllogωl)\displaystyle\min_{\omega\in\mathcal{S}}\left(\omega^{\top}\tau+\frac{1}{\beta}\sum_{l\in\mathcal{A}}\omega_{l}\log{\omega_{l}}\right)
=(ω)τ+1βl𝒜ωllogωl\displaystyle\ \ \ \ =(\omega^{*})^{\top}\tau+\frac{1}{\beta}\sum_{l\in\mathcal{A}}\omega^{*}_{l}\log{\omega^{*}_{l}}
=l𝒜ωl(τl+1β(βτlβλ1))\displaystyle\ \ \ \ =\sum_{l\in\mathcal{A}}\omega^{*}_{l}\left(\tau_{l}+\frac{1}{\beta}\left(-\beta\tau_{l}-\beta\lambda^{*}-1\right)\right)
=l𝒜ωl(λ1β)=1βlog(l𝒜exp(βτl)).\displaystyle\ \ \ \ =\sum_{l\in\mathcal{A}}\omega^{*}_{l}\left(-\lambda^{*}-\frac{1}{\beta}\right)=-\frac{1}{\beta}\log\left(\sum_{l\in\mathcal{A}}\textrm{exp}\left(-\beta\tau_{l}\right)\right).

Thus, the storage function S(τ,π)S(\tau,\pi) is given as

S(τ,π)=\displaystyle S(\tau,\pi)=\ ηπτ+ηβl𝒜πllogπl+ηβlog(l𝒜exp(βτl)).\displaystyle\eta\pi^{\top}\tau+\frac{\eta}{\beta}\sum_{l\in\mathcal{A}}\pi_{l}\log{\pi_{l}}+\frac{\eta}{\beta}\log\left(\sum_{l\in\mathcal{A}}\exp(-\beta\tau_{l})\right).

Let us next focus on the terms depending on τ\tau. Due to the property of the Log-Sum-Exp function [39],

1βlog(l𝒜exp(βτl))τL\displaystyle\frac{1}{\beta}\log\left(\sum_{l\in\mathcal{A}}\exp(-\beta\tau_{l})\right)\geq-\tau^{L}

is satisfied. Noticing that 1nπ=1\textbf{1}_{n}^{\top}\pi=1 holds and there exists ε>0\varepsilon>0 such that πk>εk𝒜\pi_{k}>\varepsilon\ \forall k\in\mathcal{A}, we obtain

πτ+1βlog(l𝒜exp(βτl))\displaystyle\pi^{\top}\tau+\frac{1}{\beta}\log\left(\sum_{l\in\mathcal{A}}\exp(-\beta\tau_{l})\right) πττL\displaystyle\geq\pi^{\top}\tau-\tau^{L}
=l𝒜πl(τlτL)\displaystyle=\sum_{l\in\mathcal{A}}\pi_{l}(\tau_{l}-\tau^{L})
ε(τHτL).\displaystyle\geq\varepsilon(\tau^{H}-\tau^{L}). (28)

We now consider the case that (τHτL)(\tau^{H}-\tau^{L})\to\infty happens. Then, ηπτ+ηβlog(l𝒜exp(βτl))\eta\pi^{\top}\tau+\frac{\eta}{\beta}\log\left(\sum_{l\in\mathcal{A}}\exp(-\beta\tau_{l})\right) goes to infinity due to (28). Therefore, since l𝒜πllogπl\sum_{l\in\mathcal{A}}\pi_{l}\log{\pi_{l}} is finite, S(τ,π)S(\tau,\pi)\to\infty holds. This completes the proof.

7 Proof of Lemmas

7.1 Proof of Lemma 4.6

Due to 1nπ=1\textbf{1}_{n}^{\top}\pi=1 and 1nπ=1\textbf{1}_{n}^{\top}\pi^{*}=1, the signal μ˙\dot{\mu} of (10a) satisfies 1nμ˙0\textbf{1}_{n}^{\top}\dot{\mu}\equiv 0. Hence, the system (10) satisfies 1nT(t)1nμ(t)1nμ(0)\textbf{1}_{n}^{\top}T(t)\equiv\textbf{1}_{n}^{\top}\mu(t)\equiv\textbf{1}_{n}^{\top}\mu(0). Define

TH(t)\displaystyle T^{H}(t) :=max{T1(t),T2(t),,Tn(t)},\displaystyle:=\max\{T_{1}(t),T_{2}(t),\dots,T_{n}(t)\},
TL(t)\displaystyle T^{L}(t) :=min{T1(t),T2(t),,Tn(t)}.\displaystyle:=\min\{T_{1}(t),T_{2}(t),\dots,T_{n}(t)\}.

When T(t)\|T(t)\|\to\infty happens, TH(t)T^{H}(t)\to\infty and TL(t)T^{L}(t)\to-\infty hold due to the constraint 1nT(t)1nμ(0)\textbf{1}_{n}^{\top}T(t)\equiv\textbf{1}_{n}^{\top}\mu(0). Then, (TH(t)TL(t)+bLbH)(T^{H}(t)-T^{L}(t)+b^{L}-b^{H})\to\infty is also satisfied. Let us consider τH\tau^{H} and τL\tau^{L} defined in Lemma 6.18 under (4). Due to τHTH+bL\tau^{H}\geq T^{H}+b^{L} and τLTL+bH\tau^{L}\leq T^{L}+b^{H}, we have τHτLTHTL+bLbH\tau^{H}-\tau^{L}\geq T^{H}-T^{L}+b^{L}-b^{H}. Thus, (τHτL)(\tau^{H}-\tau^{L})\to\infty holds when T(t)\|T(t)\|\to\infty happens. From the above discussion and Lemma 6.18, when the system (10) achieves T(t)\|T(t)\|\to\infty under π(t)int(𝒮)\pi(t)\in\textrm{int}(\mathcal{S}), S(T+B(π),π)S(T+B(\pi),\pi)\to\infty 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 T(t)T(t) generated by (13). For any constant πint(𝒮)\pi^{*}\in\textrm{int}(\mathcal{S}) and for any signal π(t)int(𝒮)\pi(t)\in\textrm{int}(\mathcal{S}), the signal TH(t):=max{T1(t),T2(t),,Tn(t)}T^{H}(t):=\max\{T_{1}(t),T_{2}(t),\dots,T_{n}(t)\} is bounded.

Proof 7.21.

Let us suppose the case that the system (13a) satisfies μk\|\mu_{k}\|\to\infty for all k𝒜k\in\mathcal{A}. Since (13a) guarantees μk0\mu_{k}\leq 0, μk\mu_{k}\to-\infty must hold for all k𝒜k\in\mathcal{A}. Then, there exists a time t^>0\hat{t}>0 such that αρμk>πkπkk𝒜-\frac{\alpha}{\rho}\mu_{k}>\pi_{k}-\pi_{k}^{*}\ \forall k\in\mathcal{A} holds for any time tt^t\geq\hat{t}. In other words, (13a) follows μ˙=ρ(ππ)\dot{\mu}=\rho(\pi-\pi^{*}) for any tt^t\geq\hat{t}. This yields 1nμ˙=0\textbf{1}_{n}^{\top}\dot{\mu}=0 and hence l𝒜μl(t)\sum_{l\in\mathcal{A}}\mu_{l}(t) must be constant for any time tt^t\geq\hat{t}. This contradicts the assumption satisfying μkk𝒜\mu_{k}\to-\infty\ \forall k\in\mathcal{A}.

Therefore, the system (13a) guarantees at least <max{μ1(t),μ2(t),,μn(t)}-\infty<\max\{\mu_{1}(t),\mu_{2}(t),\dots,\mu_{n}(t)\}. As a result, TH(t)T^{H}(t) is bounded since max{μ1(t),μ2(t),,μn(t)}+T¯κ<TH(t)<T¯+κ\max\{\mu_{1}(t),\mu_{2}(t),\dots,\mu_{n}(t)\}+\bar{T}-\kappa<T^{H}(t)<\bar{T}+\kappa holds under (13b).

We now prove Lemma 4.12. Let us introduce the signals TH(t)T^{H}(t) and TL(t)T^{L}(t), defined in Appendix 7.1. If (13) achieves T(t)\|T(t)\|\to\infty, then TL(t)T^{L}(t)\to-\infty must hold. This yields (TH(t)TL(t))(T^{H}(t)-T^{L}(t))\to\infty from Lemma 7.20. Then, (wHTH(t)wLTL(t))(w^{H}T^{H}(t)-w^{L}T^{L}(t))\to\infty is also satisfied. Let us consider τH\tau^{H} and τL\tau^{L} defined in Lemma 6.18 under (5). Due to τHτLwHTHwLTL\tau^{H}-\tau^{L}\geq w^{H}T^{H}-w^{L}T^{L}, (τHτL)(\tau^{H}-\tau^{L})\to\infty holds when T(t)\|T(t)\|\to\infty happens. Accordingly, Lemma 6.18 proves Lemma 4.12.

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.