Kolkata Paise Restaurant Problem
(Redirected from Draft:Kolkata Paise Restaurant Problem)
 | This article is an orphan, as no other articles link to it. Please introduce links to this page from related articles; try the Find link tool for suggestions. (June 2025) |
The Kolkata Paise Restaurant Problem (KPR) is a mathematical game surrounding resource allocation. The problem centers around n agents identifying a place to eat during lunch.[1] There are n locations they can choose from, although if two or more agents pick the same one then only a single agent will eat.[2] The name Kolkata comes from the Indian city named Kolkata,[1] and the name Paise from the smallest Indian coin.[3]
References
[edit]- ^ a b Kastampolidou, Kalliopi; Papalitsas, Christos; Andronikos, Theodore (2022-04-20). "The Distributed Kolkata Paise Restaurant Game". Games. 13 (3): 33. doi:10.3390/g13030033. ISSN 2073-4336.
- ^ Harlalka, Akshat; Belmonte, Andrew; Griffin, Christopher (2023). "Stability of dining clubs in the Kolkata Paise Restaurant Problem with and without cheating". Physica A: Statistical Mechanics and its Applications. 620: 128767. doi:10.1016/j.physa.2023.128767.
- ^ Chakrabarti, Bikas K.; Rajak, Atanu; Sinha, Antika (2022-05-26). "Stochastic Learning in Kolkata Paise Restaurant Problem: Classical and Quantum Strategies". Frontiers in Artificial Intelligence. 5. doi:10.3389/frai.2022.874061. ISSN 2624-8212. PMC 9181993. PMID 35692940.
 | This mathematics-related article is a stub. You can help Wikipedia by expanding it. |