An ordinal minimax theorem

DOI10.1016/j.geb.2015.12.010zbMath1347.91005DBLPjournals/geb/BrandtBS16arXiv1412.4198OpenAlexW1492624600WikidataQ56386909 ScholiaQ56386909MaRDI QIDQ5964692

Markus Brill, Warut Suksompong, Felix Brandt

Publication date: 1 March 2016

Published in: Games and Economic Behavior (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1412.4198

zbMATH Keywords

zero-sum gamesminimax theoremsaddlesShapley

Mathematics Subject Classification ID

2-person games (91A05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The computational complexity of weak saddles
• Covering sets and a new Condorcet choice correspondence
• Dominated strategies and common knowledge
• Non-cooperative stochastic dominance games
• Dutta's minimal covering set and Shapley's saddles
• Mixed refinements of Shapley's saddles and weak tournaments
• Essentials of Game Theory: A Concise Multidisciplinary Introduction

This page was built for publication: An ordinal minimax theorem