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

在 Kolkata Paise Restaurant 问题中实现最优时间内的学习或收敛以获得最大利用率

Achieving Maximum Utilization in Optimal Time for Learning or Convergence in the Kolkata Paise Restaurant Problem

Aniruddha Biswas, Antika Sinha, Bikas K. Chakrabarti

AI总结:

本文研究 Kolkata Paise Restaurant 问题中智能体的最优学习与利用率,提出修改的贪婪避开人群策略,证明单步记忆策略无法在有限时间内实现完全利用,最大利用率约为80%。

摘要:

KPR 智能体的目标是在最短(学习)时间内自我学习,以获得最大的成功率或利用率概率($f$)。独裁者可以通过要求所有人排成一队并前往各自的餐厅,轻松地在零时间内解决问题,实现 $f = 1$,这不会产生任何波动,并且从第一天起就实现充分利用(收敛时间 $τ= 0$)。已有研究表明,如果每个智能体随机选择餐厅,则在零时间($τ= 0$)内 $f = 1 - e^{-1} \simeq 0.63$(其中 $e \simeq 2.718$ 表示欧拉数)。在仅有关于智能体昨天所访问餐厅拥挤程度的信息的情况下(此处研究的其余策略也作此假设),避开人群(CA)策略可以提供更高的 $f$ 值,但 $τ$ 也会更高。对修改后的学习策略的几项数值研究实际上表明,当 $α\to 0$ 时,$f = 1 - α$ 的值会增加,且 $τ\sim 1/α$。我们在此使用 Monte Carlo 技术展示,修改后的贪婪避开人群(GCA)策略可以确保在收敛时间 $τ\simeq eN$ 内实现充分利用($f = 1$),当然,对于更大的收敛时间具有非零概率。所有这些观察结果表明,具有个体单步记忆的策略永远无法在有限的收敛时间内集体实现充分利用($f = 1$),并且也许即使当顾客或餐厅的数量 $N$ 趋于无穷大时,在数量级为十的最优时间 $τ$ 内,所能实现的最大可能利用率约为百分之八十($f \simeq 0.80$)。

英文摘要:

The objective of the KPR agents are to learn themselves in the minimum (learning) time to have maximum success or utilization probability ($f$). A dictator can easily solve the problem with $f = 1$ in no time, by asking every one to form a queue and go to the respective restaurant, resulting in no fluctuation and full utilization from the first day (convergence time $τ= 0$). It has already been shown that if each agent chooses randomly the restaurants, $f = 1 - e^{-1} \simeq 0.63$ (where $e \simeq 2.718$ denotes the Euler number) in zero time ($τ= 0$). With the only available information about yesterday's crowd size in the restaurant visited by the agent (as assumed for the rest of the strategies studied here), the crowd avoiding (CA) strategies can give higher values of $f$ but also of $τ$. Several numerical studies of modified learning strategies actually indicated increased value of $f = 1 - α$ for $α\to 0$, with $τ\sim 1/α$. We show here using Monte Carlo technique, a modified Greedy Crowd Avoiding (GCA) Strategy can assure full utilization ($f = 1$) in convergence time $τ\simeq eN$, with of course non-zero probability for an even larger convergence time. All these observations suggest that the strategies with single step memory of the individuals can never collectively achieve full utilization ($f = 1$) in finite convergence time and perhaps the maximum possible utilization that can be achieved is about eighty percent ($f \simeq 0.80$) in an optimal time $τ$ of order ten, even when $N$ the number of customers or of the restaurants goes to infinity.

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

↑