Hofbauer's converse conjecture for stable dynamics in bimatrix games
Statement
Let be a bimatrix game with a unique Nash equilibrium point in the interior of the strategy space . Suppose this equilibrium is stable under either the best-response (BR) dynamics or the fictitious-play (FP) dynamics. Hofbauer's converse conjecture. The game must be a zero-sum game, meaning that it is linearly equivalent to a game satisfying . This is the converse of the convergence theorem for zero-sum games: zero-sum games have orbits converging to the set of Nash equilibria, whereas it remains open whether the stated stability and uniqueness properties force a game to be zero-sum.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.