Stackelberg strategies and collusion in network games with splittable flow

DOI10.1007/S00224-010-9269-4zbMATH Open1213.91043OpenAlexW2158770193MaRDI QIDQ538465FDOQ538465

Authors: 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

Recommendations

• Stackelberg Strategies and Collusion in Network Games with Splittable Flow
• Stackelberg Routing in Arbitrary Networks
• Stackelberg strategies for network design games
• The effectiveness of Stackelberg strategies and tolls for network congestion games
• Stackelberg strategies for selfish routing in general multicommodity networks

zbMATH Keywords

coalitionsprice of anarchyatomic splittable flow gamesStackelberg routing

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• A geometric approach to the price of anarchy in nonatomic congestion games
• 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?)
• Über ein Paradoxon aus der Verkehrsplanung
• The impact of oligopolistic competition in networks
• On the relationship between Nash—Cournot and Wardrop equilibria
• Traffic assignment problem for a general network
• Competitive routing in networks with polynomial costs
• 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
• Stackelberg Routing in Arbitrary Networks
• The price of collusion in series-parallel networks
• Stackelberg strategies and collusion in network games with splittable flow
• The price of routing unsplittable flow
• 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
• The effectiveness of Stackelberg strategies and tolls for network congestion games
• Title not available (Why is that?)
• Local smoothness and the price of anarchy in splittable congestion games
• Technical Note—Traffic Equilibrium Paradoxes
• Exact Price of Anarchy for Polynomial Congestion Games
• Integer Programming and Combinatorial Optimization

Cited In (20)

• Title not available (Why is that?)
• The effect of collusion in congestion games
• Cost-sharing in generalised selfish routing
• Risk-averse selfish routing
• Uniqueness of equilibria in atomic splittable polymatroid congestion games
• Achieving target equilibria in network routing games without knowing the latency functions
• Flow sharing and bankruptcy games
• Game efficiency through linear programming duality
• Equilibrium computation in resource allocation games
• Pathwise smooth splittable congestion games and inefficiency
• Local smoothness and the price of anarchy in splittable congestion games
• Collusion in atomic splittable routing games
• Strategic decentralization in binary choice composite congestion games
• Stackelberg strategies and collusion in network games with splittable flow
• Uniqueness of equilibria in atomic splittable polymatroid congestion games
• Stackelberg Strategies and Collusion in Network Games with Splittable Flow
• The price of collusion in series-parallel networks
• On the uniqueness of equilibrium in atomic splittable routing games
• Stackelberg strategies for network design games
• 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 Q538465)