Comparing algorithms for fair allocation of indivisible items with limited information

DOI10.1007/978-3-031-33780-2_9MaRDI QIDQ6201671zbMATH OpenFDO

Authors Fahimeh Ziaei, D. Marc Kilgour

Publication date 25 March 2024

Published in Lecture Notes in Business Information Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-33780-2_9

zbMATH Keywords

2-person fair divisionenvy-freeindivisible itemsPareto-optimal

Mathematics Subject Classification ID

Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Recommendations

• Two-player fair division of indivisible items: comparison of algorithms
• Fair division of indivisible items between two people with identical preferences: Envy-freeness, Pareto-optimality, and equity
• On fairness via picking sequences in allocation of indivisible goods
• The Pareto-dominant strategy-proof and fair rule for problems with indivisible goods
• Fair division under ordinal preferences: computing envy-free allocations of indivisible goods

Cites work

• A Class of Sequential Games
• scientific article; zbMATH DE number 1015852 (Why is no real title available?)
• Introduction to the theory of fair allocation
• Prisoners' Dilemama and Professional Sports Drafts
• Proportional Borda allocations
• Two-player fair division of indivisible items: comparison of algorithms

Cited in

(2)

• On fairness via picking sequences in allocation of indivisible goods
• Optimizing hedonic editing for multiple outcomes: an algorithm

This page was built for publication: Comparing algorithms for fair allocation of indivisible items with limited information

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