Stackelberg strategies for atomic congestion games

DOI10.1007/s00224-008-9152-8zbMath1203.91035WikidataQ59818462 ScholiaQ59818462MaRDI QIDQ987387

Dimitris Fotakis

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-008-9152-8

zbMATH Keywords

congestion games; price of anarchy; Stackelberg routing

Mathematics Subject Classification ID

91A10: Noncooperative games

90B18: Communication networks in operations research

91A43: Games involving graphs

91B32: Resource and cost allocation (including fair division, apportionment, etc.)

Related Items

Unnamed Item, Unnamed Item, Congestion games with priority-based scheduling, Inefficiency of pure Nash equilibria in series-parallel network congestion games, Using Temporal Dummy Players in Cost-Sharing Games, The price of optimum: complexity and approximation for a matching game, A unifying tool for bounding the quality of non-cooperative solutions in weighted congestion games, Non-atomic one-round walks in congestion games, On the robustness of the approximate price of anarchy in generalized congestion games, FIFO and randomized competitive packet routing games, The power of one evil secret agent, The price of anarchy of affine congestion games with similar strategies, Dynamic resource allocation games, Leadership in singleton congestion games: what is hard and what is easy, The sequential price of anarchy for affine congestion games with few players, On Stackelberg strategies in affine congestion games, Efficiency of Equilibria in Uniform Matroid Congestion Games, On the Existence of Optimal Taxes for Network Congestion Games with Heterogeneous Users, Unnamed Item, On Stackelberg Strategies in Affine Congestion Games, A Selective Tour Through Congestion Games

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Selfish load balancing and atomic congestion games
• The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions
• Stackelberg strategies for selfish routing in general multicommodity networks
• Minimum cost flow algorithms for series-parallel networks
• A class of games possessing pure-strategy Nash equilibria
• The price of anarchy of finite congestion games
• Tight Bounds for Selfish and Greedy Load Balancing
• Stackelberg Scheduling Strategies
• STACS 2004
• Exact Price of Anarchy for Polynomial Congestion Games
• Automata, Languages and Programming
• Selfish Routing in Capacitated Networks
• Automata, Languages and Programming
• The Price of Routing Unsplittable Flow
• The price of anarchy is independent of the network topology