Stackelberg Strategies for Atomic Congestion Games

DOI10.1007/978-3-540-75520-3_28MaRDI QIDQ3527221zbMATH OpenOpenAlexWikidataFDO

Authors Dimitris Fotakis

Publication date 25 September 2008

Published in Algorithms – ESA 2007 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-75520-3_28

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Noncooperative games (91A10) Games involving graphs (91A43) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Recommendations

• Stackelberg strategies for atomic congestion games
• On Stackelberg strategies in affine congestion games
• On Stackelberg strategies in affine congestion games
• Atomic Congestion Games Among Coalitions
• Atomic congestion games among coalitions
• The sequential price of anarchy for atomic congestion games
• Selfish load balancing and atomic congestion games
• Equilibria in Multiclass and Multidimensional Atomic Congestion Games
• Atomic congestion games with random players: network equilibrium and the price of anarchy
• Atomic Congestion Games: Fast, Myopic and Concurrent

Cited in

(20)

• The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions
• Leadership in singleton congestion games: what is hard and what is easy
• On Stackelberg strategies in affine congestion games
• Stackelberg strategies for network design games
• Dynamic resource allocation games
• The effectiveness of Stackelberg strategies and tolls for network congestion games
• The effectiveness of Stackelberg strategies and tolls for network congestion games
• Strategic decentralization in binary choice composite congestion games
• On Stackelberg strategies in affine congestion games
• Stackelberg Strategies and Collusion in Network Games with Splittable Flow
• Efficient methods for selfish network design
• Dynamic Atomic Congestion Games with Seasonal Flows
• Stackelberg strategies and collusion in network games with splittable flow
• Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy
• Inefficiency of pure Nash equilibria in series-parallel network congestion games
• Stackelberg pricing games with congestion effects
• Attaining equilibria using control sets
• Attaining equilibria using control sets
• Stackelberg strategies for atomic congestion games
• Congestion games with linearly independent paths: convergence time and price of anarchy

This page was built for publication: Stackelberg Strategies for Atomic Congestion Games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3527221)