Fault tolerance in large games

Ronen Gradwohl, Omer Reingold

Research output: Contribution to journalArticlepeer-review

17 Scopus citations


A Nash equilibrium is an optimal strategy for each player under the assumption that others play according to their respective Nash strategies, but it provides no guarantees in the presence of irrational players or coalitions of colluding players. In fact, no such guarantees exist in general. However, in this paper we show that large games are innately fault tolerant. We quantify the ways in which two subclasses of large games - λ-continuous games and anonymous games - are resilient against Byzantine faults (i.e. irrational behavior), coalitions, and asynchronous play. We also show that general large games have some non-trivial resilience against faults.

Original languageEnglish
Pages (from-to)438-457
Number of pages20
JournalGames and Economic Behavior
StatePublished - Jul 2014
Externally publishedYes


  • Fault tolerance
  • Large games
  • Nash equilibrium


Dive into the research topics of 'Fault tolerance in large games'. Together they form a unique fingerprint.

Cite this