Simple equilibria in semi-infinite games
From MaRDI portal
Publication:5325971
Recommendations
Cites work
- AN ALGORITHM FOR EQUILIBRIUM POINTS IN BIMATRIX GAMES
- Characterization of optimal strategies in matrix games with convexity properties
- On the Determinateness of m × ∞-Bimatrix Games
- On the determinateness of semi-infinite bimatrix games
- On the existence of almost-pure-strategy Nash equilibrium in \(n\)-person finite games
- Pure Nash equilibria in finite two-person non-zero-sum games
- Saddle point theorems
- The Minmax Theorem for U.S.C.-L.S.C. payoff functions
- Weak topology and infinite matrix games
- Zero-sum continuous games with no compact support
Cited in
(7)- Simple equilibria in finite games with convexity properties
- Semivalues of Political Economic Games
- A semi-potential for finite and infinite games in extensive form
- Convex semi-infinite games
- Inferior players in simple games
- Uniformly supported approximate equilibria in families of games
- scientific article; zbMATH DE number 3874998 (Why is no real title available?)
This page was built for publication: Simple equilibria in semi-infinite games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5325971)