论文标题
有效查询合作概率承诺
Efficient Querying for Cooperative Probabilistic Commitments
论文作者
论文摘要
多基因系统可以将承诺用作一般协调基础架构的核心，从而支持合作和非合作互动。目标是保持一致的代理人，并且一个代理可以通过牺牲自己的一些奖励来帮助另一个代理人获得更大的奖励，应选择合作承诺以最大化其共同奖励。我们提出了一个解决问题的解决方案，即合作社如何通过查询精心选择的承诺选择来有效地找到（大致）最佳承诺。我们证明了代理值的结构属性是承诺规范参数的函数，并开发了一种贪婪的方法来构成具有可证明的近似值范围的查询，我们从经验上表明，这可以在缺乏我们见解的时间方法中找到几乎最佳的承诺。
Multiagent systems can use commitments as the core of a general coordination infrastructure, supporting both cooperative and non-cooperative interactions. Agents whose objectives are aligned, and where one agent can help another achieve greater reward by sacrificing some of its own reward, should choose a cooperative commitment to maximize their joint reward. We present a solution to the problem of how cooperative agents can efficiently find an (approximately) optimal commitment by querying about carefully-selected commitment choices. We prove structural properties of the agents' values as functions of the parameters of the commitment specification, and develop a greedy method for composing a query with provable approximation bounds, which we empirically show can find nearly optimal commitments in a fraction of the time methods that lack our insights require.
