Problem
Research questions and friction points this paper is trying to address.
peer oversight
collective decision making
sequential mechanisms
Peer Oversight in Collective Decision Making
🤖 AI Summary
本文提出了一种名为同伴k-监督的机制，通过重新分配决策控制权来确保至少有k个代理对任何有害结果负责，并提供了一个多项式时间算法以确定这种重新分配是否可行。
📝 Abstract
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.
Innovation
Methods, ideas, or system contributions that make the work stand out.
peer k-oversight
sequential collective decision mechanisms
polynomial-time algorithm
🔎 Similar Papers
No similar papers found.
