IDEAS home Printed from https://ideas.repec.org/a/eee/transa/v67y2014icp175-187.html
   My bibliography  Save this article

Use of combinatorial auctions in the railway industry: Can the “invisible hand” draw the railway timetable?

Author

Listed:
  • Perennes, Patricia

Abstract

Rail capacity is currently administratively allocated in Europe, whereas the economic literature has often contemplated the opportunity of introducing market mechanisms, auctions in particular, into this industry. This article tries to fill the gap between practice and theory. It first describes the properties of rail capacity (rigidity and non-homogeneity) and shows that because of its very nature, this capacity must be allocated through combinatorial auctions. As identified by the economic literature, using combinatorial auctions introduces a lot of complexity (winner determination and information burden) into the allocation process. To deal with this complexity, some form of centralized planning is necessary to design the right market mechanisms and to allocate capacity. This could have strong consequences on the current deregulation process.

Suggested Citation

  • Perennes, Patricia, 2014. "Use of combinatorial auctions in the railway industry: Can the “invisible hand” draw the railway timetable?," Transportation Research Part A: Policy and Practice, Elsevier, vol. 67(C), pages 175-187.
    • Handle: RePEc:eee:transa:v:67:y:2014:i:c:p:175-187
    DOI: 10.1016/j.tra.2014.07.002
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0965856414001670
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.tra.2014.07.002?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. Brewer, Paul J. & Plott, Charles R., 1996. "A binary conflict ascending price (BICAP) mechanism for the decentralized allocation of the right to use railroad tracks," International Journal of Industrial Organization, Elsevier, vol. 14(6), pages 857-886, October.
    2. Aleksandar Pekev{c} & Michael H. Rothkopf, 2003. "Combinatorial Auction Design," Management Science, INFORMS, vol. 49(11), pages 1485-1503, November.
    3. Blumrosen, Liad & Nisan, Noam, 2010. "Informational limitations of ascending combinatorial auctions," Journal of Economic Theory, Elsevier, vol. 145(3), pages 1203-1223, May.
    4. Künneke, Rolf & Groenewegen, John & Ménard, Claude, 2010. "Aligning modes of organization with technology: Critical transactions in the reform of infrastructures," Journal of Economic Behavior & Organization, Elsevier, vol. 75(3), pages 494-505, September.
    5. U. Brännlund & P. O. Lindberg & A. Nõu & J.-E. Nilsson, 1998. "Railway Timetabling Using Lagrangian Relaxation," Transportation Science, INFORMS, vol. 32(4), pages 358-369, November.
    6. Stern, J. & Turvey, R., 2003. "Auctions of capacity in network industries," Utilities Policy, Elsevier, vol. 11(1), pages 1-8, March.
    7. Michael H. Rothkopf & Aleksandar Pekev{c} & Ronald M. Harstad, 1998. "Computationally Manageable Combinational Auctions," Management Science, INFORMS, vol. 44(8), pages 1131-1147, August.
    8. Chris Nash, 2005. "Rail Infrastructure Charges in Europe," Journal of Transport Economics and Policy, University of Bath, vol. 39(3), pages 259-278, September.
    9. Gibson, Stephen, 2003. "Allocation of capacity in the rail industry," Utilities Policy, Elsevier, vol. 11(1), pages 39-42, March.
    10. Harrod, Steven & Schlechte, Thomas, 2013. "A direct comparison of physical block occupancy versus timed block occupancy in train timetabling formulations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 54(C), pages 50-66.
    11. Quinet, Emile, 2003. "Short term adjustments in rail activity: the limited role of infrastructure charges," Transport Policy, Elsevier, vol. 10(1), pages 73-79, January.
    12. Nilsson, Jan-Eric, 1999. "Allocation of track capacity: Experimental evidence on the use of priority auctioning in the railway industry," International Journal of Industrial Organization, Elsevier, vol. 17(8), pages 1139-1162, November.
    13. Alex Landex, 2009. "Evaluation of Railway Networks with Single Track Operation Using the UIC 406 Capacity Method," Networks and Spatial Economics, Springer, vol. 9(1), pages 7-23, March.
    14. Nisan, Noam & Segal, Ilya, 2006. "The communication requirements of efficient allocations and supporting prices," Journal of Economic Theory, Elsevier, vol. 129(1), pages 192-224, July.
    15. S.J. Rassenti & V.L. Smith & R.L. Bulfin, 1982. "A Combinatorial Auction Mechanism for Airport Time Slot Allocation," Bell Journal of Economics, The RAND Corporation, vol. 13(2), pages 402-417, Autumn.
    16. Nilsson, Jan-Eric, 2002. "Towards a welfare enhancing process to manage railway infrastructure access," Transportation Research Part A: Policy and Practice, Elsevier, vol. 36(5), pages 419-436, June.
    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. Broman, Emanuel & Eliasson, Jonas, 2019. "Welfare effects of open access competition on railway markets," Transportation Research Part A: Policy and Practice, Elsevier, vol. 129(C), pages 72-91.
    2. Stojadinović, Nikola & Bošković, Branislav & Trifunović, Dejan & Janković, Slađana, 2019. "Train path congestion management: Using hybrid auctions for decentralized railway capacity allocation," Transportation Research Part A: Policy and Practice, Elsevier, vol. 129(C), pages 123-139.
    3. Börjesson, Maria & Rushid, Ajsuna R. & Liu, Chengxi, 2021. "The impact of optimal rail access charges on frequencies and fares," Economics of Transportation, Elsevier, vol. 26.

    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. Stojadinović, Nikola & Bošković, Branislav & Trifunović, Dejan & Janković, Slađana, 2019. "Train path congestion management: Using hybrid auctions for decentralized railway capacity allocation," Transportation Research Part A: Policy and Practice, Elsevier, vol. 129(C), pages 123-139.
    2. Nilsson, Jan-Eric, 2012. "Congestion and scarcity in scheduled transport modes," Working papers in Transport Economics 2012:25, CTS - Centre for Transport Studies Stockholm (KTH and VTI).
    3. Avenali, Alessandro, 2009. "Exploring the VCG mechanism in combinatorial auctions: The threshold revenue and the threshold-price rule," European Journal of Operational Research, Elsevier, vol. 199(1), pages 262-275, November.
    4. Jawad Abrache & Teodor Crainic & Michel Gendreau & Monia Rekik, 2007. "Combinatorial auctions," Annals of Operations Research, Springer, vol. 153(1), pages 131-164, September.
    5. Nilsson, Jan-Eric, 2002. "Towards a welfare enhancing process to manage railway infrastructure access," Transportation Research Part A: Policy and Practice, Elsevier, vol. 36(5), pages 419-436, June.
    6. Paul J. Brewer & Charles R. Plott, 2002. "A Decentralized, Smart Market Solution to a Class of Back-Haul Transportation Problems: Concept and Experimental Test Beds," Interfaces, INFORMS, vol. 32(5), pages 13-36, October.
    7. Bourbeau, Benoit & Gabriel Crainic, Teodor & Gendreau, Michel & Robert, Jacques, 2005. "Design for optimized multi-lateral multi-commodity markets," European Journal of Operational Research, Elsevier, vol. 163(2), pages 503-529, June.
    8. Sayee Srinivasan, 2002. "Trading Portfolios Electronically – An Experimental Approach," Netnomics, Springer, vol. 4(1), pages 39-71, March.
    9. Zhiling Guo & Gary J. Koehler & Andrew B. Whinston, 2012. "A Computational Analysis of Bundle Trading Markets Design for Distributed Resource Allocation," Information Systems Research, INFORMS, vol. 23(3-part-1), pages 823-843, September.
    10. Richard Li-Yang Chen & Shervin AhmadBeygi & Amy Cohn & Damian R. Beil & Amitabh Sinha, 2009. "Solving Truckload Procurement Auctions Over an Exponential Number of Bundles," Transportation Science, INFORMS, vol. 43(4), pages 493-510, November.
    11. Ait Ali, Abderrahman & Warg, Jennifer & Eliasson, Jonas, 2020. "Pricing commercial train path requests based on societal costs," Transportation Research Part A: Policy and Practice, Elsevier, vol. 132(C), pages 452-464.
    12. Benoît Bourbeau & Teodor Gabriel Crainic & Michel Gendreau & Jacques Robert, 2003. "Design for Optimized Multi-Lateral Multi-Commodity Markets," CIRANO Working Papers 2003s-36, CIRANO.
    13. Goossens, D.R. & Müller, R.J. & Spieksma, F.C.R., 2007. "Matrix bids in combinatorial auctions: expressiveness and micro-economic properties," Research Memorandum 016, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    14. Ronald M. Harstad & Aleksandar Saša Pekeč, 2008. "Relevance to Practice and Auction Theory: A Memorial Essay for Michael Rothkopf," Interfaces, INFORMS, vol. 38(5), pages 367-380, October.
    15. Dries R. Goossens & Rudolf Müller & Frits C. R. Spieksma, 2010. "Algorithms for Recognizing Economic Properties in Matrix Bid Combinatorial Auctions," INFORMS Journal on Computing, INFORMS, vol. 22(3), pages 339-352, August.
    16. Gediminas Adomavicius & Alok Gupta & Mochen Yang, 2022. "Bidder Support in Multi-item Multi-unit Continuous Combinatorial Auctions: A Unifying Theoretical Framework," Information Systems Research, INFORMS, vol. 33(4), pages 1174-1195, December.
    17. Drexl, Andreas & Jørnsten, Kurt & Knof, Diether, 2007. "Column aggregation-based pricing combinatorial auctions," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 624, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    18. Muñoz, Juan Carlos & Molina, Diego, 2009. "A multi-unit tender award process: The case of Transantiago," European Journal of Operational Research, Elsevier, vol. 197(1), pages 307-311, August.
    19. Aleksandar Pekev{c} & Michael H. Rothkopf, 2003. "Combinatorial Auction Design," Management Science, INFORMS, vol. 49(11), pages 1485-1503, November.
    20. Wellman, Michael P. & Walsh, William E. & Wurman, Peter R. & MacKie-Mason, Jeffrey K., 2001. "Auction Protocols for Decentralized Scheduling," Games and Economic Behavior, Elsevier, vol. 35(1-2), pages 271-303, April.

    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:eee:transa:v:67:y:2014:i:c:p:175-187. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/547/description#description .

    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.