Two-player zero-sum games have been subject to game theoretic analysis ever since von Neumann's minimax theorem. In the first part of this thesis, we give a new proof for the minimax theorem, study epistemic aspects of maximin play, and consider maximin strategies in random symmetric zero-sum games.
Symmetric zero-sum games appear in decision theory as representations of preferences over probabilistic outcomes. The second part illustrates that this preference model allows for appealing social choice functions.
«
Two-player zero-sum games have been subject to game theoretic analysis ever since von Neumann's minimax theorem. In the first part of this thesis, we give a new proof for the minimax theorem, study epistemic aspects of maximin play, and consider maximin strategies in random symmetric zero-sum games.
Symmetric zero-sum games appear in decision theory as representations of preferences over probabilistic outcomes. The second part illustrates that this preference model allows for appealing social...
»