Atomic Congestion Games: Fast, Myopic and Concurrent

DOI10.1007/978-3-540-79309-0_12zbMath1136.91497OpenAlexW2153216058WikidataQ59818509 ScholiaQ59818509MaRDI QIDQ5459977

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

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

Related Items (1)

Characterizing the existence of potential functions in weighted congestion games

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Potential games
• 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
• The price of anarchy of finite congestion games
• Distributed selfish load balancing
• Atomic Congestion Games Among Coalitions
• Routing without regret
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• Convergence and Approximation in Potential Games
• Bounds for the convergence rate of randomized local search in a multiplayer load-balancing game
• The Price of Routing Unsplittable Flow
• Potential games with continuous player sets
• Atomic resource sharing in noncooperative networks

This page was built for publication: Atomic Congestion Games: Fast, Myopic and Concurrent