Fair Division under Ordinal Preferences: Computing Envy-Free Allocations of Indivisible Goods

DOI10.3233/978-1-60750-606-5-387zbMath1211.68378OpenAlexW2161916591MaRDI QIDQ2999165

Ulle Endriss, Sylvain Bouveret, Jérôme Lang

Publication date: 11 May 2011

Full work available at URL: https://doi.org/10.3233/978-1-60750-606-5-387

Mathematics Subject Classification ID

Decision theory (91B06) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Agent technology and artificial intelligence (68T42)

Related Items (17)

Multi resource allocation with partial preferences ⋮ Ordinal optimization through multi-objective reformulation ⋮ Approximate and strategyproof maximin share allocation of chores with ordinal preferences ⋮ Computational complexity of necessary envy-freeness ⋮ Complexity of manipulation and bribery in judgment aggregation for uniform premise-based quota rules ⋮ Fair assignment of indivisible objects under ordinal preferences ⋮ Improved maximin guarantees for subadditive and fractionally subadditive fair allocation problem ⋮ Impossibilities for probabilistic assignment ⋮ Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods ⋮ Verification in incomplete argumentation frameworks ⋮ Fair Division ⋮ Control complexity in Borda elections: solving all open cases of offline control and some cases of online control ⋮ Efficient reallocation under additive and responsive preferences ⋮ Incompatibility of efficiency and strategyproofness in the random assignment setting with indifferences ⋮ Democratic fair allocation of indivisible goods ⋮ Borda-induced hedonic games with friends, enemies, and neutral players ⋮ Computing a small agreeable set of indivisible items

This page was built for publication: Fair Division under Ordinal Preferences: Computing Envy-Free Allocations of Indivisible Goods