Nash Equilibria with Irradical Probabilities
By: Edan Orzech, Martin Rinard
Potential Business Impact:
Makes games have tricky, unguessable winning strategies.
We present for every $n\ge4$ an $n$-player game in normal form with payoffs in $\{0,1,2\}$ that has a unique, fully mixed, Nash equilibrium in which all the probability weights are irradical (i.e., algebraic but not closed form expressible even with $m$-th roots for any integer $m$).
Similar Papers
A vector bundle approach to Nash equilibria
CS and Game Theory
Finds all possible winning strategies in games.
Quadratic Programming Approach for Nash Equilibrium Computation in Multiplayer Imperfect-Information Games
CS and Game Theory
Finds best moves in complex games.
A choice-based axiomatization of Nash equilibrium
Theoretical Economics
Finds the best choices for players in games.