Stackelberg strategies and collusion in network games with splittable flow
From MaRDI portal
Publication:538465
DOI10.1007/S00224-010-9269-4zbMATH Open1213.91043OpenAlexW2158770193MaRDI QIDQ538465FDOQ538465
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
Cites work
- scientific article; zbMATH DE number 2086670 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 6469241 (Why is no real title available?)
- A geometric approach to the price of anarchy in nonatomic congestion games
- Atomic Congestion Games Among Coalitions
- Competitive routing in networks with polynomial costs
- Exact Price of Anarchy for Polynomial Congestion Games
- How bad is selfish routing?
- Integer Programming and Combinatorial Optimization
- Local smoothness and the price of anarchy in splittable congestion games
- On the relationship between Nash—Cournot and Wardrop equilibria
- Selfish Routing in Capacitated Networks
- Selfish routing with atomic players
- Stackelberg Routing in Arbitrary Networks
- Stackelberg Scheduling Strategies
- Stackelberg Strategies for Atomic Congestion Games
- Stackelberg strategies and collusion in network games with splittable flow
- 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 impact of oligopolistic competition in networks
- The price of anarchy is independent of the network topology
- The price of anarchy of finite congestion games
- The price of collusion in series-parallel networks
- 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
- Über ein Paradoxon aus der Verkehrsplanung
Cited in
(20)- Stackelberg Strategies and Collusion in Network Games with Splittable Flow
- Equilibrium computation in resource allocation games
- Cost-sharing in generalised selfish routing
- Stackelberg strategies for network design games
- Uniqueness of equilibria in atomic splittable polymatroid congestion games
- Uniqueness of equilibria in atomic splittable polymatroid congestion games
- Game efficiency through linear programming duality
- The price of collusion in series-parallel networks
- Achieving target equilibria in network routing games without knowing the latency functions
- Collusion in atomic splittable routing games
- Stackelberg strategies and collusion in network games with splittable flow
- scientific article; zbMATH DE number 7378728 (Why is no real title available?)
- Collusion in atomic splittable routing games
- Risk-averse selfish routing
- Local smoothness and the price of anarchy in splittable congestion games
- Strategic decentralization in binary choice composite congestion games
- Pathwise smooth splittable congestion games and inefficiency
- On the uniqueness of equilibrium in atomic splittable 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 Q538465)
