Congestion Games with Agent Failures

Reshef Meir, Moshe Tennenholtz, Yoram Bachrach, Peter Key

Research output: Contribution to conferencePaperpeer-review

Abstract

We propose a natural model for agent failures in congestion games. In our model, each of the agents may fail to participate in the game, introducing uncertainty regarding the set of active agents. We examine how such uncertainty may change the Nash equilibria (NE) of the game. We prove that although the perturbed game induced by the failure model is not always a congestion game, it still admits at least one pure Nash equilibrium. Then, we turn to examine the effect of failures on the maximal social cost in any NE of the perturbed game. We show that in the limit case where failure probability is negligible new equilibria never emerge, and that the social cost may decrease but it never increases. For the case of non-negligible failure probabilities, we provide a full characterization of the maximal impact of failures on the social cost under worst-case equilibrium outcomes.

Original languageEnglish
Pages1401-1407
Number of pages7
StatePublished - 2012
Externally publishedYes
Event26th AAAI Conference on Artificial Intelligence, AAAI 2012 - Toronto, Canada
Duration: 22 Jul 201226 Jul 2012

Conference

Conference26th AAAI Conference on Artificial Intelligence, AAAI 2012
Country/TerritoryCanada
CityToronto
Period22/07/1226/07/12

All Science Journal Classification (ASJC) codes

  • Artificial Intelligence

Fingerprint

Dive into the research topics of 'Congestion Games with Agent Failures'. Together they form a unique fingerprint.

Cite this