IDEAS home Printed from https://ideas.repec.org/h/spr/ssrchp/978-3-319-11674-7_8.html
   My bibliography  Save this book chapter

Stackelberg and Inverse Stackelberg Road Pricing Games: State of the Art and Future Research

In: Game Theoretic Analysis of Congestion, Safety and Security

Author

Listed:
  • Kateřina Staňková

    (Maastricht University)

  • Alexander Boudewijn

    (Maastricht University)

Abstract

Optimal toll design deals with the problem of determining toll which improves performance of a road traffic system. Noncooperative game theory is an excellent tool to investigate possible strategies to analyze such a problem, in which one has to take drivers’ reaction to toll and consequent changes in the traffic flow into account. Depending on the toll structure, the problem may be formulated as a Stackelberg game (when toll is uniform or time-varying) or as an inverse Stackelberg game (when toll is traffic-flow dependent), with the road authority as the leader and drivers as followers. While the inverse Stackelberg approach is more complex to adopt, it has been shown in our previous work that in most situations it brings better outcome for the road authority. This chapter reviews existing results on this topic, discusses our recent case studies within this framework, develops new properties, and brings forward the open issues within this area.

Suggested Citation

  • Kateřina Staňková & Alexander Boudewijn, 2015. "Stackelberg and Inverse Stackelberg Road Pricing Games: State of the Art and Future Research," Springer Series in Reliability Engineering, in: Kjell Hausken & Jun Zhuang (ed.), Game Theoretic Analysis of Congestion, Safety and Security, edition 127, pages 191-209, Springer.
  • Handle: RePEc:spr:ssrchp:978-3-319-11674-7_8
    DOI: 10.1007/978-3-319-11674-7_8
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:ssrchp:978-3-319-11674-7_8. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.