# Insights on the Theory of Robust Games

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

## Key facts

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

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

- [VISER: A Tractable Solution Concept for Games with Information Asymmetry](https://mlsanity.com/paper/2307.09652/) (2023)

## Abstract (arXiv)

A robust game is a distribution-free model to handle ambiguity generated by a bounded set of possible realizations of the values of players' payoff functions. The players are worst-case optimizers and a solution, called robust-optimization equilibrium, is guaranteed by standard regularity conditions. The paper investigates the sensitivity to the level of uncertainty of this equilibrium. Specifically, we prove that it is an epsilon-Nash equilibrium of the nominal counterpart game, where the epsilon-approximation measures the extra profit that a player would obtain by reducing his level of uncertainty. Moreover, given an epsilon-Nash equilibrium of a nominal game, we prove that it is always possible to introduce uncertainty such that the epsilon-Nash equilibrium is a robust-optimization equilibrium. An example shows that a robust Cournot duopoly model can admit multiple and asymmetric robust-optimization equilibria despite only a symmetric Nash equilibrium exists for the nominal counterpart game.