# An Ordinal Minimax Theorem

arXiv: https://arxiv.org/abs/1412.4198 · HTML: https://mlsanity.com/paper/1412.4198/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 13 Dec 2014.

## Built on by (most cited first, 1 of 1)

- [Robust Entropy-regularized Markov Decision Processes](https://mlsanity.com/paper/2112.15364/) (2021)

## Abstract (arXiv)

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.