Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
158 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

A three-person deterministic graphical game without Nash equilibria (1610.07701v2)

Published 25 Oct 2016 in cs.GT

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 x 2 x 4 only. Thus, our example strengthens significantly the one obtained in 2014 by Gurvich and Oudalov; the latter has four players, five terminals, and a 2 x 4 x 6 x 8 normal form. Furthermore, our example is minimal with respect to the number of players. Both examples are tight but not Nash-solvable. Such examples were known since 1975, but they were not related to deterministic graphical games. Moreover, due to the small size of our example, we can strengthen it further by showing that it has no Nash equilibrium not only in pure but also in independently mixed strategies, for both Markovian and a priori evaluations.

Citations (12)

Summary

We haven't generated a summary for this paper yet.