Congestion Games with Failures
We introduce a new class of games, {\it congestion games with failures} (CGFs), which allows for resource failures in congestion games. In a CGF, players share a common set of resources (service providers), where each service provider (SP) may fail with some known probability (that may be constant o...
Main Authors: | Penn, Michal (Author), Polukarov, Maria (Author), Tennenholtz, Moshe (Author) |
---|---|
Format: | Article |
Language: | English |
Published: |
2011.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Taxed Congestion Games with Failures
by: Penn, Michal, et al.
Published: (2009) -
Congestion games with load-dependent failures: identical resources
by: Penn, Michal, et al.
Published: (2009) -
Random order congestion games
by: Penn, Michal, et al.
Published: (2009) -
The Minmax Multidimensional Knapsack Problem with Application to a Chance-Constrained Problem
by: Kress, Moshe, et al.
Published: (2007) -
Dynamics in congestion games
by: Shah, Devavrat, et al.
Published: (2011)