Improving EFX Guarantees through Rainbow Cycle Number
Improving EFX Guarantees through Rainbow Cycle Number
复制标题
通过 Rainbow Cycle Number 改善 EFX 保证
DOI:
10.1145/3465456.3467605
复制
发表时间:
2021
期刊:
影响因子:
--
通讯作者:
Misra, Pranabendu
中科院分区:
文献类型:
--
作者:
Chaudhury, Bhaskar Ray;Garg, Jugal;Mehlhorn, Kurt;Mehta, Ruta;Misra, Pranabendu
We study the problem of fairly allocating a set of indivisible goods among n agents with additive valuations. Envy-freeness up to any good (EFX) is arguably the most compelling fairness notion in this context. However, the existence of EFX allocations has not been settled and is one of the most important problems in fair division [5]. Towards resolving this problem, many impressive results show the existence of its relaxations. In particular, [1] shows the existence of 0.618-EFX allocations, and [4] shows that EFX allocation exists if we do not allocate at most n - 1 goods. The latter result was recently improved for three agents in [2], in which the two unallocated goods are allocated through an involved procedure. Reducing the number of unallocated goods for an arbitrary number of agents is a systematic way to settle the big question.
登录
查看更多内容
DOI:
10.24963/ijcai.2020/4
发表时间:
2020
期刊:
--
影响因子:
--
作者:
Amanatidis G
通讯作者:
Amanatidis G
DOI:
10.1145/3391403.3399526
发表时间:
2019-02
期刊:
Proceedings of the 21st ACM Conference on Economics and Computation
影响因子:
--
作者:
J. Garg;Setareh Taki
通讯作者:
J. Garg;Setareh Taki
DOI:
10.1137/20m1353381
发表时间:
2020
期刊:
ArXiv
影响因子:
--
作者:
Pasin Manurangsi;Warut Suksompong
通讯作者:
Warut Suksompong
DOI:
10.1609/aaai.v34i02.5545
发表时间:
2019
期刊:
ArXiv
影响因子:
--
作者:
Georgios Amanatidis;Apostolos Ntokos;E. Markakis
通讯作者:
E. Markakis
影响因子:
22.7
作者:
Ariel D. Procaccia
通讯作者:
Ariel D. Procaccia