Pages that link to "Item:Q2813239"
From MaRDI portal
The following pages link to Two-person fair division of indivisible items: an efficient envy-free algorithm (Q2813239):
Displaying 13 items.
- Proportional Borda allocations (Q682476) (← links)
- Asymptotic existence of fair divisions for groups (Q1680744) (← links)
- Approximate maximin shares for groups of agents (Q1748541) (← links)
- Two-person fair division of indivisible items when envy-freeness is impossible (Q2120143) (← links)
- Almost envy-freeness in group resource allocation (Q2202023) (← links)
- Allocating indivisible items with minimum dissatisfaction on preference graphs (Q2695444) (← links)
- Efficient Fair Division with Minimal Sharing (Q5095173) (← links)
- Fair Division (Q5150295) (← links)
- The Price of Connectivity in Fair Division (Q5864211) (← links)
- Obtaining a proportional allocation by deleting items (Q5925523) (← links)
- Computational complexity of necessary envy-freeness (Q6125946) (← links)
- Countering negotiation power asymmetries by using the adjusted winner algorithm (Q6155634) (← links)
- Allocation of indivisible items with individual preference graphs (Q6157417) (← links)