Pages that link to "Item:Q5090961"
From MaRDI portal
The following pages link to On fair division for indivisible items (Q5090961):
Displaying 15 items.
- Fair division of indivisible items between two players: design parameters for contested pile methods (Q483924) (← links)
- Implementing equal division with an ultimatum threat (Q490057) (← links)
- How to divide the indivisible (Q521428) (← links)
- Brams-Taylor model of fair division for divisible and indivisible items (Q991311) (← links)
- On the computability of equitable divisions (Q1926490) (← links)
- An additive approximation scheme for the Nash social welfare maximization with identical additive valuations (Q2169968) (← links)
- Dividing splittable goods evenly and with limited fragmentation (Q2309472) (← links)
- Computing fair and efficient allocations with few utility values (Q2670939) (← links)
- A Little Charity Guarantees Almost Envy-Freeness (Q4957912) (← links)
- Fair Division of Indivisible Goods for a Class of Concave Valuations (Q5094007) (← links)
- Dividing splittable goods evenly and with limited fragmentation (Q5111223) (← links)
- (Q5874477) (← links)
- Approximating Nash Social Welfare under Submodular Valuations through (Un)Matchings (Q6075859) (← links)
- Existence of EFX for two additive valuations (Q6094718) (← links)
- Computing fair and efficient allocations with few utility values (Q6159026) (← links)
