Atomic congestion games: fast, myopic and concurrent

DOI10.1007/S00224-009-9198-2MaRDI QIDQ987399zbMATH OpenOpenAlexWikidataFDO

Authors Dimitris Fotakis, A. C. Kaporis, 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

zbMATH Keywords

atomic modelapproximate Nash equilibriadistributed congestion games

Mathematics Subject Classification ID

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

Recommendations

• Atomic Congestion Games: Fast, Myopic and Concurrent
• Atomic Congestion Games Among Coalitions
• Atomic congestion games among coalitions
• Convergence to approximate Nash equilibria in congestion games
• Mathematical Foundations of Computer Science 2004

Cites work

• scientific article; zbMATH DE number 5869530 (Why is no real title available?)
• scientific article; zbMATH DE number 1256771 (Why is no real title available?)
• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• scientific article; zbMATH DE number 903638 (Why is no real title available?)
• A class of games possessing pure-strategy Nash equilibria
• Adaptive routing with stale information
• Atomic Congestion Games Among Coalitions
• Convergence to approximate Nash equilibria in congestion games
• Distributed selfish load balancing
• Fast convergence of selfish rerouting
• Fast convergence to Wardrop equilibria by adaptive sampling methods
• Potential games with continuous player sets
• Routing without regret, on convergence to Nash equilibria of regret-minimizing algorithms in routing games
• Selfish unsplittable flows
• The complexity of pure Nash equilibria
• The effect of collusion in congestion games
• Worst-case equilibria

Cited in

(9)

• Atomic Congestion Games Among Coalitions
• Convergence to equilibrium of logit dynamics for strategic games
• The price of anarchy and stability in general noisy best-response dynamics
• Concurrent imitation dynamics in congestion games
• Distributed algorithms for QoS load balancing
• Load balancing without regret in the bulletin board model
• A selective tour through congestion games
• Atomic Congestion Games: Fast, Myopic and Concurrent
• Atomic congestion games among coalitions

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)