The distributed Kolkata Paise Restaurant game
Kalliopi Kastampolidou, Christos Papalitsas and Theodore Andronikos
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.
Year of publication: |
2022
|
---|---|
Authors: | Kastampolidou, Kalliopi ; Papalitsas, Christos ; Andronikos, Theodore |
Published in: |
Games. - Basel : MDPI, ISSN 2073-4336, ZDB-ID 2527220-2. - Vol. 13.2022, 3, Art.-No. 33, p. 1-21
|
Subject: | Kolkata Paise Restaurant Problem | metaheuristics | optimization | probabilistic analysis | TSP | utilization | Wiederholte Spiele | Repeated games | Theorie | Theory | Ökonophysik | Econophysics | Stochastisches Spiel | Stochastic game |
Saved in:
freely available
Saved in favorites
Similar items by subject
-
Kolkata paise restaurant problem : an introduction
Ghosh, Asim, (2013)
-
Chakrabarti, Bikas K., (2017)
-
Chakrabarti, Bikas K., (2017)
- More ...
Similar items by person
-
Quantum Tapsilou : a quantum game inspired by the traditional Greek coin tossing game tapsilou
Kastampolidou, Kalliopi, (2023)
- More ...