2021/01/16 by Kalliopi Kastampolidou, Christos Papalitsas, Kastampolidou, Kalliopi +3
Computer Science · Decision Sciences · Economics, Econometrics and Finance · #Artificial Intelligence in Games #Auction Theory and Applications #FOS: Economics and business #Game Theory and Applications #Theoretical Economics (econ.TH) #econ.TH
paper · pdf · doi:10.48550/arxiv.2101.07760
32 pages
arxiv created 2021/01/16 · openalex publication_date 2021/01/16 · arxiv updated 2021/01/20 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The Kolkata Paise Restaurant Problem is a challenging game, in which n agents must decide where to have lunch during their lunch break. The game is very interesting because there are exactly n restaurants and each restaurant can accommodate only one agent. If two or more agents happen to choose the same restaurant, only one gets served and the others have to return back to work hungry. In this paper we tackle this problem from an entirely new angle. We abolish certain implicit assumptions, which allows us to propose a novel strategy that results in greater utilization for the restaurants. We emphasize the spatially distributed nature of our approach, which, for the first time, perceives the locations of the restaurants as uniformly distributed in the entire city area. This critical change in perspective has profound ramifications in the topological layout of the restaurants, which now makes it completely realistic to assume that every agent has a second chance. Every agent now may visit, in case of failure, more than one restaurants, within the predefined time constraints.