Skip to main content
SpringerLink
Log in

A game-theoretic approach to network equilibrium

  • Short Papers
  • Chapter
  • First Online:
Book cover Netflow at Pisa

Part of the book series: Mathematical Programming Studies ((MATHPROGRAMM,volume 26))

Abstract

A noncooperative game is formulated on a transportation network with congestion. The players are associated with origin-destination pairs; each player supplies from an origin a destination, where demand is variable. A Nash-Cournot equilibrium is defined and conditions for existence and uniqueness are provided. The asymptotic behaviour of the equilibrium is shown to yield a total flow vector corresponding to a competitive equilibrium.

Research supported by NSERC Grant #A4952, SSHRC Grant #410-81-0722-R2, FCAC Grant #AS-26.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. C. Dafermos, “An iterative scheme for variational inequalities”, Mathematical Programming 26 (1983) 40–47.

    Article  MATH  MathSciNet  Google Scholar 

  2. S. C. Dafermos, “Traffie equilibrium and variational inequalities”, Transportation Science 14 (1980) 42–54.

    Article  MathSciNet  Google Scholar 

  3. J. W. Friedman, Oligopoly and the theory of games (Horth-Holland, Amsterdam, 1977).

    MATH  Google Scholar 

  4. J. C. Goodman, “A note on existence and uniqueness of equilibrium points for concave N-person games”, Econometrica 48 (1980) 251.

    Article  MATH  MathSciNet  Google Scholar 

  5. A. Haurie and P. Marcotte, “On the relationship between Nash-Cournot and Wardrop equilibria”, Cahier du GERAD G-83-17, Ecole des Hautes Etudes Commerciales (Montreal, 1983), to appear in Networks.

    Google Scholar 

  6. J. B. Rosen, “Existence and uniqueness of equilibrium points for concave N-person games”, Econometrica 33 (1965) 520–534.

    Article  MATH  MathSciNet  Google Scholar 

  7. M. J. Smith, “The existence, uniqueness and stability of traffic equilibria”, Transportation Research 13B (1979) 295–304.

    Google Scholar 

  8. J. G. Wardrop, “Some theoretical aspects of road traffic research”, Proceedings of the Institute of Civil Engineers, Part II I (1952) 325–378.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. GERAD, Ecole des Hautes Etudes Commerciales, 5255 avenue Decelles, H3T 1V6, Montreal, Quebec, Canada

    Alain Haurie

  2. GERAD, Ecole des Hautes Etudes Commerciales, 5255 avenue Decelles, H3T 1V6, Montreal, Quebec, Canada

    Patrice Marcotte

  3. Centre de Recherche sur les Transports, Université de Montreal, Succursale ‘A’, C. P. 6128, H3C 3J7, Montreal, Quebec, Canada

    Patrice Marcotte

Authors
  1. Alain Haurie
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Patrice Marcotte
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Giorgio Gallo Claudio Sandi

Rights and permissions

Reprints and permissions

Copyright information

© 1986 The Mathematical Programming Society, Inc.

About this chapter

Cite this chapter

Haurie, A., Marcotte, P. (1986). A game-theoretic approach to network equilibrium. In: Gallo, G., Sandi, C. (eds) Netflow at Pisa. Mathematical Programming Studies, vol 26. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0121108

Download citation

  • DOI: https://doi.org/10.1007/BFb0121108

  • Received:

  • Revised:

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-00922-8

  • Online ISBN: 978-3-642-00923-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation