Atomic Congestion Games: Fast, Myopic and Concurrent

DOI10.1007/978-3-540-79309-0_12MaRDI QIDQ5459977zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Dimitris Fotakis, A. C. Kaporis, P. G. Spirakis

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

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 2038734 (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
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• Atomic Congestion Games Among Coalitions
• Atomic resource sharing in noncooperative networks
• Bounds for the convergence rate of randomized local search in a multiplayer load-balancing game
• Convergence and Approximation in Potential Games
• 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
• 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
• The price of anarchy of finite congestion games
• The price of routing unsplittable flow

Cited in

(6)

• Atomic Congestion Games Among Coalitions
• Stackelberg Strategies for Atomic Congestion Games
• On the discrete-time origins of the replicator dynamics: from convergence to instability and chaos
• Atomic congestion games: fast, myopic and concurrent
• Characterizing the existence of potential functions in weighted congestion games
• 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 Q5459977)