(Almost Full) EFX for Three (and More) Types of Agents
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2023
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866916546179235840 |
|---|---|
| author | Ghosal, Pratik HV, Vishwa Prakash Nimbhorkar, Prajakta Varma, Nithin |
| author_facet | Ghosal, Pratik HV, Vishwa Prakash Nimbhorkar, Prajakta Varma, Nithin |
| contents | We study the problem of determining an envy-free allocation of indivisible goods among multiple agents with additive valuations. EFX, which stands for envy-freeness up to any good, is a well-studied relaxation of the envy-free allocation problem and has been shown to exist for specific scenarios. EFX is known to exist for three agents, and for any number of agents when there are only two types of valuations. EFX allocations are also known to exist for four agents with at most one good unallocated.
In this paper, we show that EFX exists with at most k-2 goods unallocated for any number of agents having k distinct valuations. Additionally, we show that complete EFX allocations exist when all but two agents have identical valuations. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2301_10632 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | (Almost Full) EFX for Three (and More) Types of Agents Ghosal, Pratik HV, Vishwa Prakash Nimbhorkar, Prajakta Varma, Nithin Computer Science and Game Theory Multiagent Systems We study the problem of determining an envy-free allocation of indivisible goods among multiple agents with additive valuations. EFX, which stands for envy-freeness up to any good, is a well-studied relaxation of the envy-free allocation problem and has been shown to exist for specific scenarios. EFX is known to exist for three agents, and for any number of agents when there are only two types of valuations. EFX allocations are also known to exist for four agents with at most one good unallocated. In this paper, we show that EFX exists with at most k-2 goods unallocated for any number of agents having k distinct valuations. Additionally, we show that complete EFX allocations exist when all but two agents have identical valuations. |
| title | (Almost Full) EFX for Three (and More) Types of Agents |
| topic | Computer Science and Game Theory Multiagent Systems |
| url | https://arxiv.org/abs/2301.10632 |