Stackelberg strategies for atomic congestion games

DOI10.1007/S00224-008-9152-8zbMATH Open1203.91035DBLPjournals/mst/Fotakis10aOpenAlexW1965228255WikidataQ59818462 ScholiaQ59818462MaRDI QIDQ987387FDOQ987387

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

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

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)

Cites Work

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

Cited In (28)

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

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)