Skip to main content
SpringerLink
Log in

Network Topologies for Weakly Pareto Optimal Nonatomic Selfish Routing

  • Conference paper
  • First Online:
Computing and Combinatorics (COCOON 2016)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9797))

Included in the following conference series:

Abstract

In this paper we study the model of nonatomic selfish routing and characterize the topologies of undirected/directed networks in which every Nash equilibrium is weakly Pareto optimal, meaning that no deviation of all players could make everybody better off. In particular, we first obtain the characterizations for single-commodity case by applying relatively standard graphical arguments, and then the counterpart for two-commodity undirected case by introducing some new algorithmic ideas and reduction techniques.

Research supported in part by NNSF of China under Grant No. 11531014 and 11222109, and by CAS Program for Cross & Cooperative Team of Science & Technology Innovation.

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

Access this chapter

Log in via an institution
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 EPUB and 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

Notes

  1. 1.

    In terminologies of [8], \(G'\) is said to be embedded in G.

References

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

    Google Scholar 

  2. Braess, D.: Über ein paradoxon aus der verkehrsplanung. Unternehmensforschung 12(1), 258–268 (1968)

    MathSciNet  MATH  Google Scholar 

  3. Chen, X., Chen, Z., Hu, X.: Excluding braess’s paradox in nonatomic selfish routing. In: Hoefer, M., et al. (eds.) SAGT 2015. LNCS, vol. 9347, pp. 219–230. Springer, Heidelberg (2015). doi:10.1007/978-3-662-48433-3_17

    Google Scholar 

  4. Epstein, A., Feldman, M., Mansour, Y.: Efficient graph topologies in network routing games. Games Econ. Behav. 66(1), 115–125 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  5. Holzman, R., yone (Lev-tov), N.L.: Strong equilibrium in congestion games. Games Econ. Behav 21(1–2), 85–101 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  6. Holzman, R., yone (Lev-tov), N.L.: Network structure and strong equilibrium in route selection games. Math. Soc. Sci. 46(2), 193–205 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  7. Holzman, R., Monderer, D.: Strong equilibrium in network congestion games: increasing versus decreasing costs. Int. J. Game Theory 44, 647–666 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  8. Milchtaich, I.: Network topology and the efficiency of equilibrium. Games and Econ. Behav. 57(2), 321–346 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  9. Roughgarden, T., Tardos, É.: How bad is selfish routing? J. ACM 49(2), 236–259 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  10. Valdes, J., Tarjan, R.E., Lawler, E.L.: The recognition of series parallel digraphs. SIAM J. Comput. 11(2), 298 (1982)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Applied Mathematics, AMSS, Chinese Academy of Sciences, Beijing, 100190, China

    Xujin Chen & Zhuo Diao

Authors
  1. Xujin Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhuo Diao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zhuo Diao .

Editor information

Editors and Affiliations

  1. Virginia Commonwealth Univ , Richmond, Virginia, USA

    Thang N. Dinh

  2. University of Florida , Gainesville, Alabama, USA

    My T. Thai

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Chen, X., Diao, Z. (2016). Network Topologies for Weakly Pareto Optimal Nonatomic Selfish Routing. In: Dinh, T., Thai, M. (eds) Computing and Combinatorics . COCOON 2016. Lecture Notes in Computer Science(), vol 9797. Springer, Cham. https://doi.org/10.1007/978-3-319-42634-1_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-42634-1_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-42633-4

  • Online ISBN: 978-3-319-42634-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation