Stackelberg Strategies and Collusion in Network Games with Splittable Flow
- 22 May 2010
- journal article
- research article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 48 (4), 781-802
- https://doi.org/10.1007/s00224-010-9269-4
Abstract
No abstract availableKeywords
This publication has 27 references indexed in Scilit:
- The Price of Collusion in Series-Parallel NetworksLecture Notes in Computer Science, 2010
- The Impact of Oligopolistic Competition in NetworksOperations Research, 2009
- Equilibria of Atomic Flow Games are not UniquePublished by Society for Industrial & Applied Mathematics (SIAM) ,2009
- Stackelberg Routing in Atomic Network GamesSSRN Electronic Journal, 2007
- Exact Price of Anarchy for Polynomial Congestion GamesLecture Notes in Computer Science, 2006
- Selfish Routing in Capacitated NetworksMathematics of Operations Research, 2004
- Convex OptimizationPublished by Cambridge University Press (CUP) ,2004
- Competitive routing in networks with polynomial costsIEEE Transactions on Automatic Control, 2002
- Technical Note—Traffic Equilibrium ParadoxesTransportation Science, 1991
- Über ein Paradoxon aus der VerkehrsplanungMathematical Methods of Operations Research, 1968