Direct proofs of generic finiteness of nash equilibrium outcomes
暂无分享,去创建一个
Using elementary techniques from semi-algebraic geometry, we give short proofs of two generic ̄niteness results for equilibria of ̄nite games. For each assignment of generic payo®s to a ̄xed normal form or to an extensive form with perfect recall, the Nash equilibria induce a ̄nite number of distributions over the possible outcomes.
[1] Robert Wilson,et al. Computing Equilibria of N-Person Games , 1971 .
[2] J. Rosenmüller. On a Generalization of the Lemke–Howson Algorithm to Noncooperative N-Person Games , 1971 .
[3] J. Harsanyi. Oddness of the number of equilibrium points: A new proof , 1973 .
[4] J. Mertens,et al. ON THE STRATEGIC STABILITY OF EQUILIBRIA , 1986 .
[5] Lawrence E. Blume,et al. The Algebraic Geometry of Perfect and Sequential Equilibrium , 1994 .