3 problems

Ostrovski's conjecture. Under these conditions, the Nash equilibrium does not Pareto dominate typical fictitious-play orbits. This conjecture gives a sufficient transition-combinat…

Consider bimatrix games with a unique, completely mixed Nash equilibrium and their typical fictitious-play orbits. Average-payoff dominance conjecture. For most such games, typical…

Consider the space of $n\times n$ bimatrix games with entries in $[0,1]$. Restrict attention to games with a unique, completely mixed Nash equilibrium and to typical fictitious-pla…