Atomic Congestion Games: Fast, Myopic and Concurrent
From MaRDI portal
Publication:5459977
DOI10.1007/978-3-540-79309-0_12zbMATH Open1136.91497DBLPconf/sagt/FotakisKS08OpenAlexW2153216058WikidataQ59818509 ScholiaQ59818509MaRDI QIDQ5459977FDOQ5459977
P. G. Spirakis, A. C. Kaporis, Dimitris Fotakis
Publication date: 2 May 2008
Published in: Algorithmic Game Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-79309-0_12
Recommendations
Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Noncooperative games (91A10)
Cites Work
- A class of games possessing pure-strategy Nash equilibria
- Title not available (Why is that?)
- Title not available (Why is that?)
- Potential games
- Potential games with continuous player sets
- Selfish unsplittable flows
- Title not available (Why is that?)
- Fast convergence of selfish rerouting
- The complexity of pure Nash equilibria
- The price of anarchy of finite congestion games
- Atomic Congestion Games Among Coalitions
- Bounds for the convergence rate of randomized local search in a multiplayer load-balancing game
- Atomic resource sharing in noncooperative networks
- The effect of collusion in congestion games
- The Price of Routing Unsplittable Flow
- Title not available (Why is that?)
- Routing without regret
- Fast convergence to Wardrop equilibria by adaptive sampling methods
- Distributed selfish load balancing
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Title not available (Why is that?)
- Convergence and Approximation in Potential Games
Cited In (3)
This page was built for publication: Atomic Congestion Games: Fast, Myopic and Concurrent
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5459977)