IDEAS home Printed from https://ideas.repec.org/a/wsi/igtrxx/v18y2016i01ns0219198916500018.html
   My bibliography  Save this article

Equilibrium Prices and Flows in the Passenger Traffic Problem

Author

Listed:
  • V. V. Mazalov

    (Institute of Applied Mathematical Research, Karelian Research Center, Russian Academy of Sciences, Pushkinskaya str. 11, Petrozavodsk 185910, Russia)

  • A. V. Melnik

    (Saint-Petersburg State University, Universitetskii pr. 35, Saint Petersburg 198504, Russia)

Abstract

This paper considers a noncooperative transport game of n players on a communication graph. Here players are passenger transportation companies (carriers). Service requests form a Poisson process with an intensity rate matrix Λ. Players announce prices for their services and passengers choose an appropriate service by minimizing their individual costs (the ticket price and the expected service time). For each carrier, we solve the pricing problem and define the equilibrium intensity flows in the conditions of competition. A special emphasis is placed on polynomial latency functions.

Suggested Citation

  • V. V. Mazalov & A. V. Melnik, 2016. "Equilibrium Prices and Flows in the Passenger Traffic Problem," International Game Theory Review (IGTR), World Scientific Publishing Co. Pte. Ltd., vol. 18(01), pages 1-19, March.
    • Handle: RePEc:wsi:igtrxx:v:18:y:2016:i:01:n:s0219198916500018
    DOI: 10.1142/S0219198916500018
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0219198916500018
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0219198916500018?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Spiess, Heinz & Florian, Michael, 1989. "Optimal strategies: A new assignment model for transit networks," Transportation Research Part B: Methodological, Elsevier, vol. 23(2), pages 83-102, April.
    2. Eitan Altman & Nahum Shimkin, 1998. "Individual Equilibrium and Learning in Processor Sharing Systems," Operations Research, INFORMS, vol. 46(6), pages 776-784, December.
    3. Hämäläinen, Raimo P. & Luoma, Jukka & Saarinen, Esa, 2013. "On the importance of behavioral operational research: The case of understanding and communicating about dynamic systems," European Journal of Operational Research, Elsevier, vol. 228(3), pages 623-634.
    4. Levhari, David & Luski, Israel, 1978. "Duopoly pricing and waiting lines," European Economic Review, Elsevier, vol. 11(1), pages 17-35, February.
    5. Yang, Hai & Huang, Hai-Jun, 2004. "The multi-class, multi-criteria traffic network equilibrium and systems optimum problem," Transportation Research Part B: Methodological, Elsevier, vol. 38(1), pages 1-15, January.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Vladimir Mazalov & Elena Konovalchikova, 2020. "Hotelling’s Duopoly in a Two-Sided Platform Market on the Plane," Mathematics, MDPI, vol. 8(6), pages 1-16, May.
    2. Vasco F. Alves, 2019. "Pricing and waiting time decisions in a health care market with private and public provision," Journal of Applied Economics, Taylor & Francis Journals, vol. 22(1), pages 174-195, January.
    3. Zeng Lian & Jie Zheng, 2021. "A Dynamic Model of Cournot Competition for an Oligopolistic Market," Mathematics, MDPI, vol. 9(5), pages 1-18, February.
    4. Kuang, Zhonghong & Lian, Zeng & Lien, Jaimie W. & Zheng, Jie, 2020. "Serial and parallel duopoly competition in multi-segment transportation routes," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 133(C).
    5. Huang, Naqun & Lien, Jaimie W. & Zheng, Jie, 2023. "To acquire or compete? Government intervention in transportation under different route structures," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 172(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Kai Lu & Tao Tang & Chunhai Gao, 2020. "The Depth-First Optimal Strategy Path Generation Algorithm for Passengers in a Metro Network," Sustainability, MDPI, vol. 12(13), pages 1-16, July.
    2. Tong, C.O. & Wong, S.C., 1998. "A stochastic transit assignment model using a dynamic schedule-based network," Transportation Research Part B: Methodological, Elsevier, vol. 33(2), pages 107-121, April.
    3. Xu, Zhandong & Xie, Jun & Liu, Xiaobo & Nie, Yu (Marco), 2020. "Hyperpath-based algorithms for the transit equilibrium assignment problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 143(C).
    4. Ding Luo & Oded Cats & Hans Lint, 2020. "Can passenger flow distribution be estimated solely based on network properties in public transport systems?," Transportation, Springer, vol. 47(6), pages 2757-2776, December.
    5. E. Codina & A. Marín & F. López, 2013. "A model for setting services on auxiliary bus lines under congestion," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 21(1), pages 48-83, April.
    6. Preston, John, 2008. "Competition in transit markets," Research in Transportation Economics, Elsevier, vol. 23(1), pages 75-84, January.
    7. Randall Berry & Michael Honig & Thành Nguyen & Vijay Subramanian & Rakesh Vohra, 2020. "The Value of Sharing Intermittent Spectrum," Management Science, INFORMS, vol. 66(11), pages 5242-5264, November.
    8. Piotr Więcek & Eitan Altman & Arnob Ghosh, 2016. "Mean-Field Game Approach to Admission Control of an M/M/ $$\infty $$ ∞ Queue with Shared Service Cost," Dynamic Games and Applications, Springer, vol. 6(4), pages 538-566, December.
    9. Xingyuan Li & Jing Bai, 2021. "A Ridesharing Choice Behavioral Equilibrium Model with Users of Heterogeneous Values of Time," IJERPH, MDPI, vol. 18(3), pages 1-22, January.
    10. Junyi Chai & Zhiquan Weng & Wenbin Liu, 2021. "Behavioral Decision Making in Normative and Descriptive Views: A Critical Review of Literature," JRFM, MDPI, vol. 14(10), pages 1-14, October.
    11. Ziliaskopoulos, Athanasios & Wardell, Whitney, 2000. "An intermodal optimum path algorithm for multimodal networks with dynamic arc travel times and switching delays," European Journal of Operational Research, Elsevier, vol. 125(3), pages 486-502, September.
    12. Wu, Di & Yin, Yafeng & Lawphongpanich, Siriphong, 2011. "Pareto-improving congestion pricing on multimodal transportation networks," European Journal of Operational Research, Elsevier, vol. 210(3), pages 660-669, May.
    13. Lucia Bellenzier & J{o}rgen Vitting Andersen & Giulia Rotundo, 2016. "Contagion in the world's stock exchanges seen as a set of coupled oscillators," Papers 1602.07452, arXiv.org.
    14. Merrick, James H. & Weyant, John P., 2019. "On choosing the resolution of normative models," European Journal of Operational Research, Elsevier, vol. 279(2), pages 511-523.
    15. Codina, Esteve & Rosell, Francisca, 2017. "A heuristic method for a congested capacitated transit assignment model with strategies," Transportation Research Part B: Methodological, Elsevier, vol. 106(C), pages 293-320.
    16. Mortenson, Michael J. & Doherty, Neil F. & Robinson, Stewart, 2015. "Operational research from Taylorism to Terabytes: A research agenda for the analytics age," European Journal of Operational Research, Elsevier, vol. 241(3), pages 583-595.
    17. O'Keefe, Robert M., 2016. "Experimental behavioural research in operational research: What we know and what we might come to know," European Journal of Operational Research, Elsevier, vol. 249(3), pages 899-907.
    18. Parlakturk, Ali & Kumar, Sunil, 2004. "Self-Interested Routing in Queueing Networks," Research Papers 1782r, Stanford University, Graduate School of Business.
    19. Syntetos, Aris A. & Kholidasari, Inna & Naim, Mohamed M., 2016. "The effects of integrating management judgement into OUT levels: In or out of context?," European Journal of Operational Research, Elsevier, vol. 249(3), pages 853-863.
    20. Vasco F. Alves, 2019. "Pricing and waiting time decisions in a health care market with private and public provision," Journal of Applied Economics, Taylor & Francis Journals, vol. 22(1), pages 174-195, January.

    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:wsi:igtrxx:v:18:y:2016:i:01:n:s0219198916500018. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/igtr/igtr.shtml .

    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.