Atomic congestion games: fast, myopic and concurrent

DOI10.1007/S00224-009-9198-2zbMATH Open1203.91119OpenAlexW4241368548WikidataQ59818445 ScholiaQ59818445MaRDI QIDQ987399FDOQ987399

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

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

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)

Cites Work

• Worst-case equilibria
• 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
• Convergence to approximate Nash equilibria in congestion games
• Routing without regret, on convergence to Nash equilibria of regret-minimizing algorithms in routing games
• 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 (9)

• 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
• A selective tour through congestion games
• Atomic Congestion Games: Fast, Myopic and Concurrent
• Atomic congestion games among coalitions
• 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)