Pages that link to "Item:Q3645308"
From MaRDI portal
The following pages link to On the Complexity of Efficiency and Envy-Freeness in Fair Division of Indivisible Goods with Additive Preferences (Q3645308):
Displaying 14 items.
- Distributed fair allocation of indivisible goods (Q343902) (← links)
- Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods (Q477331) (← links)
- Fair assignment of indivisible objects under ordinal preferences (Q899158) (← links)
- Envy-free allocations respecting social networks (Q2124438) (← links)
- Efficient reallocation under additive and responsive preferences (Q2272381) (← links)
- A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation (Q2661522) (← links)
- Computing fair and efficient allocations with few utility values (Q2670939) (← links)
- Fair and efficient allocation with few agent types, few item types, or small value levels (Q2680786) (← links)
- Generalized binary utility functions and fair allocations (Q2682030) (← links)
- Competitive Equilibrium with Indivisible Goods and Generic Budgets (Q4991681) (← links)
- Efficient Fair Division with Minimal Sharing (Q5095173) (← links)
- Fair in the Eyes of Others (Q5870502) (← links)
- Computing welfare-maximizing fair allocations of indivisible goods (Q6109821) (← links)
- Computing fair and efficient allocations with few utility values (Q6159026) (← links)
