On fairness via picking sequences in allocation of indivisible goods

DOI10.1007/978-3-030-87756-9_17MaRDI QIDQ2695445zbMATH OpenOpenAlexFDO

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

Publication date 31 March 2023

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

zbMATH Keywords

resource allocationcomputational social choicefair division

Mathematics Subject Classification ID

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

Recommendations

• Comparing algorithms for fair allocation of indivisible items with limited information
• Almost proportional allocations of indivisible chores: computation, approximation and efficiency
• Fair division of indivisible items between two people with identical preferences: Envy-freeness, Pareto-optimality, and equity
• The Pareto-dominant strategy-proof and fair rule for problems with indivisible goods

Cites work

• A Class of Sequential Games
• Cake cutting algorithms
• Fair Allocation of Indivisible Goods
• Fair division of indivisible items
• Manipulating picking sequences
• The efficiency of fair division

Cited in

(6)

• Computing welfare-maximizing fair allocations of indivisible goods
• Optimizing over serial dictatorships
• Optimizing over serial dictatorships
• Comparing algorithms for fair allocation of indivisible items with limited information
• On reachable assignments under dichotomous preferences
• scientific article; zbMATH DE number 6902543 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2695445)