Pages that link to "Item:Q2567945"
From MaRDI portal
The following pages link to Bidding for envy-freeness: a procedural approach to \(n\)-player fair-division problems (Q2567945):
Displaying 31 items.
- Distributed fair allocation of indivisible goods (Q343902) (← links)
- The potential of iterative voting to solve the separability problem in referendum elections (Q483636) (← links)
- Solving house allocation problems with risk-averse agents (Q836964) (← links)
- A note on the undercut procedure (Q904826) (← links)
- Nondiscrimination and monotonicity in fair division (Q993735) (← links)
- A comparison of formulations and solution methods for the minimum-envy location problem (Q1000990) (← links)
- A fair procedure in insurance (Q1413339) (← links)
- Asymptotic existence of fair divisions for groups (Q1680744) (← links)
- Competitive envy-free division (Q1767292) (← links)
- Consensus-halving via theorems of Borsuk-Ulam and Tucker (Q1810715) (← links)
- Envy-free and Pareto efficient allocations in economies with indivisible goods and money (Q1867846) (← links)
- A simple and procedurally fair game form for Nash implementation of the No-envy solution (Q2099047) (← links)
- Computing envy-freeable allocations with limited subsidies (Q2152144) (← links)
- Computing exact solutions of consensus halving and the Borsuk-Ulam theorem (Q2221804) (← links)
- Constrainedly fair job assignments under minimum wages (Q2268103) (← links)
- Fair by design: multidimensional envy-free mechanisms (Q2345204) (← links)
- An equilibrium analysis of Knaster's fair division procedure (Q2351206) (← links)
- An algorithm for envy-free allocations in an economy with indivisible objects and money (Q2388747) (← links)
- Resolving an insurance allocation problem: a procedural approach (Q2432507) (← links)
- The undercut procedure: an algorithm for the envy-free division of indivisible items (Q2450092) (← links)
- Least manipulable envy-free rules in economies with indivisibilities (Q2453827) (← links)
- Double implementation in a market for indivisible goods with a price constraint (Q2483121) (← links)
- A simple procedure for finding equitable allocations of indivisible goods (Q2567921) (← links)
- Two birds with one stone: fairness and welfare via transfers (Q2670942) (← links)
- (Q4608059) (← links)
- Hardness results for consensus-halving (Q5005124) (← links)
- Generalized Rental Harmony (Q5075869) (← links)
- Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem (Q5092341) (← links)
- Searching for joint gains in multi-party negotiations. (Q5932023) (← links)
- An algorithm for identifying least manipulable envy‐free and budget‐balanced allocations in economies with indivisibilities (Q6074887) (← links)
- One quarter each (on average) ensures proportionality (Q6609175) (← links)