EFX配分の存在に関する非加法的評価関数への拡張
| Autor: | Mahara, Ryoga |
|---|---|
| Přispěvatelé: | 小林, 佑輔, 牧野, 和久, 長谷川, 真人 |
| Jazyk: | angličtina |
| Rok vydání: | 2023 |
| Předmět: |
FOS: Computer and information sciences
General Valuations Theory of computation → Algorithmic game theory Discrete Mathematics (cs.DM) envy-freeness Computer Science - Computer Science and Game Theory Discrete Fair Division indivisible items EFX allocations Computer Science - Discrete Mathematics Computer Science and Game Theory (cs.GT) fair division |
| Popis: | Envy-freeness is one of the most widely studied notions in fair division. Since envy-free allocations do not always exist when items are indivisible, several relaxations have been considered. Among them, possibly the most compelling concept is envy-freeness up to any item (EFX). We study the existence of EFX allocations for general valuations. The existence of EFX allocations is a major open problem. For general valuations, it is known that an EFX allocation always exists (i) when $n=2$ or (ii) when all agents have identical valuations, where $n$ is the number of agents. it is also known that an EFX allocation always exists when one can leave at most $n-1$ items unallocated. We develop new techniques and extend some results of additive valuations to general valuations on the existence of EFX allocations. We show that an EFX allocation always exists (i) when all agents have one of two general valuations or (ii) when the number of items is at most $n+3$. We also show that an EFX allocation always exists when one can leave at most $n-2$ items unallocated. In addition to the positive results, we construct an instance with $n=3$ in which an existing approach does not work as it is. Comment: 25 pages, 7 figures |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|