The Minmax Theorem for U.S.C.-L.S.C. payoff functions
From MaRDI portal
Publication:1087479
DOI10.1007/BF01769388zbMath0611.90105MaRDI QIDQ1087479
Publication date: 1986
Published in: International Journal of Game Theory (Search for Journal in Brave)
Related Items (5)
Equilibrium existence for zero-sum games and spatial models of elections ⋮ SIMPLE EQUILIBRIA IN SEMI-INFINITE GAMES ⋮ On repeated games without a recursive structure: Existence of \(\lim v_ n\) ⋮ Weak stackelberg problem and mixed solutions under data perturbations11this paper is based upon a communication presented at the 14th symposium on mathematical programming with data perturbation, Washington D.C. 1992. This research has been supported by M.U.R.S.T Roma, Italia.$ef: ⋮ Distributive politics and electoral competition
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On general minimax theorems
- Solution for a class of repeated games without a recursive structure
- Note on zero sum two person games
- On von Neumann's minimax theorem
- Generalization of a theorem by v. Neumann concerning zero sum two person games
- Contributions to the Theory of Games (AM-39), Volume III
- Minimax Theorems on Conditionally Compact Sets
- Advances in Game Theory. (AM-52)
- Criteres de Compacite dans les Espaces Fonctionnels Generaux
- Sur Les Applications Lineaires Faiblement Compactes D'Espaces Du Type C(K)
This page was built for publication: The Minmax Theorem for U.S.C.-L.S.C. payoff functions