Stackelberg Strategies and Collusion in Network Games with Splittable Flow

DOI10.1007/978-3-540-93980-1_11zbMATH Open1209.91046OpenAlexW1876382026MaRDI QIDQ3602835FDOQ3602835

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

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

Mathematics Subject Classification ID

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

Cites Work

• Worst-case equilibria
• Selfish Routing in Capacitated Networks
• The price of anarchy is independent of the network topology
• How bad is selfish routing?
• Title not available (Why is that?)
• Traffic assignment problem for a general network
• The price of anarchy of finite congestion games
• Atomic Congestion Games Among Coalitions
• Stackelberg Scheduling Strategies
• Stackelberg strategies for selfish routing in general multicommodity networks
• The effect of collusion in congestion games
• The price of routing unsplittable flow
• Network Games with Atomic Players
• Selfish routing with atomic players
• The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions
• Stackelberg Strategies for Atomic Congestion Games
• On the Inefficiency of Equilibria in Congestion Games
• The effectiveness of Stackelberg strategies and tolls for network congestion games
• Technical Note—Traffic Equilibrium Paradoxes
• Exact Price of Anarchy for Polynomial Congestion Games
• Integer Programming and Combinatorial Optimization

Cited In (9)

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