arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2406.07024cs.GT
收藏

Plant-and-Steal:通过预测实现真实公平分配

Plant-and-Steal: Truthful Fair Allocations via Predictions

Ilan Reuven Cohen, Alon Eden, Talya Eden, Arsen Vasilyan

AI总结:

本文采用学习增强框架设计真实的 MMS 不可分割物品分配机制,利用物品排序预测在两代理人及一般 n 代理人情形下兼顾一致性与鲁棒性,并给出不可能性结果和实验验证。

摘要:

我们研究用于逼近具有加性估值的代理人对不可分割物品的最大最小份额(Maximin-Share,MMS)分配的真实机制。从算法角度看,对于任意数量的代理人,该问题都存在常数因子逼近。然而,当把激励因素纳入考虑时,Amanatidis、Birmpas、Christodoulou 和 Markakis [EC 2017] 的一个令人震惊的结果表明,对于两个代理人和 m 件物品,最佳可能逼近比为 ⌊m/2⌋。我们采用学习增强框架,研究在给定关于输入的某种预测时能够实现什么。对于两个代理人,我们提出了一种真实机制,该机制将代理人对物品的排序作为预测。当预测准确时,我们给出 MMS 的 2-逼近(一致性);当预测失准时,我们仍获得 MMS 的 ⌈m/2⌉-逼近(鲁棒性)。我们进一步表明,该机制的性能会随着预测中“错误”数量的增加而平滑退化;也就是说,我们在两个极端之间进行插值(至多相差常数因子):即没有错误的情况和错误数量达到最大值的情况。我们还证明了一个关于具有有限鲁棒性的机制所能获得的一致性的不可能性结果。对于 n≥2 个代理人的一般情形,我们给出了一种在预测准确时的 2-逼近机制,并具有放宽的兜底保证。最后,我们给出实验结果,说明我们框架中为确保一致性和鲁棒性而设计的不同组件何时发挥作用。

英文摘要:

We study truthful mechanisms for approximating the Maximin-Share (MMS) allocation of agents with additive valuations for indivisible goods. Algorithmically, constant factor approximations exist for the problem for any number of agents. When adding incentives to the mix, a jarring result by Amanatidis, Birmpas, Christodoulou, and Markakis [EC 2017] shows that the best possible approximation for two agents and $m$ items is $\lfloor \frac{m}{2} \rfloor$. We adopt a learning-augmented framework to investigate what is possible when some prediction on the input is given. For two agents, we give a truthful mechanism that takes agents' ordering over items as prediction. When the prediction is accurate, we give a $2$-approximation to the MMS (consistency), and when the prediction is off, we still get an $\lceil \frac{m}{2} \rceil$-approximation to the MMS (robustness). We further show that the mechanism's performance degrades gracefully in the number of ``mistakes" in the prediction; i.e., we interpolate (up to constant factors) between the two extremes: when there are no mistakes, and when there is a maximum number of mistakes. We also show an impossibility result on the obtainable consistency for mechanisms with finite robustness. For the general case of $n\ge 2$ agents, we give a 2-approximation mechanism for accurate predictions, with relaxed fallback guarantees. Finally, we give experimental results which illustrate when different components of our framework, made to insure consistency and robustness, come into play.

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

↑