2009/05/20 by Asim Ghosh, Ghosh, Asim, Anindya S. Chakrabarti +4
Computer Science · Physics and Astronomy · Social Sciences · #Computer Science and Game Theory (cs.GT) #FOS: Computer and information sciences #FOS: Physical sciences #Physics and Society (physics.soc-ph) #Social and Economic Development in India #cs.GT #physics.soc-ph
paper · pdf · doi:10.48550/arxiv.0905.3267
to be published in "Econophysics & Economics of Games, Social Choices & Quantitative Techniques", Proc. Econophys-Kolkata IV, Springer, Milan (2009)
arxiv created 2009/05/20 · openalex publication_date 2009/05/20 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We study the dynamics of some uniform learning strategy limits or a probabilistic version of the "Kolkata Paise Restaurant" problem, where N agents choose among N equally priced but differently ranked restaurants every evening such that each agent can get dinner in the best possible ranked restaurant (each serving only one customer and the rest arriving there going without dinner that evening). We consider the learning to be uniform among the agents and assume that each follow the same probabilistic strategy dependent on the information of the past successes in the game. The numerical results for utilization of the restaurants in some limiting cases are analytically examined.