Congestion Games with Failures - CGFs
Penn, Michal, Polukarov, Maria and Tennenholtz, Moshe (2005) Congestion Games with Failures - CGFs. In, EC-05 , 259-268.
- Published Version
We introduce a new class of games---congestion games with failures (CGFs), which extends the class of congestion games to allow for facility failures. In a basic CGF (BCGF) agents share a common set of facilities (service providers), where each service provider (SP) may fail with some known probability. For reliability reasons, an agent may choose a subset of the SPs in order to try and perform his task. The cost of an agent for utilizing any SP is a function of the total number of agents using this SP. A main feature of this setting is that the cost for an agent for successful completion of his task is the minimum of the costs of his successful attempts. We show that although BCGFs do not admit a potential function, and thus are not isomorphic to classic congestion games, they always possess a pure-strategy Nash equilibrium. We also show that the SPs' congestion experienced in different Nash equilibria is (almost) unique. For the subclass of symmetric BCGFs we give a characterization of best and worst Nash equilibria. We extend the basic model by making task submission costly and define a model for taxed CGFs (TCGFs). We prove the existence of a pure-strategy Nash equilibrium for quasi-symmetric TCGFs, and present an efficient algorithm for constructing such Nash equilibrium in symmetric TCGFs.
|Item Type:||Conference or Workshop Item (Paper)|
|Divisions:||Faculty of Physical and Applied Science > Electronics and Computer Science > Agents, Interactions & Complexity
|Date Deposited:||16 Sep 2009 19:28|
|Last Modified:||02 Mar 2012 11:59|
|Contributors:||Penn, Michal (Author)
Polukarov, Maria (Author)
Tennenholtz, Moshe (Author)
|Further Information:||Google Scholar|
|RDF:||RDF+N-Triples, RDF+N3, RDF+XML, Browse.|
Actions (login required)