Abstract
We study a model of selfish resource allocation that seeks to incorporate dependencies among resources as they exist in modern networked environments. Our model is inspired by utility functions with constant elasticity of substitution (CES) which is a well-studied model in economics. We consider congestion games with different aggregation functions. In particular, we study Lp norms and analyze the existence and complexity of (approximate) pure Nash equilibria. Additionally, we give an almost tight characterization based on monotonicity properties to describe the set of aggregation functions that guarantee the existence of pure Nash equilibria.
Original language | English |
---|---|
Title of host publication | Algorithms and Complexity |
Subtitle of host publication | 10th International Conference, CIAC 2017, Athens, Greece, May 24-26, 2017, Proceedings |
Editors | Dimitris Fotakis, Aris Pagourtzis |
Publisher | Springer |
Pages | 222-233 |
ISBN (Electronic) | 978-3-319-57586-5 |
ISBN (Print) | 978-3-319-57585-8 |
DOIs | |
Publication status | Published - 2017 |
Externally published | Yes |
Event | 10th International Conference on Algorithms and Complexity - Multimedia Amphitheater of the National Technical University of Athens, Athens, Greece Duration: 24 May 2017 → 26 May 2017 Conference number: 10 http://www.corelab.ntua.gr/ciac2017/ |
Publication series
Name | Lecture Notes in Computer Science |
---|---|
Publisher | Cham |
Volume | 10236 |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | 10th International Conference on Algorithms and Complexity |
---|---|
Abbreviated title | CIAC 2017 |
Country/Territory | Greece |
City | Athens |
Period | 24/05/17 → 26/05/17 |
Internet address |
Keywords
- Congestion games
- Aggregation
- L-p norms
- Complementarities
- Existence of equilibria
- Approximate pure Nash equilibria
- n/a OA procedure