arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2408.10074cs.GTcs.AIcs.MA
收藏

面向多智能体均衡设计的奖励机综合(完整版)

Synthesis of Reward Machines for Multi-Agent Equilibrium Design (Full Version)

Heriot-Watt University(赫瑞瓦特大学);Sapienza University of Rome(罗马大学)

Muhammad Najib, Giuseppe Perelli

AI总结:

本文研究多智能体均衡设计问题,提出用奖励机构建动态激励结构,定义收益改进问题的强弱变体,证明其复杂度及多项式时间求解方法,并给出奖励机的综合方案。

摘要:

机制设计是一种成熟的博弈论范式,用于设计博弈以达成预期结果。本文研究一个与之密切相关但截然不同的概念——均衡设计。与机制设计不同,均衡设计中设计者的权限受到更多限制:她只能修改给定博弈中的激励结构以实现特定结果,而无法从零创建整个博弈。\n我们利用被称为奖励机的动态激励结构来研究均衡设计问题。我们采用加权并发博弈结构作为博弈模型,将(参与者和设计者的)目标定义为平均收益目标。我们展示了如何利用奖励机表示动态激励,这类激励以优化设计者目标的方式分配奖励。\n我们还提出了该框架下的核心决策问题——收益改进问题。该问题本质上是询问是否存在一种动态激励(由某个奖励机表示),能将设计者的收益提升超过给定阈值。我们提出了该问题的两个变体:强变体和弱变体,并证明二者都可通过配备NP神谕的图灵机在多项式时间内求解。此外,我们还证实这些变体要么是NP难的,要么是coNP难的。最后,我们展示了若对应奖励机存在,如何对其进行综合。

英文摘要:

Mechanism design is a well-established game-theoretic paradigm for designing games to achieve desired outcomes. This paper addresses a closely related but distinct concept, equilibrium design. Unlike mechanism design, the designer's authority in equilibrium design is more constrained; she can only modify the incentive structures in a given game to achieve certain outcomes without the ability to create the game from scratch. We study the problem of equilibrium design using dynamic incentive structures, known as reward machines. We use weighted concurrent game structures for the game model, with goals (for the players and the designer) defined as mean-payoff objectives. We show how reward machines can be used to represent dynamic incentives that allocate rewards in a manner that optimises the designer's goal. We also introduce the main decision problem within our framework, the payoff improvement problem. This problem essentially asks whether there exists a dynamic incentive (represented by some reward machine) that can improve the designer's payoff by more than a given threshold value. We present two variants of the problem: strong and weak. We demonstrate that both can be solved in polynomial time using a Turing machine equipped with an NP oracle. Furthermore, we also establish that these variants are either NP-hard or coNP-hard. Finally, we show how to synthesise the corresponding reward machine if it exists.

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

↑