Semi-algebraic sets and equilibria of binary games
From MaRDI portal
Abstract: Any nonempty, compact, semi-algebraic set in [0, 1] n is the projection of the set of mixed equilibria of a finite game with 2 actions per player on its first n coordinates. A similar result follows for sets of equilibrium payoffs. The proofs are constructive and elementary.
Recommendations
- Set-theoretic equivalence of extensive-form games
- Existence of equilibria in countable games: an algebraic approach
- The basic algebra of game equivalences
- Semivalues of Simple Games
- On the set of proper equilibria of a bimatrix game
- Algebraic structure of games
- Ehrenfeucht-Fraïssé games in finite set theory
- On the determinateness of semi-infinite bimatrix games
- The Semi-Algebraic Theory of Stochastic Games
- Convex games and stable sets
Cites work
Cited in
(8)- Absorbing games with irrational values
- Projections and functions of Nash equilibria
- Slicing the Nash equilibrium manifold
- Universality of Nash Equilibria
- Hard and soft preparation sets in Boolean games
- Characterizing the value functions of polynomial games
- Uniformly supported approximate equilibria in families of games
- On the topology of the set of Nash equilibria
This page was built for publication: Semi-algebraic sets and equilibria of binary games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1785457)