On Stackelberg Strategies in Affine Congestion Games

DOI10.1007/978-3-662-48995-6_10zbMath1404.91045OpenAlexW2296280118MaRDI QIDQ3460782

Cosimo Vinci, Vittorio Bilò

Publication date: 8 January 2016

Published in: Web and Internet Economics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-48995-6_10

zbMATH Keywords

Stackelberg strategiesaffine congestion games

Mathematics Subject Classification ID

Hierarchical games (including Stackelberg games) (91A65) Games involving graphs (91A43)

Related Items

Unnamed Item, Non-atomic one-round walks in congestion games, A unifying tool for bounding the quality of non-cooperative solutions in weighted congestion games, The price of anarchy of affine congestion games with similar strategies, 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 the Robustness of the Approximate Price of Anarchy in Generalized Congestion Games, On Stackelberg strategies in affine congestion games

Cites Work

• Unnamed Item
• Tight bounds for selfish and greedy load balancing
• Selfish load balancing and atomic congestion games
• A new model for selfish routing
• Nash equilibria in discrete routing games with convex latency functions
• Stackelberg strategies for atomic congestion games
• Stackelberg strategies for selfish routing in general multicommodity networks
• A class of games possessing pure-strategy Nash equilibria
• A Unifying Tool for Bounding the Quality of Non-cooperative Solutions in Weighted Congestion Games
• Exact Price of Anarchy for Polynomial Congestion Games
• The effectiveness of stackelberg strategies and tolls for network congestion games
• The price of anarchy of finite congestion games
• Weighted Congestion Games: Price of Anarchy, Universal Worst-Case Examples, and Tightness
• Stackelberg Scheduling Strategies
• The Price of Routing Unsplittable Flow