Stackelberg strategies and collusion in network games with splittable flow

DOI10.1007/S00224-010-9269-4zbMath1213.91043OpenAlexW2158770193MaRDI QIDQ538465

Tobias Harks

Publication date: 25 May 2011

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-010-9269-4

zbMATH Keywords

coalitionsprice of anarchyatomic splittable flow gamesStackelberg routing

Mathematics Subject Classification ID

Hierarchical games (including Stackelberg games) (91A65) Games involving graphs (91A43)

Related Items (14)

Cost-Sharing in Generalised Selfish Routing ⋮ Uniqueness of equilibria in atomic splittable polymatroid congestion games ⋮ On the Uniqueness of Equilibrium in Atomic Splittable Routing Games ⋮ Strategic decentralization in binary choice composite congestion games ⋮ Equilibrium computation in resource allocation games ⋮ Collusion in atomic splittable routing games ⋮ Unnamed Item ⋮ Local smoothness and the price of anarchy in splittable congestion games ⋮ Stackelberg strategies and collusion in network games with splittable flow ⋮ Achieving target equilibria in network routing games without knowing the latency functions ⋮ Risk-Averse Selfish Routing ⋮ Pathwise smooth splittable congestion games and inefficiency ⋮ Game efficiency through linear programming duality ⋮ Uniqueness of Equilibria in Atomic Splittable Polymatroid Congestion Games

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stackelberg strategies and collusion in network games with splittable flow
• The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions
• Stackelberg strategies for selfish routing in general multicommodity networks
• Local smoothness and the price of anarchy in splittable congestion games
• A geometric approach to the price of anarchy in nonatomic congestion games
• The effect of collusion in congestion games
• The Impact of Oligopolistic Competition in Networks
• Stackelberg Routing in Arbitrary Networks
• How bad is selfish routing?
• Technical Note—Traffic Equilibrium Paradoxes
• Stackelberg Strategies for Atomic Congestion Games
• The Price of Collusion in Series-Parallel Networks
• The price of anarchy of finite congestion games
• Atomic Congestion Games Among Coalitions
• On the relationship between Nash—Cournot and Wardrop equilibria
• Stackelberg Scheduling Strategies
• Competitive routing in networks with polynomial costs
• Exact Price of Anarchy for Polynomial Congestion Games
• Über ein Paradoxon aus der Verkehrsplanung
• Traffic assignment problem for a general network
• Selfish Routing in Capacitated Networks
• Integer Programming and Combinatorial Optimization
• The Price of Routing Unsplittable Flow
• The price of anarchy is independent of the network topology

This page was built for publication: Stackelberg strategies and collusion in network games with splittable flow