Stackelberg Strategies for Selfish Routing in General Multicommodity Networks
- 13 September 2007
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 53 (1), 132-153
- https://doi.org/10.1007/s00453-007-9018-5
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functionsPublished by Association for Computing Machinery (ACM) ,2006
- Tolls for Heterogeneous Selfish Users in Multicommodity Networks and Generalized Congestion GamesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- Edge Pricing of Multicommodity Networks for Heterogeneous Selfish UsersPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- Selfish Routing in Capacitated NetworksMathematics of Operations Research, 2004
- The Price of Anarchy when Costs Are Non-separable and AsymmetricLecture Notes in Computer Science, 2004
- Pricing network edges for heterogeneous selfish usersPublished by Association for Computing Machinery (ACM) ,2003
- Worst-Case EquilibriaLecture Notes in Computer Science, 1999
- Achieving network optima using Stackelberg routing strategiesIEEE/ACM Transactions on Networking, 1997
- Equilibria on a Congested Transportation NetworkSIAM Journal on Algebraic Discrete Methods, 1981
- Traffic Equilibrium and Variational InequalitiesTransportation Science, 1980