Pages that link to "Item:Q2388751"
From MaRDI portal
The following pages link to Fair division of indivisible items between two people with identical preferences: Envy-freeness, Pareto-optimality, and equity (Q2388751):
Displaying 21 items.
- Fair division of indivisible items between two players: design parameters for contested pile methods (Q483924) (← links)
- Fair assignment of indivisible objects under ordinal preferences (Q899158) (← links)
- Strategic divide and choose (Q952777) (← links)
- Brams-Taylor model of fair division for divisible and indivisible items (Q991311) (← links)
- A general branch-and-bound algorithm for fair division problems (Q991365) (← links)
- A comparison of formulations and solution methods for the minimum-envy location problem (Q1000990) (← links)
- A fair procedure in insurance (Q1413339) (← links)
- Approximate maximin shares for groups of agents (Q1748541) (← links)
- Fair division of indivisible items (Q1876633) (← links)
- Two-person fair division of indivisible items when envy-freeness is impossible (Q2120143) (← links)
- Almost envy-freeness in group resource allocation (Q2202023) (← links)
- An equilibrium analysis of Knaster's fair division procedure (Q2351206) (← links)
- No-envy and egalitarian-equivalence under multi-object-demand for heterogeneous objects (Q2362196) (← links)
- The undercut procedure: an algorithm for the envy-free division of indivisible items (Q2450092) (← links)
- Fair allocation of indivisible goods: the two-agent case (Q2453428) (← links)
- How to allocate hard candies fairly (Q2463574) (← links)
- Approximate competitive equilibrium with generic budget (Q2670929) (← links)
- The Price of Connectivity in Fair Division (Q5864211) (← links)
- Fair in the Eyes of Others (Q5870502) (← links)
- Fair division of indivisible items among people with similar preferences (Q5939413) (← links)
- Group Envy Freeness and Group Pareto Efficiency in Fair Division with Indivisible Items (Q6488080) (← links)
