An Ordinal Minimax Theorem
classification
💻 cs.GT
keywords
gameordinalweakzero-sumcalledconceptconsequenceearly
read the original abstract
In the early 1950s Lloyd Shapley proposed an ordinal and set-valued solution concept for zero-sum games called \emph{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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.