Atomic congestion games: fast, myopic and concurrent

DOI10.1007/S00224-009-9198-2zbMath1203.91119OpenAlexW4241368548WikidataQ59818445 ScholiaQ59818445MaRDI QIDQ987399

Dimitris Fotakis, Alexis C. Kaporis, Paul 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

zbMATH Keywords

atomic modelapproximate Nash equilibriadistributed congestion games

Mathematics Subject Classification ID

Noncooperative games (91A10) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (6)

The price of anarchy and stability in general noisy best-response dynamics ⋮ Concurrent imitation dynamics in congestion games ⋮ A Selective Tour Through Congestion Games ⋮ Convergence to equilibrium of logit dynamics for strategic games ⋮ Distributed algorithms for QoS load balancing ⋮ Load balancing without regret in the bulletin board model

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A class of games possessing pure-strategy Nash equilibria
• Selfish unsplittable flows
• The effect of collusion in congestion games
• Fast convergence to Wardrop equilibria by adaptive sampling methods
• The complexity of pure Nash equilibria
• Distributed selfish load balancing
• Atomic Congestion Games Among Coalitions
• Adaptive routing with stale information
• Routing without regret
• Potential games with continuous player sets

This page was built for publication: Atomic congestion games: fast, myopic and concurrent