Comparing algorithms for fair allocation of indivisible items with limited information

DOI10.1007/978-3-031-33780-2_9MaRDI QIDQ6201671FDOQ6201671

Authors: Fahimeh Ziaei, D. Marc Kilgour 

Publication date: 25 March 2024

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

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

zbMATH Keywords

envy-freePareto-optimalindivisible items2-person fair division

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Two-player fair division of indivisible items: comparison of algorithms
• Proportional Borda allocations
• Prisoners' Dilemama and Professional Sports Drafts
• A Class of Sequential Games
• Introduction to the theory of fair allocation

Cited In (2)

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

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)