程序博弈中期望效用最大化者的安全帕累托改进
Safe Pareto Improvements for Expected Utility Maximizers in Program Games
AI总结:
本研究针对程序博弈中期望效用最大化智能体的协调失效问题,提出用具备再协商能力的程序构建安全帕累托改进,证明其能保证玩家获得有效结果中的最低收益且无法突破该界限。
摘要:
在诸如Chicken(懦夫博弈)这类混合动机协调问题中,智能体可能无法协调达成帕累托有效结果。安全帕累托改进(Safe Pareto improvements, SPIs)最初被提出用于缓解玩家对其委托代理的博弈行为缺乏概率信念时的协调失效问题:委托代理被指示采取行动,确保相对于默认行为实现帕累托改进。更一般地,SPI可被定义为策略剖面的变换,使得所有玩家在变换后的剖面下境况必然变好。本研究探讨了SPI在多大程度上能减少期望效用最大化智能体之间协调失效的负面影响。我们考虑玩家提交计算机程序的博弈,这些程序可依据彼此的代码调整决策,并利用这一特性,通过具备再协商能力的程序构建SPI。我们首先证明,在关于玩家信念的温和条件下,每个玩家始终倾向于使用再协商。其次我们证明,在类似假设下,每个玩家始终愿意至少再协商至其在任何有效结果中可获得的最低收益的水平。因此,主观最优策略能保证玩家至少获得这些收益,无需就特定帕累托改进达成协调。最后,我们证明再协商无法保证玩家获得超出该界限的任何改进。
英文摘要:
Agents in mixed-motive coordination problems such as Chicken may fail to coordinate on a Pareto-efficient outcome. Safe Pareto improvements (SPIs) were originally proposed to mitigate miscoordination in cases where players lack probabilistic beliefs as to how their delegates will play a game; delegates are instructed to behave so as to guarantee a Pareto improvement on how they would play by default. More generally, SPIs may be defined as transformations of strategy profiles such that all players are necessarily better off under the transformed profile. In this work, we investigate the extent to which SPIs can reduce downsides of miscoordination between expected utility-maximizing agents. We consider games in which players submit computer programs that can condition their decisions on each other's code, and use this property to construct SPIs using programs capable of renegotiation. We first show that under mild conditions on players' beliefs, each player always prefers to use renegotiation. Next, we show that under similar assumptions, each player always prefers to be willing to renegotiate at least to the point at which they receive the lowest payoff they can attain in any efficient outcome. Thus subjectively optimal play guarantees players at least these payoffs, without the need for coordination on specific Pareto improvements. Lastly, we prove that renegotiation does not guarantee players any improvements on this bound.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。