Congestion games with load-dependent failures: identical resources

Penn, Michal, Polukarov, Maria and Tennenholtz, Moshe (2009) Congestion games with load-dependent failures: identical resources. [in special issue: Special Section of Games and Economic Behavior Dedicated to the 8th ACM Conference on Electronic Commerce] Games and Economic Behavior, 67, (1), 156-173. (doi:10.1016/j.geb.2009.03.004).


[img] PDF - Accepted Manuscript
Download (308Kb)


We define a new class of games---congestion games with load-dependent failures (CGLFs). In a CGLF each player can choose a subset of a set of available resources in order to try and perform his task. We assume that the resources are identical but that players' benefits from successful completion of their tasks may differ. Each resource is associated with a cost of use and failure probability which are load-dependent. Although CGLFs in general do not have a pure strategy Nash equilibrium, we prove the existence of a pure strategy Nash equilibrium in every CGLF with nondecreasing cost functions. Moreover, we present a polynomial time algorithm for computing such an equilibrium.

Item Type: Article
Digital Object Identifier (DOI): doi:10.1016/j.geb.2009.03.004
ISSNs: 0899-8256 (print)
1090-2473 (electronic)
Keywords: congestion games, load-dependent resource failures, pure strategy nash equilibrium, algorithms
Subjects: H Social Sciences > HB Economic Theory
Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions : Faculty of Physical Sciences and Engineering > Electronics and Computer Science > Agents, Interactions & Complexity
ePrint ID: 267882
Accepted Date and Publication Date:
September 2009Published
Date Deposited: 16 Sep 2009 19:59
Last Modified: 31 Mar 2016 14:15
Further Information:Google Scholar

Actions (login required)

View Item View Item

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics