Ostrovski's transition-combinatorics conjecture for fictitious play
Statement
Let a bimatrix game have a unique, completely mixed Nash equilibrium, and let and denote the players' best-response correspondences. Assume the game has the stated transition combinatorics; in particular, suppose
Ostrovski's conjecture. Under these conditions, the Nash equilibrium does not Pareto dominate typical fictitious-play orbits. This conjecture gives a sufficient transition-combinatorial condition under which equilibrium is not expected to dominate typical fictitious-play behavior in payoff terms. The supplied text gives no resolution.
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.