Abstract
This paper starts epistemic approaches of studying the Bayesian routing problem in the frame work of the network game introduced by Koutsoupias and Papadimitriou [LNCS 1563, pp.404–413. Springer (1999)]. It highlights the role of common-knowledge on the users’ individual conjectures on the others’ selections of channels in the network game. Especially two notions of equilibria are presented in the Bayesian extension of the network game; expected delay equilibrium and rational expectations equilibrium, such as each user minimizes own expectations of delay and social cost respectively. 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 and the latter equilibrium yields a Nash equilibrium for social cost in the network game.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
Mazalov [9], Chap. 9 pp.314–351.
- 2.
Example 9.6 in Mazalov [9] p. 324.
- 3.
Where \([\mathbf{l}_i = l]\) is defined by \([\mathbf{l}_i = l] = \{ \omega \in \varOmega \vert \mathbf{l}_i(\omega ) = l \}\). The last postulate BP means that ‘user i knows absolutely his/her selection of channel l.
- 4.
This is called the event-based approach in Fagin et al. [4].
- 5.
According to these properties we can say the structure \(\langle \varOmega , (K_{i})_{i \in N}\rangle \) is a model for the multi-modal logic S5n.
References
Aumann, R.J.: Agreeing to disagree. Ann. Stat. 4, 1236–1239 (1976)
Aumann, R.J.: Subjectivity and correlation in randomized strategies. J. Math. Econ. 1, 67–96 (1974)
Aumann, R.J., Brandenburger, A.: Epistemic conditions for mixed strategy Nash equilibrium. Econometrica 42, 1161–1180 (1995)
Fagin, R., Halpern, J.Y., Moses, Y., Vardi, M.Y.: Reasoning About Knowledge. MIT Press, Cambridge (1995)
Garing, M., Monien, B., Tiemann, K.: Selfish routing with incomplete information. Theor. Compt. Syst. 42, 91–130 (2008)
Harsanyi, J.C.: Games with incomplete information played by Bayesian players, I, II, III. Manag. Sci. 14, 159–182, 320–332, 468–502 (1967)
Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol. 1563, p. 404. Springer, Heidelberg (1999)
Matsuhisa, T.: Selfish Routing with Common-knowledge. Working paper (2015)
Mazalov, V.: Mathematical Game Theory and Applications. Wiley (2014)
Nash, J.F.: Equilibrium points in \(n\)-person games. Proc. Natl. Acad. Sci. U. S. Am. 36, 48–49 (1950)
Parikh, R., Krasucki, P.: Communication, consensus, and knowledge. J. Econ. Theor. 52, 78–89 (1990)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Matsuhisa, T. (2016). Common-Knowledge and KP-Model. In: Nguyen, N.T., Trawiński, B., Fujita, H., Hong, TP. (eds) Intelligent Information and Database Systems. ACIIDS 2016. Lecture Notes in Computer Science(), vol 9621. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-49381-6_47
Download citation
DOI: https://doi.org/10.1007/978-3-662-49381-6_47
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-49380-9
Online ISBN: 978-3-662-49381-6
eBook Packages: Computer ScienceComputer Science (R0)