Skip to main content

The Efficiency of Optimal Taxes

  • Conference paper
Combinatorial and Algorithmic Aspects of Networking (CAAN 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 3405))

Included in the following conference series:

Abstract

It is well known that the selfish behavior of users in a network can be regulated through the imposition of the so-called optimal taxes on the network edges. Any traffic equilibrium reached by the selfish users who are conscious of both the travel latencies and the taxes will minimize the social cost, i.e., will minimize the total latency.

Optimal taxes incur desirable behavior from the society point of view but they cause disutility to the network users since the users’ total cost is in general increased [4]. Excessive disutility due to taxation may be undesirable from the societal perspective as well. In this work we examine the efficiency of taxation as a mechanism for achieving the desired goal of minimizing the social cost. We show that for large classes of latency functions the total disutility due to taxation that is caused to the users and/or the system is bounded with respect to the social optimum. In addition, we show that if the social cost takes into account both the total latency and the total taxation in the network, the coordination ratio for certain latency functions is better than the coordination ratio when taxation is not used.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aashtiani, H.Z., Magnanti, T.L.: Equilibria on a congested transportation network. SIAM Journal of Algebraic and Discrete Methods 2, 213–226 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  2. Beckmann, M., McGuire, C.B., Winsten, C.B.: Studies in the Economics of Transportation. Yale University Press, New Haven (1956)

    Google Scholar 

  3. Christodoulou, G., Koutsoupias, E., Nanavati, A.: Coordination mechanisms. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 345–357. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  4. Cole, R., Dodis, Y., Roughgarden, T.: How much can taxes help selfish routing? In: Proceedings of the 4th ACM Conference on Electronic Commerce, pp. 98–107 (2003)

    Google Scholar 

  5. 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 

  6. Correa, J.R., Schulz, A.S., Stier Moses, N.E.: Selfish routing in capacitated networks. Technical Report Working Paper 4319-03, MIT Sloan School of Management, Cambridge, MA (June 2003)

    Google Scholar 

  7. Correa, J.R., Schulz, A.S., Stier Moses, N.E.: Selfish routing in capacitated networks. To appear in Mathematics of Operations Research (February 2004)

    Google Scholar 

  8. Dafermos, S., Sparrow, F.T.: The traffic assignment problem for a general network. Journal of Research of the National Bureau of Standards, Series B 73B, 91–118 (1969)

    MathSciNet  Google Scholar 

  9. Fleischer, L., Jain, K., Mahdian, M.: Taxes for heterogeneous selfish users in a multicommodity network. To appear in Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science (2004)

    Google Scholar 

  10. Hardy, G., Littlewood, J.E., Pólya, G.: Inequalities, 2nd edn., Cambridge (1934)

    Google Scholar 

  11. Karakostas, G., Kolliopoulos, S.G.: Edge pricing of multicommodity networks for heteregoneous selfish users. To appear in Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science (2004)

    Google Scholar 

  12. Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. In: Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science, pp. 404–413 (1999)

    Google Scholar 

  13. Osborne, M.J., Rubinstein, A.: A course in Game Theory. The MIT Press, Cambridge (1994)

    MATH  Google Scholar 

  14. Roughgarden, T., Tardos, É.: How bad is selfish routing? Journal of the ACM 49, 236–259 (2002)

    Article  MathSciNet  Google Scholar 

  15. Smith, M.J.: The marginal cost taxation of a transportation network. Transportation Research 13B, 237–242 (1979)

    Google Scholar 

  16. Wardrop, J.G.: Some theoretical aspects of road traffic research. In: Proc. Inst. Civil Engineers, Part II, vol. 1, pp. 325–378 (1952)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Karakostas, G., Kolliopoulos, S.G. (2005). The Efficiency of Optimal Taxes. In: López-Ortiz, A., Hamel, A.M. (eds) Combinatorial and Algorithmic Aspects of Networking. CAAN 2004. Lecture Notes in Computer Science, vol 3405. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11527954_2

Download citation

  • DOI: https://doi.org/10.1007/11527954_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-27873-3

  • Online ISBN: 978-3-540-31860-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics