A simple procedure for finding equitable allocations of indivisible goods

DOI10.1007/S003550100119MaRDI QIDQ2567921zbMATH OpenOpenAlexWikidataFDO

Authors Dorothea K. Herreiner, Clemens Puppe

Publication date 14 October 2005

Published in Social Choice and Welfare (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s003550100119

Mathematics Subject Classification ID

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

Recommendations

• Money-egalitarian-equivalent and gain-maximin allocations of indivisible items with monetary compensation
• Bidding for envy-freeness: a procedural approach to \(n\)-player fair-division problems
• Fair division of indivisible items
• Fair allocation of indivisible goods: the two-agent case
• The undercut procedure: an algorithm for the envy-free division of indivisible items

Cited in

(15)

• Strategy-proofness of scoring allocation correspondences for indivisible goods
• How to obtain an equitable optimal fair division
• A general equivalence theorem for allocation of indivisible objects
• Fair allocation of indivisible goods: the two-agent case
• How to allocate hard candies fairly
• Allocating indivisible items with minimum dissatisfaction on preference graphs
• Distributed fair allocation of indivisible goods
• Implementing Efficient Egalitarian Equivalent Allocations
• Ordinal Maximin Share Approximation for Goods
• Fair Division
• Allocation of indivisible items with individual preference graphs
• The equal share proportional solution in a permit sharing problem
• Proportional Borda allocations
• A note on the undercut procedure
• A general branch-and-bound algorithm for fair division problems

This page was built for publication: A simple procedure for finding equitable allocations of indivisible goods

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