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

DOI10.1016/J.TCS.2008.11.002zbMATH Open1157.91016OpenAlexW2054243761MaRDI QIDQ1006047FDOQ1006047

A. C. Kaporis, P. 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)

Cites Work

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

Cited In (13)

• Stackelberg strategies for atomic congestion games
• A Selective Tour Through Congestion Games
• The Price of Nash Equilibria in Multicast Transmissions Games
• A Glimpse at Paul G. Spirakis
• Efficient coordination mechanisms for unrelated machine scheduling
• Achieving target equilibria in network routing games without knowing the latency functions
• Efficient methods for selfish network design
• Price of Anarchy in Networks with Heterogeneous Latency Functions
• 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
• Stackelberg strategies and collusion in network games with splittable flow
• Stackelberg Strategies and Collusion in Network Games with Splittable Flow

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

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