|
| | | | |
| | | |
| Stat |
Members: 3645
Articles: 2'504'928
Articles rated: 2609
26 April 2024 |
|
| | | | |
|
Article overview
| |
|
|
Statistics of the Kolkata Paise Restaurant Problem | | Asim Ghosh
; Arnab Chaterjee
; Manipushpak Mitra
; Bikas K Chakrabarti
; | | Date: |
10 Mar 2010 | | Abstract: | 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. | | Source: | arXiv, 1003.2103 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
|
News, job offers and information for researchers and scientists:
| |
REGISTER