Pages that link to "Item:Q2124438"
From MaRDI portal
The following pages link to Envy-free allocations respecting social networks (Q2124438):
Displaying 10 items.
- Optimizing social welfare in social networks (Q2290372) (← links)
- Parameterized complexity of envy-free resource allocation in social networks (Q2680801) (← links)
- The Price of Connectivity in Fair Division (Q5864211) (← links)
- On reachable assignments under dichotomous preferences (Q6057838) (← links)
- On fair division with binary valuations respecting social networks (Q6102283) (← links)
- Fair division with minimal withheld information in social networks (Q6113835) (← links)
- Fair division with minimal withheld information in social networks (Q6122612) (← links)
- Maximum Votes Pareto-Efficient Allocations via Swaps on a Social Network (Q6168490) (← links)
- EFX allocation to chores over small graph (Q6606239) (← links)
- A discrete and bounded locally envy-free cake cutting protocol on trees (Q6609151) (← links)