Atomic congestion games: fast, myopic and concurrent
From MaRDI portal
Publication:987399
DOI10.1007/S00224-009-9198-2zbMATH Open1203.91119OpenAlexW4241368548WikidataQ59818445 ScholiaQ59818445MaRDI QIDQ987399FDOQ987399
A. C. Kaporis, Dimitris Fotakis, P. G. Spirakis
Publication date: 13 August 2010
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-009-9198-2
Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Noncooperative games (91A10)
Cites Work
- Title not available (Why is that?)
- A class of games possessing pure-strategy Nash equilibria
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Atomic Congestion Games Among Coalitions
- The effect of collusion in congestion games
- Title not available (Why is that?)
- Routing without regret
- Fast convergence to Wardrop equilibria by adaptive sampling methods
- Distributed selfish load balancing
- Adaptive routing with stale information
- Title not available (Why is that?)
Cited In (6)
- A Selective Tour Through Congestion Games
- The price of anarchy and stability in general noisy best-response dynamics
- Convergence to equilibrium of logit dynamics for strategic games
- Concurrent imitation dynamics in congestion games
- Distributed algorithms for QoS load balancing
- Load balancing without regret in the bulletin board model
Recommendations
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 Q987399)
