Bidding for envy-freeness: a procedural approach to n-player fair-division problems
From MaRDI portal
Publication:2567945
DOI10.1007/S003550100149zbMATH Open1072.91590DBLPjournals/scw/HaakeRS02OpenAlexW2134776949WikidataQ59567287 ScholiaQ59567287MaRDI QIDQ2567945FDOQ2567945
Authors: Claus-Jochen Haake, Francis Edward Su, Matthias G. Raith 
Publication date: 14 October 2005
Published in: Social Choice and Welfare (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s003550100149
Recommendations
Cited In (34)
- Computing exact solutions of consensus halving and the Borsuk-Ulam theorem
- Two birds with one stone: fairness and welfare via transfers
- Resolving an insurance allocation problem: a procedural approach
- Envy-free and Pareto efficient allocations in economies with indivisible goods and money
- Computing exact solutions of consensus halving and the Borsuk-Ulam theorem
- An algorithm for envy-free allocations in an economy with indivisible objects and money
- The undercut procedure: an algorithm for the envy-free division of indivisible items
- A simple procedure for finding equitable allocations of indivisible goods
- A fair procedure in insurance
- Implementing Efficient Egalitarian Equivalent Allocations
- Generalized rental harmony
- An equilibrium analysis of Knaster's fair division procedure
- Nondiscrimination and monotonicity in fair division
- Consensus-halving via theorems of Borsuk-Ulam and Tucker
- A simple and procedurally fair game form for Nash implementation of the No-envy solution
- An algorithm for identifying least manipulable envy‐free and budget‐balanced allocations in economies with indivisibilities
- Hardness results for consensus-halving
- Solving house allocation problems with risk-averse agents
- Constrainedly fair job assignments under minimum wages
- One quarter each (on average) ensures proportionality
- Competitive envy-free division
- Computing envy-freeable allocations with limited subsidies
- Double implementation in a market for indivisible goods with a price constraint
- A comparison of formulations and solution methods for the minimum-envy location problem
- Searching for joint gains in multi-party negotiations.
- A note on the undercut procedure
- Fair by design: multidimensional envy-free mechanisms
- Distributed fair allocation of indivisible goods
- The potential of iterative voting to solve the separability problem in referendum elections
- Asymptotic existence of fair divisions for groups
- Least manipulable envy-free rules in economies with indivisibilities
- Title not available (Why is that?)
- Title not available (Why is that?)
- DIVIDING BY DEMANDING: OBJECT DIVISION THROUGH MARKET PROCEDURES
This page was built for publication: Bidding for envy-freeness: a procedural approach to \(n\)-player fair-division problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2567945)
