Fair division of indivisible items
From MaRDI portal
Recommendations
- Fair division of indivisible items among people with similar preferences
- Fair Allocation of Indivisible Goods and Criteria of Justice
- How to divide things fairly
- Fair Division
- Fair division of indivisible items between two people with identical preferences: Envy-freeness, Pareto-optimality, and equity
Cited in
(47)- A simple procedure for finding equitable allocations of indivisible goods
- Fair assignment of indivisible objects under ordinal preferences
- Welfare bounds in the fair division problem
- A characterization of the existence of succinct linear representation of subset-valuations
- Fair division of indivisible goods under risk
- Fair (and not so fair) division
- Efficiency and envy-freeness in fair division of indivisible goods: logical representation and complexity
- Fair division with no information
- Fair sharing under dichotomous preferences
- Using the Borda rule for ranking sets of objects
- Efficient reallocation under additive and responsive preferences
- Implementing equal division with an ultimatum threat
- Fair Allocation of Indivisible Goods and Criteria of Justice
- Fair allocation with diminishing differences
- Fair division of indivisible items between two people with identical preferences: Envy-freeness, Pareto-optimality, and equity
- Weighted fair division of indivisible items: a review
- Fair allocation of indivisible goods: the two-agent case
- Buying several indivisible goods
- A general branch-and-bound algorithm for fair division problems
- Two-player fair division of indivisible items: comparison of algorithms
- Proportional Borda allocations
- Truthful Fair Division
- Strategy-proofness of scoring allocation correspondences for indivisible goods
- How to divide things fairly
- Money-egalitarian-equivalent and gain-maximin allocations of indivisible items with monetary compensation
- The price of fairness for a small number of indivisible items
- Games of fair division
- Guarantees in Fair Division: General or Monotone Preferences
- Fair Division
- Control complexity in Borda elections: solving all open cases of offline control and some cases of online control
- Borda-induced hedonic games with friends, enemies, and neutral players
- Maximizing Nash product social welfare in allocating indivisible goods
- How to divide the indivisible
- The undercut procedure: an algorithm for the envy-free division of indivisible items
- Brams-Taylor model of fair division for divisible and indivisible items
- Ordinal optimization through multi-objective reformulation
- Equitable distribution of indivisible objects
- Complexity of manipulation and bribery in judgment aggregation for uniform premise-based quota rules
- Fair division of indivisible items among people with similar preferences
- How to allocate hard candies fairly
- Scoring rules for the allocation of indivisible goods
- Dividing splittable goods evenly and with limited fragmentation
- On fairness via picking sequences in allocation of indivisible goods
- Obituary: Peter C. Fishburn (1936--2021)
- Dividing splittable goods evenly and with limited fragmentation
- Fair division under ordinal preferences: computing envy-free allocations of indivisible goods
- Fair Allocation of Indivisible Goods
This page was built for publication: Fair division of indivisible items
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1876633)
