Bidding for envy-freeness: a procedural approach to n-player fair-division problems
From MaRDI portal
Publication:2567945
Recommendations
Cited in
(34)- A simple procedure for finding equitable allocations of indivisible goods
- Searching for joint gains in multi-party negotiations.
- Fair by design: multidimensional envy-free mechanisms
- Constrainedly fair job assignments under minimum wages
- Two birds with one stone: fairness and welfare via transfers
- An equilibrium analysis of Knaster's fair division procedure
- Resolving an insurance allocation problem: a procedural approach
- Nondiscrimination and monotonicity in fair division
- A simple and procedurally fair game form for Nash implementation of the No-envy solution
- Computing exact solutions of consensus halving and the Borsuk-Ulam theorem
- One quarter each (on average) ensures proportionality
- Distributed fair allocation of indivisible goods
- Envy-free and Pareto efficient allocations in economies with indivisible goods and money
- scientific article; zbMATH DE number 2088164 (Why is no real title available?)
- A comparison of formulations and solution methods for the minimum-envy location problem
- Generalized rental harmony
- A note on the undercut procedure
- Solving house allocation problems with risk-averse agents
- Computing envy-freeable allocations with limited subsidies
- Asymptotic existence of fair divisions for groups
- 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
- DIVIDING BY DEMANDING: OBJECT DIVISION THROUGH MARKET PROCEDURES
- A fair procedure in insurance
- Double implementation in a market for indivisible goods with a price constraint
- Least manipulable envy-free rules in economies with indivisibilities
- The undercut procedure: an algorithm for the envy-free division of indivisible items
- Consensus-halving via theorems of Borsuk-Ulam and Tucker
- The potential of iterative voting to solve the separability problem in referendum elections
- An algorithm for identifying least manipulable envy‐free and budget‐balanced allocations in economies with indivisibilities
- scientific article; zbMATH DE number 6850473 (Why is no real title available?)
- Implementing Efficient Egalitarian Equivalent Allocations
- Competitive envy-free division
- Hardness results for consensus-halving
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)
