A three-person deterministic graphical game without Nash equilibria

Endre Boros, Vladimir Gurvich, Martin Milanič, Vladimir Oudalov, Jernej Vičič

Research output: Contribution to journalArticle

2 Scopus citations

Abstract

We give an example of a three-person deterministic graphical game that has no Nash equilibrium in pure stationary strategies. The game has seven positions, four outcomes (a unique cycle and three terminal positions), and its normal form is of size 2×2×4 only. Thus, the example strengthens significantly the one obtained in 2014 by Gurvich and Oudalov; the latter has four players, five terminals, and normal form of size 2×4×6×8. Furthermore, our example is minimal with respect to the number of players. Somewhat similar examples were known since 1975, but they were not related to deterministic graphical games. The small size of our example allows us to verify that it has no Nash equilibrium not only in pure but also in independently mixed (so-called behavioral) strategies. For independently mixed strategies two distinct effective payoffs can be considered: along with the classical Markovian evaluation, we also consider a priori evaluation, which may be a better fit for playing in behavioral strategies. We show that in both cases Nash equilibria may fail to exist.

Original languageEnglish (US)
Pages (from-to)21-38
Number of pages18
JournalDiscrete Applied Mathematics
Volume243
DOIs
StatePublished - Jul 10 2018

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Keywords

  • Deterministic graphical multi-person game
  • Directed cycle
  • Nash equilibrium
  • Perfect information
  • Pure stationary strategy
  • Terminal position

Cite this