Rational Behaviour and Strategy Construction in Infinite Multiplayer Games
We study infinite games played by arbitrarily many players on a directed graph. Equilibrium states capture rational behaviour in these games. Instead of the well-known notion of a Nash equilibrium, we focus on the notion of a subgame perfect equilibrium. We argue that the latter one is more appropriate for the kind of games we study, and we show the existence of a subgame perfect equilibrium in any infinite game with ω-regular winning conditions.
As, in general, equilibria are not unique, it is appealing to compute one with a maximal payoff. This problem corresponds naturally to the problem of deciding given a game and two payoff vectors whether the game has an equilibrium with a payoff in between the given thresholds. We show that this problem is decidable for games with ω-regular winning conditions played on a finite graph and analyse its complexity. Moreover, we establish that any subgame perfect equilibrium of a game with ω-regular winning conditions played on a finite graph can be implemented by finite-state strategies.
Finally, we consider logical definability. We state that if we fix the number of players together with an ω-regular winning condition for each of them and two payoff vectors the property that a game has a subgame perfect equilibrium with a payoff in between the given thresholds is definable in the modal μ-calculus.
KeywordsNash Equilibrium Rational Behaviour Subgame Perfect Equilibrium Winning Strategy Kripke Structure
Unable to display preview. Download preview PDF.
- 4.Emerson, E.A., Jutla, C.S., Sistla, A.P.: On model-checking for fragments of μ-calculus. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol. 697, pp. 385–396. Springer, Heidelberg (1993)Google Scholar
- 5.Gale, D., Stewart, F.M.: Infinite games with perfect information. In: Contributions to the Theory of Games II. Annals of Mathematical Studies, vol. 28, pp. 245–266. Princeton University Press, Princeton (1953)Google Scholar
- 7.Kuhn, H.W.: Extensive Games and the Problem of Information. In: Contributions to the Theory of Games II. Annals of Mathematical Studies, vol. 28, pp. 193–216. Princeton University Press, Princeton (1953)Google Scholar
- 10.Mostowski, A.W.: Games with forbidden positions. Technical Report 78, Instytut Matematyki, Uniwersytet Gdański, Poland (1991)Google Scholar
- 15.Rabin, M.O.: Automata on infinite objects and Church’s problem. American Mathematical Society (1972)Google Scholar
- 16.Selten, R.: Spieltheoretische Behandlung eines Oligopolmodells mit Nachfrageträgheit. Zeitschrift für die gesamte Staatswissenschaft 121, 301–324, 667–689 (1965)Google Scholar
- 17.Thomas, W.: On the synthesis of strategies in infinite games. In: Mayr, E.W., Puech, C. (eds.) STACS 1995. LNCS, vol. 900, pp. 1–13. Springer, Heidelberg (1995)Google Scholar
- 18.Ummels, M.: Rational behaviour and strategy construction in infinite multiplayer games. Master’s thesis, RWTH Aachen, Germany (2005)Google Scholar