arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0905.3267cs.GTphysics.soc-ph
收藏

一类一致学习策略限制下的Kolkata Paise餐馆问题

Kolkata Paise Restaurant Problem in Some Uniform Learning Strategy Limits

Asim Ghosh, Anindya Sundar Chakrabarti, Bikas K. Chakrabarti

摘要:

我们研究了一些统一的学习策略限制的动态或概率版本的“加尔各答Paise餐厅”的问题,其中N代理选择N个价格相同,但排名不同的餐厅每天晚上,这样每个代理可以得到最好的排名餐厅(每个服务只有一个客户和其余到达那里去没有晚餐,晚上)。我们认为学习是统一的代理之间,并假设每个遵循相同的概率策略依赖于过去的成功在游戏中的信息。在某些极限情况下的餐厅利用的数值结果进行了分析研究。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