发表机构
University of Southampton; School of Electronics and Computer Science（南安普顿大学; 电子与计算机科学学院）
机构由 AI 辅助整理，请以论文原文为准。AI 中文总结
本文提出同行$k$-监督属性，证明其可通过$k$个代理人实现，给出多项式时间算法判断并构造控制权重新分配，确立其为多代理人决策系统的易处理设计原则。
AI 中文摘要
本文提出了同行$k$-监督，这是序列集体决策机制的一种属性，要求每个有害结果都至少有$k$个代理人承担责任。研究表明，当通过重新分配机制中决策的控制权可实现$k$-监督时，仅需$k$个代理人即可达成。还提出了一种多项式时间算法，用于判断此类重新分配是否存在，若存在则构造出该分配。这些结果确立了同行监督是多代理人决策系统的一种易处理的设计原则。
英文摘要
This article introduces peer $k$-oversight, a property of sequential collective decision mechanisms requiring at least $k$ agents to be responsible for every harmful outcome. It is shown that whenever $k$-oversight can be achieved by redistributing control over the decisions in a mechanism, it can be achieved using just $k$ agents. A polynomial-time algorithm is also presented that determines whether such a redistribution exists and, when it does, constructs one. These results establish peer oversight as a tractable design principle for multiagent decision-making systems.
