Stackelberg strategies for atomic congestion games

DOI10.1007/S00224-008-9152-8MaRDI QIDQ987387zbMATH OpenOpenAlexDBLPWikidataFDO

Authors 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

price of anarchycongestion gamesStackelberg routing

Mathematics Subject Classification ID

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

Recommendations

• Stackelberg Strategies for Atomic Congestion Games
• On Stackelberg strategies in affine congestion games
• On Stackelberg strategies in affine congestion games
• The effectiveness of Stackelberg strategies and tolls for network congestion games
• The effectiveness of Stackelberg strategies and tolls for network congestion games

Cites work

• scientific article; zbMATH DE number 2086670 (Why is no real title available?)
• A class of games possessing pure-strategy Nash equilibria
• Automata, Languages and Programming
• Automata, Languages and Programming
• Exact Price of Anarchy for Polynomial Congestion Games
• Minimum cost flow algorithms for series-parallel networks
• STACS 2004
• Selfish Routing in Capacitated Networks
• Selfish load balancing and atomic congestion games
• Stackelberg Scheduling Strategies
• Stackelberg strategies for selfish routing in general multicommodity networks
• The effectiveness of Stackelberg strategies and tolls for network congestion games
• The price of anarchy is independent of the network topology
• The price of anarchy of finite congestion games
• The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions
• The price of routing unsplittable flow
• Tight Bounds for Selfish and Greedy Load Balancing
• Worst-case equilibria

Cited in

(28)

• The price of anarchy of affine congestion games with similar strategies
• Using Temporal Dummy Players in Cost-Sharing Games
• Efficiency of equilibria in uniform matroid congestion games
• Non-atomic one-round walks in congestion games
• Leadership in singleton congestion games: what is hard and what is easy
• FIFO and randomized competitive packet routing games
• The effectiveness of Stackelberg strategies and tolls for network congestion games
• Uniform mixed equilibria in network congestion games with link failures
• The power of one evil secret agent
• Inefficiency of pure Nash equilibria in series-parallel network congestion games
• On the robustness of the approximate price of anarchy in generalized congestion games
• A selective tour through congestion games
• Stackelberg strategies for selfish routing in general multicommodity networks
• Congestion games with priority-based scheduling
• On Stackelberg strategies in affine congestion games
• On the impact of singleton strategies in congestion games
• A unifying tool for bounding the quality of non-cooperative solutions in weighted congestion games
• Dynamic resource allocation games
• The power of one secret agent
• Strategic decentralization in binary choice composite congestion games
• The price of optimum: complexity and approximation for a matching game
• The sequential price of anarchy for affine congestion games with few players
• The effectiveness of Stackelberg strategies and tolls for network congestion games
• On the existence of optimal taxes for network congestion games with heterogeneous users
• On Stackelberg strategies in affine congestion games
• Stackelberg pricing games with congestion effects
• Stackelberg Strategies for Atomic Congestion Games
• Dynamic Atomic Congestion Games with Seasonal Flows

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 Q987387)