On fairness via picking sequences in allocation of indivisible goods

DOI10.1007/978-3-030-87756-9_17OpenAlexW3211195417MaRDI QIDQ2695445

Laurent Gourvès, Anaëlle Wilczynski, Julien Lesca

Publication date: 31 March 2023

Full work available at URL: https://doi.org/10.1007/978-3-030-87756-9_17

zbMATH Keywords

resource allocationfair divisioncomputational social choice

Mathematics Subject Classification ID

Decision theory (91B06) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Social choice (91B14) Matching models (91B68)

Related Items (2)

On reachable assignments under dichotomous preferences ⋮ Computing welfare-maximizing fair allocations of indivisible goods

Cites Work

• Unnamed Item
• The efficiency of fair division
• Fair division of indivisible items
• Fair Allocation of Indivisible Goods
• Cake Cutting Algorithms
• A Class of Sequential Games

This page was built for publication: On fairness via picking sequences in allocation of indivisible goods