IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2607.01822.html

Congestion-Based Slot Pricing in a Railway Auction Game

Author

Listed:
  • Bill Roungas
  • Sebastiaan Meijer

Abstract

We present a multi-agent system for studying the allocation of discrete, congested resources among heterogeneous strategic agents, motivated by the problem of railway slot allocation under deregulation. Multiple operator-agents, differing in size and capacity, interact through a shared auction mechanism over repeated rounds under time-constrained decision-making. The mechanism combines a congestion-based base price that increases with aggregate demand with an asymmetric corrective adjustment that penalises the agent requesting the most slots and rewards the agent requesting the fewest, and is designed to mitigate strategic dominance by large agents while preserving transparency and congestion sensitivity. We formulate the interaction as a repeated game with incomplete information and implement the system as a real-time, web-based multi-agent environment in which human participants control individual agents and observe live marginal-cost and competitor feedback. We report exploratory observations from two structured sessions with domain experts acting as operator-agents. The congestion mechanism responds to aggregate demand as designed and the corrective incentives are actively triggered, but agents representing large operators persist with high-request strategies despite the penalty, suggesting that corrective pricing is necessary but not sufficient to neutralise strategic dominance in this multi-agent setting. A post-session debrief indicates that participants' decisions were driven by the assumed agent role rather than personal disposition, and provides qualitative support for strategic motives, such as preserving market presence and raising rivals' costs, operating alongside short-term profit maximisation. We discuss implications for multi-agent mechanism design under asymmetric budgets and outline directions for analytical validation and larger-scale multi-agent experiments.

Suggested Citation

  • Bill Roungas & Sebastiaan Meijer, 2026. "Congestion-Based Slot Pricing in a Railway Auction Game," Papers 2607.01822, arXiv.org.
  • Handle: RePEc:arx:papers:2607.01822
    as

    Download full text from publisher

    File URL: https://arxiv.org/pdf/2607.01822
    File Function: Latest version
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Bill Roungas & Femke Bekius & Alexander Verbraeck & Sebastiaan Meijer, 2021. "Improving the decision-making qualities of gaming simulations," Journal of Simulation, Taylor & Francis Journals, vol. 15(3), pages 177-190, July.
    2. R. Borndörfer & M. Grötschel & S. Lukac & K. Mitusch & T. Schlechte & S. Schultz & A. Tanner, 2006. "An Auction Approach to Railway Slot Allocation," Competition and Regulation in Network Industries, Intersentia, vol. 7(2), pages 163-197, June.
    3. Harrod, Steven, 2013. "Auction pricing of network access for North American railways," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 49(1), pages 176-189.
    4. Robert J. Aumann, 1995. "Repeated Games with Incomplete Information," MIT Press Books, The MIT Press, edition 1, volume 1, number 0262011476, December.
    5. Bill Roungas & Femke Bekius & Sebastiaan Meijer, 2019. "The Game Between Game Theory and Gaming Simulations: Design Choices," Simulation & Gaming, , vol. 50(2), pages 180-201, April.
    6. 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.
    Full references (including those not matched with items on IDEAS)

    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. Talebian, Ahmadreza & Zou, Bo & Peivandi, Ahmad, 2018. "Capacity allocation in vertically integrated rail systems: A bargaining approach," Transportation Research Part B: Methodological, Elsevier, vol. 107(C), pages 167-191.
    3. Koessler, Frederic & Laclau, Marie & Renault, Jérôme & Tomala, Tristan, 2022. "Long information design," Theoretical Economics, Econometric Society, vol. 17(2), May.
    4. Dinah Rosenberg & Eilon Solan & Nicolas Vieille, 2003. "The MaxMin value of stochastic games with imperfect monitoring," International Journal of Game Theory, Springer;Game Theory Society, vol. 32(1), pages 133-150, December.
    5. Xiaochi Wu, 2022. "Existence of value for a differential game with asymmetric information and signal revealing," International Journal of Game Theory, Springer;Game Theory Society, vol. 51(1), pages 213-247, March.
    6. Feng, Fenling & Zhang, Jiaqi & Liu, Chengguang, 2023. "Integrated pricing mechanism of China Railway Express whole-process logistics based on the Stackelberg game," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 609(C).
    7. Dirk Bergemann & Stephen Morris, 2019. "Information Design: A Unified Perspective," Journal of Economic Literature, American Economic Association, vol. 57(1), pages 44-95, March.
    8. Andrew Kosenko, 2020. "Mediated Persuasion," Papers 2012.00098, arXiv.org, revised Dec 2020.
    9. Xiaochi Wu, 2021. "Differential Games with Incomplete Information and with Signal Revealing: The Symmetric Case," Dynamic Games and Applications, Springer, vol. 11(4), pages 863-891, December.
    10. Vida, Péter & Āzacis, Helmuts, 2013. "A detail-free mediator," Games and Economic Behavior, Elsevier, vol. 81(C), pages 101-115.
    11. Frédéric Koessler & Françoise Forges, 2008. "Multistage Communication With And Without Verifiable Types," International Game Theory Review (IGTR), World Scientific Publishing Co. Pte. Ltd., vol. 10(02), pages 145-164.
    12. Marie Laclau & Tristan Tomala, 2016. "Repeated games with public information revisited," PSE Working Papers hal-01285326, HAL.
    13. Makoto Shimoji, 2016. "Rationalizable Persuasion," Discussion Papers 16/08, Department of Economics, University of York.
    14. Jacobovic, Royi & Levy, Yehuda John & Solan, Eilon, 2026. "Bayesian games with nested information," Theoretical Economics, Econometric Society, vol. 21(1), January.
    15. , H. & ,, 2016. "Approximate efficiency in repeated games with side-payments and correlated signals," Theoretical Economics, Econometric Society, vol. 11(1), January.
    16. Andreas Haupt & Zoe Hitzig, 2023. "Opaque Contracts," Papers 2301.13404, arXiv.org.
    17. Elliot Lipnowski & Doron Ravid & Denis Shishkin, 2024. "Perfect Bayesian Persuasion," Papers 2402.06765, arXiv.org.
    18. Dirk Bergemann & Benjamin Brooks & Stephen Morris, 2015. "The Limits of Price Discrimination," American Economic Review, American Economic Association, vol. 105(3), pages 921-957, March.
    19. Golosov, Mikhail & Skreta, Vasiliki & Tsyvinski, Aleh & Wilson, Andrea, 2014. "Dynamic strategic information transmission," Journal of Economic Theory, Elsevier, vol. 151(C), pages 304-341.
    20. Abraham Neyman & Sylvain Sorin, 2010. "Repeated games with public uncertain duration process," International Journal of Game Theory, Springer;Game Theory Society, vol. 39(1), pages 29-52, March.

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:arx:papers:2607.01822. 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: arXiv administrators (email available below). General contact details of provider: https://arxiv.org/ .

    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.