Pages that link to "Item:Q2567921"
From MaRDI portal
The following pages link to A simple procedure for finding equitable allocations of indivisible goods (Q2567921):
Displaying 14 items.
- Distributed fair allocation of indivisible goods (Q343902) (← links)
- Proportional Borda allocations (Q682476) (← links)
- A note on the undercut procedure (Q904826) (← links)
- A general branch-and-bound algorithm for fair division problems (Q991365) (← links)
- Strategy-proofness of scoring allocation correspondences for indivisible goods (Q1707112) (← links)
- How to obtain an equitable optimal fair division (Q2288973) (← links)
- A general equivalence theorem for allocation of indivisible objects (Q2444698) (← links)
- Fair allocation of indivisible goods: the two-agent case (Q2453428) (← links)
- How to allocate hard candies fairly (Q2463574) (← links)
- Allocating indivisible items with minimum dissatisfaction on preference graphs (Q2695444) (← links)
- Ordinal Maximin Share Approximation for Goods (Q5094017) (← links)
- Fair Division (Q5150295) (← links)
- Allocation of indivisible items with individual preference graphs (Q6157417) (← links)
- The equal share proportional solution in a permit sharing problem (Q6168803) (← links)