Kolkata Paise Restaurant Problem in Some Uniform Learning Strategy Limits

Details Kolkata Paise Restaurant Problem in Some Uniform Learning Strategy Limits Kolkata Paise Restaurant Problem in Some Uniform Learning Strategy Limits

2009-05-20

arxiv.org/abs/0905.3267v1

Computer Science

Computer Science and Game Theory

to be published in "Econophysics & Economics of Games, Social Choices & Quantitative Techniques", Proc. Econophys-Kolkata IV,

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Kolkata Paise Restaurant Problem in Some Uniform Learning Strategy Limits 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 Kolkata Paise Restaurant Problem in Some Uniform Learning Strategy Limits, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Kolkata Paise Restaurant Problem in Some Uniform Learning Strategy Limits will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-242662