IDEAS home Printed from https://ideas.repec.org/a/gam/jgames/v13y2022i3p33-d797524.html
   My bibliography  Save this article

The Distributed Kolkata Paise Restaurant Game

Author

Listed:
  • Kalliopi Kastampolidou

    (Department of Informatics, Ionian University, 49100 Corfu, Greece
    These authors contributed equally to this work.)

  • Christos Papalitsas

    (Department of Informatics, Ionian University, 49100 Corfu, Greece
    These authors contributed equally to this work.)

  • Theodore Andronikos

    (Department of Informatics, Ionian University, 49100 Corfu, Greece
    These authors contributed equally to this work.)

Abstract

The Kolkata Paise Restaurant Problem is a challenging game in which n agents decide where to have lunch during their break. The game is not trivial because there are exactly n restaurants, and each restaurant can accommodate only one agent. We study this problem from a new angle and propose a novel strategy that results in greater utilization. Adopting a spatially distributed approach where the restaurants are uniformly distributed in the entire city area makes it possible for every agent to visit multiple restaurants. For each agent, the situation resembles that of the iconic traveling salesman, who must compute an optimal route through n cities. We rigorously prove probabilistic formulas that confirm the advantages of this policy and the increase in utilization. The derived equations generalize formulas that were previously known in the literature, which can be seen as special cases of our results.

