On the Existence of Optimal Taxes for Network Congestion Games with Heterogeneous Users

  • Dimitris Fotakis
  • George Karakostas
  • Stavros G. Kolliopoulos
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6386)


We consider network congestion games in which a finite number of non-cooperative users select paths. The aim is to mitigate the inefficiency caused by the selfish users by introducing taxes on the network edges. A tax vector is strongly (weakly)-optimal if all (at least one of) the equilibria in the resulting game minimize(s) the total latency. The issue of designing optimal tax vectors for selfish routing games has been studied extensively in the literature. We study for the first time taxation for networks with atomic users which have unsplittable traffic demands and are heterogeneous, i.e., have different sensitivities to taxes. On the positive side, we show the existence of weakly-optimal taxes for single-source network games. On the negative side, we show that the cases of homogeneous and heterogeneous users differ sharply as far as the existence of strongly-optimal taxes is concerned: there are parallel-link games with linear latencies and heterogeneous users that do not admit strongly-optimal taxes.


Nash Equilibrium Optimal Taxis Congestion Game Pure Nash Equilibrium Total Latency 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Aashtiani, H.Z., Magnanti, T.L.: Equilibria on a congested transportation network. SIAM Journal of Algebraic and Discrete Methods 2, 213–226 (1981)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Beckmann, M., McGuire, C.B., Winsten, C.B.: Studies in the Economics of Transportation. Yale University Press, New Haven (1956)Google Scholar
  3. 3.
    Caragiannis, I., Kaklamanis, C., Kanellopoulos, P.: Taxes for linear atomic congestion games. In: Proceedings of the 14th Annual European Symposium on Algorithms, pp. 184–195 (2006)Google Scholar
  4. 4.
    Cole, R., Dodis, Y., Roughgarden, T.: Pricing network edges for heterogeneous selfish users. In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, pp. 521–530 (2003)Google Scholar
  5. 5.
    Fleischer, L., Jain, K., Mahdian, M.: Tolls for heterogeneous selfish users in multicommodity networks and generalized congestion games. In: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, pp. 277–285 (2004)Google Scholar
  6. 6.
    Fotakis, D.: Stackelberg strategies for atomic congestion games. Theory of Computing Systems 47(1), 218–249 (2010)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Fotakis, D., Spirakis, P.G.: Cost-balancing tolls for atomic network congestion games. Internet Mathematics 5(4), 343–364 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Gairing, M., Lücking, T., Monien, B., Tiemann, K.: Nash Equilibria, the Price of Anarchy and the Fully Mixed Nash Equilibrium Conjecture. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 51–65. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  9. 9.
    Karakostas, G., Kolliopoulos, S.G.: Edge pricing of multicommodity networks for heteregoneous selfish users. In: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, pp. 268–276 (2004)Google Scholar
  10. 10.
    Kontogiannis, S.C., Spirakis, P.G.: Atomic selfish routing in networks: a survey. In: Deng, X., Ye, Y. (eds.) WINE 2005. LNCS, vol. 3828, pp. 989–1002. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  11. 11.
    Mavronicolas, M., Milchtaich, I., Monien, B., Tiemann, K.: Congestion games with player-specific constants. In: Kučera, L., Kučera, A. (eds.) MFCS 2007. LNCS, vol. 4708, pp. 633–644. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  12. 12.
    Pigou, A.C.: The Economics of Welfare. Macmillan and Co., London (1920)Google Scholar
  13. 13.
    Rosenthal, R.W.: A class of games posessing pure Nash strategy equilibria. International Journal of Game Theory 2, 65–67 (1973)MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    Swamy, C.: The effectiveness of Stackelberg strategies and tolls for network congestion games. In: Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1133–1142 (2007)Google Scholar
  15. 15.
    Roughgarden, T.: The price of anarchy is independent of the network topology. Journal of Computer and System Sciences 67(2), 341–364 (2003)MathSciNetCrossRefzbMATHGoogle Scholar
  16. 16.
    Wardrop, J.G.: Some theoretical aspects of road traffic research. Proc. Inst. Civil Engineers, Part II 1, 325–378 (1952)CrossRefGoogle Scholar
  17. 17.
    Yang, H., Huang, H.-J.: The multi-class, multi-criteria traffic network equilibrium and systems optimum problem. Transportation Research B 38, 1–15 (2004)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Dimitris Fotakis
    • 1
  • George Karakostas
    • 2
  • Stavros G. Kolliopoulos
    • 3
  1. 1.School of Electrical and Computer EngineeringNational Technical University of AthensAthensGreece
  2. 2.Department of Computing and Software, and, School of Computational Engineering and ScienceMcMaster UniversityHamiltonCanada
  3. 3.Department of Informatics and TelecommunicationsNational and Kapodistrian University of AthensAthensGreece

Personalised recommendations