The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions

DOI10.1016/j.tcs.2008.11.002zbMath1157.91016OpenAlexW2054243761MaRDI QIDQ1006047

Alexis C. Kaporis, Paul G. Spirakis

Publication date: 17 March 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.11.002

zbMATH Keywords

Stackelbergprice of optimumcoordination ratio

Mathematics Subject Classification ID

Cooperative games (91A12) General equilibrium theory (91B50)

Related Items (11)

Stackelberg thresholds in network routing games or the value of altruism ⋮ Efficient coordination mechanisms for unrelated machine scheduling ⋮ A Glimpse at Paul G. Spirakis ⋮ A Selective Tour Through Congestion Games ⋮ Efficient methods for selfish network design ⋮ Stackelberg strategies and collusion in network games with splittable flow ⋮ Stackelberg strategies for atomic congestion games ⋮ Stackelberg Strategies and Collusion in Network Games with Splittable Flow ⋮ Achieving target equilibria in network routing games without knowing the latency functions ⋮ The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions ⋮ Stackelberg strategies for selfish routing in general multicommodity networks

Cites Work

• Selfish splittable flows and NP-completeness
• Stackelberg thresholds in network routing games or the value of altruism
• The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions
• Stackelberg strategies for selfish routing in general multicommodity networks
• A generalization of Dijkstra's algorithm
• Algorithmic mechanism design (extended abstract)
• Capacity allocation under noncooperative routing
• Stackelberg Routing in Arbitrary Networks
• Stackelberg Strategies for Atomic Congestion Games
• Inefficiency of Nash Equilibria
• Stackelberg Scheduling Strategies
• Stackelberg scheduling strategies
• The price of selfish routing
• Algorithms, games, and the internet
• Algorithmic Game Theory
• Traffic assignment problem for a general network
• Experimental and Efficient Algorithms
• The price of anarchy is independent of the network topology
• Sharing the cost of multicast transmissions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions