Recommendations
Cites work
- scientific article; zbMATH DE number 1015852 (Why is no real title available?)
- A simple procedure for finding equitable allocations of indivisible goods
- Basic Geometry of Voting
- Fair assignment of indivisible objects under ordinal preferences
- Fair enough: guaranteeing approximate maximin shares
- The undercut procedure: an algorithm for the envy-free division of indivisible items
- Two-person fair division of indivisible items: an efficient envy-free algorithm
- Voting almost maximizes social welfare despite limited communication
Cited in
(9)- Fair allocation with diminishing differences
- Asymptotic existence of proportionally fair allocations
- Negotiation strategies for agents with ordinal preferences: theoretical analysis and human study
- Obtaining a proportional allocation by deleting items
- Obtaining a proportional allocation by deleting items
- Comparing algorithms for fair allocation of indivisible items with limited information
- Two-player fair division of indivisible items: comparison of algorithms
- Scoring rules for the allocation of indivisible goods
- A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation
This page was built for publication: Proportional Borda allocations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q682476)