Stackelberg Strategies and Collusion in Network Games with Splittable Flow

DOI10.1007/978-3-540-93980-1_11MaRDI QIDQ3602835zbMATHOpenAlexFDO

Authors Tobias Harks

Publication date 12 February 2009

Published in Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-93980-1_11

Mathematics Subject Classification ID

Games involving graphs (91A43) Distributed systems (68M14)

Recommendations

• Stackelberg strategies and collusion in network games with splittable flow
• Stackelberg Routing in Arbitrary Networks
• Collusion in atomic splittable routing games
• Collusion in atomic splittable routing games
• Stackelberg strategies for network design games

Cites work

• scientific article; zbMATH DE number 6469241 (Why is no real title available?)
• Atomic Congestion Games Among Coalitions
• Exact Price of Anarchy for Polynomial Congestion Games
• How bad is selfish routing?
• Integer Programming and Combinatorial Optimization
• Network Games with Atomic Players
• On the Inefficiency of Equilibria in Congestion Games
• Selfish Routing in Capacitated Networks
• Selfish routing with atomic players
• Stackelberg Scheduling Strategies
• Stackelberg Strategies for Atomic Congestion Games
• Stackelberg strategies for selfish routing in general multicommodity networks
• Technical Note—Traffic Equilibrium Paradoxes
• The effect of collusion in congestion games
• 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
• Traffic assignment problem for a general network
• Worst-case equilibria

Cited in

(9)

• Resilience of routing in parallel link networks
• The price of collusion in series-parallel networks
• Collusion in atomic splittable routing games
• Stackelberg strategies and collusion in network games with splittable flow
• Collusion in atomic splittable routing games
• ``Beat-your-rival routing games
• Balancing Load via Small Coalitions in Selfish Ring Routing Games
• Flow sharing and bankruptcy games
• The effect of collusion in congestion games

This page was built for publication: Stackelberg Strategies and Collusion in Network Games with Splittable Flow

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