Fair division of indivisible items between two people with identical preferences: Envy-freeness, Pareto-optimality, and equity

DOI10.1007/S003550050019zbMATH Open1069.91502OpenAlexW1974972171MaRDI QIDQ2388751FDOQ2388751

Authors: Steven J. Brams, Peter Fishburn

Publication date: 20 September 2005

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

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

Recommendations

Fair division of indivisible items among people with similar preferences
Fair division of indivisible items
Two-person fair division of indivisible items when envy-freeness is impossible
Fair division under ordinal preferences: computing envy-free allocations of indivisible goods
On the Complexity of Efficiency and Envy-Freeness in Fair Division of Indivisible Goods with Additive Preferences

Noncooperative games (91A10) Fundamental topics (basic mathematics, methodology; applicable to economics in general) (91B02)

Cited In (20)

Two-person fair division of indivisible items when envy-freeness is impossible
Fair assignment of indivisible objects under ordinal preferences
The undercut procedure: an algorithm for the envy-free division of indivisible items
How to allocate hard candies fairly
A fair procedure in insurance
Fair in the Eyes of Others
Group Envy Freeness and Group Pareto Efficiency in Fair Division with Indivisible Items
Fair allocation of indivisible goods: the two-agent case
A comparison of formulations and solution methods for the minimum-envy location problem
Approximate competitive equilibrium with generic budget
Almost envy-freeness in group resource allocation
Strategic divide and choose
The Price of Connectivity in Fair Division
Fair division of indivisible items between two players: design parameters for contested pile methods
No-envy and egalitarian-equivalence under multi-object-demand for heterogeneous objects
Approximate maximin shares for groups of agents
Fair division of indivisible items among people with similar preferences
Fair division of indivisible items
A general branch-and-bound algorithm for fair division problems
Brams-Taylor model of fair division for divisible and indivisible items

This page was built for publication: Fair division of indivisible items between two people with identical preferences: Envy-freeness, Pareto-optimality, and equity

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