提出可验证的集体决策责任机制，确保有害结果至少由k人负责。
Peer Oversight in Collective Decision Making
- 通过重新分配决策权实现k重监督，只需k名成员即可满足条件。
- 给出多项式时间算法，判断是否可重构并构造出有效机制。
- 适用于需明确责任的多智能体系统设计，如自动化决策平台。
本文引入了同行k-监督（peer $k$-oversight）这一顺序集体决策机制的性质，要求每个有害结果至少有$k$名参与者承担责任。研究证明，只要通过重新分配决策控制权就能实现k-监督，那么仅用$k$个代理即可达成目标。同时提出一个多项式时间算法，用于判断这种控制权再分配是否存在，若存在则可构造出相应机制。这些结果表明，同行监督是一种可在多智能体决策系统中实际应用的设计原则。
原文摘要 · Abstract (English)
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.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品；中文卡片由大模型生成，请以原文为准。