Group Envy Freeness and Group Pareto Efficiency in Fair Division with Indivisible Items

DOI10.1007/978-3-030-00111-7_6MaRDI QIDQ6488080zbMATH OpenFDO

Authors Martin Aleksandrov, Toby Walsh

Publication date 24 March 2023

Full work available at URL https://doi.org/10.1007/978-3-030-00111-7_6

Mathematics Subject Classification ID

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

Recommendations

• Fair division of indivisible items between two people with identical preferences: Envy-freeness, Pareto-optimality, and equity
• Envy freeness in experimental fair division problems
• Almost envy-freeness in group resource allocation
• Efficiency and envy-freeness in fair division of indivisible goods: logical representation and complexity
• On finding an envy-free Pareto-optimal division
• Envy-free and Pareto efficient allocations in economies with indivisible goods and money
• Two-person fair division of indivisible items when envy-freeness is impossible
• On the Complexity of Efficiency and Envy-Freeness in Fair Division of Indivisible Goods with Additive Preferences
• Fair allocation of indivisible goods with minimum inequality or minimum envy
• Fair division under ordinal preferences: computing envy-free allocations of indivisible goods

Cited in

(4)

• Almost envy-freeness for groups: improved bounds via discrepancy theory
• Almost envy-freeness in group resource allocation
• Computing welfare-maximizing fair allocations of indivisible goods
• Ordinal maximin guarantees for group fair division

This page was built for publication: Group Envy Freeness and Group Pareto Efficiency in Fair Division with Indivisible Items

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