Statistics of the Kolkata Paise Restaurant Problem

Details Statistics of the Kolkata Paise Restaurant Problem Statistics of the Kolkata Paise Restaurant Problem

2010-03-10

arxiv.org/abs/1003.2103v2

New J Phys 12 (2010) 075033

Physics

Physics and Society

10 pages, 3 figs; accepted in New J Phys

Scientific paper

10.1088/1367-2630/12/7/075033

We study the dynamics of a few stochastic learning strategies for the 'Kolkata Paise Restaurant' problem, where N agents choose among N equally priced but differently ranked restaurants every evening such that each agent tries get to dinner in the best restaurant (each serving only one customer and the rest arriving there going without dinner that evening). We consider the learning strategies to be similar for all the agents and assume that each follow the same probabilistic or stochastic strategy dependent on the information of the past successes in the game. We show that some 'naive' strategies lead to much better utilization of the services than some relatively 'smarter' strategies. We also show that the service utilization fraction as high as 0.80 can result for a stochastic strategy, where each agent sticks to his past choice (independent of success achieved or not; with probability decreasing inversely in the past crowd size). The numerical results for utilization fraction of the services in some limiting cases are analytically examined.

Affiliated with

Also associated with

No associations

Rating

Statistics of the Kolkata Paise Restaurant Problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Statistics of the Kolkata Paise Restaurant Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Statistics of the Kolkata Paise Restaurant Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-342025