An ordinal minimax theorem
In the early 1950s Lloyd Shapley proposed an ordinal and set-valued solution concept for zero-sum games called weak saddle. We show that all weak saddles of a given zero-sum game are interchangeable and equivalent. As a consequence, every such game possesses a unique set-based value.
Main Authors: | Brandt, F, Brill, M, Suksompong, W |
---|---|
Format: | Journal article |
Language: | English |
Published: |
Elsevier
2016
|
Similar Items
-
A unifying minimax theorem
by: Werner Oettli, et al.
Published: (1998-05-01) -
Generalized hierarchical minimax theorems for set-valued mappings
by: Haijun Wang
Published: (2016-03-01) -
Coincidence Theorems, Generalized Variational Inequality Theorems, and Minimax Inequality Theorems for the Φ-Mapping on G-Convex Spaces
by: Chi-Ming Chen, et al.
Published: (2007-05-01) -
Ordinal analysis and the infinite Ramsey theorem
by: Afshari, B, et al.
Published: (2012) -
Introduction to minimax/
by: Demianov, V. F. (Vladimir Fedorovich), 1938-, et al.
Published: (1974)