IDEAS home Printed from https://ideas.repec.org/p/has/discpr/1309.html

Traffic Routing Oligopoly

Author

Listed:
  • David Csercsik

    (P zm ny P‚ter Catholic University Faculty of Information Technology)

  • Balazs Sziklai

    (Institute of Economics Research Centre for Economic and Regional Studies Hungarian Academy of Sciences)

Abstract

The purpose of this paper is to introduce a novel family of games related to congested networks. Traffic routing has been extensively analyzed from the non-cooperative aspect. A common assumption is that each individual optimizes his route in the network selfishly. However looking at the same network from a different scope in some cases we can find some actors that are responsible for the majority part of the traffic. From the point of view of these actors cooperation is indeed an inherent possibility of the game. Sharing information and cooperation with other agents may result in cost savings, and more efficient utilization of network capacities. Depending on the goal and employed strategy of the agents many possible cooperative games can arise. Our aim is to introduce and analyze these wide variety of transferable utility (TU) games. Since the formation of a coalition may affect other players costs via the implied flow and the resulting edge load changes in the network, externalities may arise, thus the underlying games are given in partition function form.

Suggested Citation

  • David Csercsik & Balazs Sziklai, 2013. "Traffic Routing Oligopoly," CERS-IE WORKING PAPERS 1309, Institute of Economics, Centre for Economic and Regional Studies.
    • Handle: RePEc:has:discpr:1309
    as

    Download full text from publisher

    File URL: http://econ.core.hu/file/download/mtdp/MTDP1309.pdf
    Download Restriction: no
    ---><---

    Other versions of this item:

    • Dávid Csercsik & Balázs Sziklai, 2015. "Traffic routing oligopoly," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 23(4), pages 743-762, December.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. László Á. Kóczy, 2018. "Partition Function Form Games," Theory and Decision Library C, Springer, number 978-3-319-69841-0, December.
    2. Ferenc Forgó & László Kóczy & Miklós Pintér, 2015. "Editorial," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 23(4), pages 723-725, December.
    3. D'avid Csercsik & Anne Neumann, 2022. "Solidarity in natural gas storage: A potential allocation mechanism of stored quantities among several players during times of crisis," Papers 2209.05089, arXiv.org, revised Aug 2023.
    4. Dávid Csercsik & Sándor Imre, 2017. "Cooperation and coalitional stability in decentralized wireless networks," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 64(4), pages 571-584, April.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    JEL classification:

    • C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games
    • L13 - Industrial Organization - - Market Structure, Firm Strategy, and Market Performance - - - Oligopoly and Other Imperfect Markets
    • L91 - Industrial Organization - - Industry Studies: Transportation and Utilities - - - Transportation: General

    Statistics

    Access and download statistics

    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:has:discpr:1309. 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: Nora Horvath The email address of this maintainer does not seem to be valid anymore. Please ask Nora Horvath to update the entry or send us the correct address (email available below). General contact details of provider: https://edirc.repec.org/data/iehashu.html .

    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.