論文

査読有り
2018年

Common-Knowledge and Bayesian Equilibrium in Network Game

MATHEMATICA APPLICANDA
  • 松久 隆

46
2
開始ページ
211
終了ページ
243
記述言語
英語
掲載種別
研究論文(学術雑誌)
DOI
10.14708/ma.v46i2.6346

In this paper we investigate equilibriums in the Bayesian routing problem of the network game introduced by Koutsoupias and Papadimitriou [LNCS 1563, pp.404-413. Springer (1999)]. <br />
We treat epistemic conditions for Nash equilibrium of social costs function in the network game. <br />
It highlights the role of common-knowledge on <br />
the users&#039; individual conjectures on the others&#039; selections of channels in the network game.<br />
Especially two notions of equilibria are presented in the Bayesian extension of the network game; expected delay equilibrium and rational expectations equilibrium. <br />
The former equilibrium is given such as each user minimizes own expectations of delay, and the latter is given as he/she maximizes own expectations of a social costs.<br />
We show that the equilibria have the properties: If all users commonly know them, then the former equilibrium yields a Nash equilibrium in the based KP-model <br />
and the latter equilibrium yields a Nash equilibrium for social costs in the network game.<br />
Further we introduce the extended notions of price of anarchy in the Bayesian network game for rational expectations equilibriums for social costs, named the expected price of anarchy and the common-knowledge price of anarchy.<br />
We will examine the relationship among the two extended price of anarchy and the classical notion of price of anarchy introduced by Koutsoupias and Papadimitriou.

リンク情報
DOI
https://doi.org/10.14708/ma.v46i2.6346
ID情報
  • DOI : 10.14708/ma.v46i2.6346

エクスポート
BibTeX RIS