An Ordinal Minimax Theorem
Computer Science and Game Theory
2018-04-19 v5
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.
Cite
@article{arxiv.1412.4198,
title = {An Ordinal Minimax Theorem},
author = {Felix Brandt and Markus Brill and Warut Suksompong},
journal= {arXiv preprint arXiv:1412.4198},
year = {2018}
}
Comments
10 pages, 2 figures