Two-player fair division of indivisible items: comparison of algorithms
From MaRDI portal
Publication:724147
DOI10.1016/J.EJOR.2018.05.057zbMATH Open1403.91213OpenAlexW2807266134WikidataQ129738457 ScholiaQ129738457MaRDI QIDQ724147FDOQ724147
Authors: D. Marc Kilgour, Rudolf Vetschera 
Publication date: 25 July 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2018.05.057
Recommendations
Cites Work
- A NEW MEASURE OF RANK CORRELATION
- Handbook of group decision and negotiation
- Title not available (Why is that?)
- The Santa Claus problem
- Fair Allocation of Indivisible Goods
- The undercut procedure: an algorithm for the envy-free division of indivisible items
- In Silico Voting Experiments
- How to Divide Things Fairly
- Proportional Borda allocations
Cited In (11)
- Two-person fair division of indivisible items when envy-freeness is impossible
- Using the Borda rule for ranking sets of objects
- Fair allocation of indivisible goods with minimum inequality or minimum envy
- Stability and welfare in (dichotomous) hedonic diversity games
- Computing welfare-maximizing fair allocations of indivisible goods
- Comparing algorithms for fair allocation of indivisible items with limited information
- Almost envy-freeness in group resource allocation
- The Price of Connectivity in Fair Division
- Fair division of indivisible items between two players: design parameters for contested pile methods
- A general branch-and-bound algorithm for fair division problems
- A correspondence between voting procedures and stochastic orderings
This page was built for publication: Two-player fair division of indivisible items: comparison of algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q724147)
