On fairness via picking sequences in allocation of indivisible goods

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

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

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

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)

Cites Work

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

Cited In (6)

• Title not available (Why is that?)
• On reachable assignments under dichotomous preferences
• Optimizing over serial dictatorships
• Computing welfare-maximizing fair allocations of indivisible goods
• Comparing algorithms for fair allocation of indivisible items with limited information
• Optimizing over serial dictatorships

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)