Suggested Citation

  • Kalliopi Kastampolidou & Christos Papalitsas & Theodore Andronikos, 2022. "The Distributed Kolkata Paise Restaurant Game," Games, MDPI, vol. 13(3), pages 1-21, April.
    • Handle: RePEc:gam:jgames:v:13:y:2022:i:3:p:33-:d:797524
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2073-4336/13/3/33/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2073-4336/13/3/33/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Ghosh, Diptesh & Chakrabarti, Anindya S., 2017. "Emergence of distributed coordination in the Kolkata Paise Restaurant problem with finite information," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 483(C), pages 16-24.
    2. Theodore Andronikos & Alla Sirokofskich, 2021. "The Connection between the PQ Penny Flip Game and the Dihedral Groups," Mathematics, MDPI, vol. 9(10), pages 1-35, May.
    3. Shubham Agarwal & Diptesh Ghosh & Anindya S. Chakrabarti, 2016. "Self-organization in a distributed coordination game through heuristic rules," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 89(12), pages 1-10, December.
    4. Schittekat, Patrick & Kinable, Joris & Sörensen, Kenneth & Sevaux, Marc & Spieksma, Frits & Springael, Johan, 2013. "A metaheuristic for the school bus routing problem with bus stop selection," European Journal of Operational Research, Elsevier, vol. 229(2), pages 518-528.
    5. Frédéric Abergel & Anirban Chakraborti & B.K. Chakrabarti & Asim Ghosh, 2013. "Econophysics of systemic risk and network dynamics," Post-Print hal-00872397, HAL.
    6. Milchtaich, Igal, 1996. "Congestion Games with Player-Specific Payoff Functions," Games and Economic Behavior, Elsevier, vol. 13(1), pages 111-124, March.
    7. Chakrabarti, Anindya Sundar & Chakrabarti, Bikas K. & Chatterjee, Arnab & Mitra, Manipushpak, 2009. "The Kolkata Paise Restaurant problem and resource utilization," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 388(12), pages 2420-2426.
    8. Rego, César & Gamboa, Dorabela & Glover, Fred & Osterman, Colin, 2011. "Traveling salesman problem heuristics: Leading methods, implementations and latest advances," European Journal of Operational Research, Elsevier, vol. 211(3), pages 427-441, June.
    9. Theodore Andronikos & Alla Sirokofskich & Kalliopi Kastampolidou & Magdalini Varvouzou & Konstantinos Giannakis & Alexander Singh, 2018. "Finite Automata Capturing Winning Sequences for All Possible Variants of the PQ Penny Flip Game," Mathematics, MDPI, vol. 6(2), pages 1-26, February.
    10. Bikas K. Chakrabarti, 2007. "Kolkata Restaurant Problem as a generalised El Farol Bar Problem," Papers 0705.2098, arXiv.org.
    11. Dominique Feillet & Pierre Dejax & Michel Gendreau, 2005. "Traveling Salesman Problems with Profits," Transportation Science, INFORMS, vol. 39(2), pages 188-205, May.
    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. Qi-Neng Zhou & Ye Yuan & Dong Yang & Jing Zhang, 2022. "An Advanced Multi-Agent Reinforcement Learning Framework of Bridge Maintenance Policy Formulation," Sustainability, MDPI, vol. 14(16), pages 1-18, August.

    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. Kalliopi Kastampolidou & Christos Papalitsas & Theodore Andronikos, 2021. "DKPRG or how to succeed in the Kolkata Paise Restaurant gamevia TSP," Papers 2101.07760, arXiv.org.
    2. Anindya S. Chakrabarti & Diptesh Ghosh, 2019. "Emergence of anti-coordination through reinforcement learning in generalized minority games," Journal of Economic Interaction and Coordination, Springer;Society for Economic Science with Heterogeneous Interacting Agents, vol. 14(2), pages 225-245, June.
    3. Vee-Liem Saw & Lock Yue Chew, 2020. "No-boarding buses: Synchronisation for efficiency," PLOS ONE, Public Library of Science, vol. 15(3), pages 1-34, March.
    4. Alessandro Hill & Roberto Baldacci & Edna Ayako Hoshino, 2019. "Capacitated ring arborescence problems with profits," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(2), pages 357-389, June.
    5. Kiran Sharma & Anamika & Anindya S. Chakrabarti & Anirban Chakraborti & Sujoy Chakravarty, 2017. "The Saga of KPR: Theoretical and Experimental developments," Papers 1712.06358, arXiv.org.
    6. Liwei Zeng & Sunil Chopra & Karen Smilowitz, 2019. "The Covering Path Problem on a Grid," Transportation Science, INFORMS, vol. 53(6), pages 1656-1672, November.
    7. Arnold, Tone & Wooders, Myrna, 2002. "Dynamic Club Formation with Coordination," Economic Research Papers 269414, University of Warwick - Department of Economics.
    8. Herminia I. Calvete & Carmen Galé & José A. Iranzo & Paolo Toth, 2020. "A Partial Allocation Local Search Matheuristic for Solving the School Bus Routing Problem with Bus Stop Selection," Mathematics, MDPI, vol. 8(8), pages 1-20, July.
    9. Kobeaga, Gorka & Rojas-Delgado, Jairo & Merino, María & Lozano, Jose A., 2024. "A revisited branch-and-cut algorithm for large-scale orienteering problems," European Journal of Operational Research, Elsevier, vol. 313(1), pages 44-68.
    10. Hideo Konishi, 2004. "Uniqueness of User Equilibrium in Transportation Networks with Heterogeneous Commuters," Transportation Science, INFORMS, vol. 38(3), pages 315-330, August.
    11. Li, Yuan & Chen, Haoxun & Prins, Christian, 2016. "Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests," European Journal of Operational Research, Elsevier, vol. 252(1), pages 27-38.
    12. Hernan Caceres & Rajan Batta & Qing He, 2017. "School Bus Routing with Stochastic Demand and Duration Constraints," Transportation Science, INFORMS, vol. 51(4), pages 1349-1364, November.
    13. Milchtaich, Igal, 2009. "Weighted congestion games with separable preferences," Games and Economic Behavior, Elsevier, vol. 67(2), pages 750-757, November.
    14. Aliyev, Denis A. & Zirbel, Craig L., 2023. "Seriation using tree-penalized path length," European Journal of Operational Research, Elsevier, vol. 305(2), pages 617-629.
    15. Racha El-Hajj & Rym Nesrine Guibadj & Aziz Moukrim & Mehdi Serairi, 2020. "A PSO based algorithm with an efficient optimal split procedure for the multiperiod vehicle routing problem with profit," Annals of Operations Research, Springer, vol. 291(1), pages 281-316, August.
    16. Lancia, Giuseppe & Vidoni, Paolo, 2020. "Finding the largest triangle in a graph in expected quadratic time," European Journal of Operational Research, Elsevier, vol. 286(2), pages 458-467.
    17. Azi, Nabila & Gendreau, Michel & Potvin, Jean-Yves, 2010. "An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles," European Journal of Operational Research, Elsevier, vol. 202(3), pages 756-763, May.
    18. Sebastian Henn & André Scholz & Meike Stuhlmann & Gerhard Wäscher, 2015. "A New Mathematical Programming Formulation for the Single-Picker Routing Problem in a Single-Block Layout," FEMM Working Papers 150005, Otto-von-Guericke University Magdeburg, Faculty of Economics and Management.
    19. Bavly, Gilad & Heller, Yuval & Schreiber, Amnon, 2022. "Social welfare in search games with asymmetric information," Journal of Economic Theory, Elsevier, vol. 202(C).
    20. Darryl Seale & Amnon Rapoport, 2000. "Elicitation of Strategy Profiles in Large Group Coordination Games," Experimental Economics, Springer;Economic Science Association, vol. 3(2), pages 153-179, October.

    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:gam:jgames:v:13:y:2022:i:3:p:33-:d:797524. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.