Proportional Borda allocations
From MaRDI portal
Publication:682476
DOI10.1007/S00355-016-0982-ZzbMATH Open1392.91105OpenAlexW2492435076WikidataQ41537119 ScholiaQ41537119MaRDI QIDQ682476FDOQ682476
Authors: Andreas Darmann, Christian Klamler 
Publication date: 2 February 2018
Published in: Social Choice and Welfare (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00355-016-0982-z
Recommendations
Cites Work
- Basic Geometry of Voting
- Title not available (Why is that?)
- Voting almost maximizes social welfare despite limited communication
- A simple procedure for finding equitable allocations of indivisible goods
- 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
- Fair enough: guaranteeing approximate maximin shares
- Fair assignment of indivisible objects under ordinal preferences
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)
