Pages that link to "Item:Q2680801"
From MaRDI portal
The following pages link to Parameterized complexity of envy-free resource allocation in social networks (Q2680801):
Displaying 4 items.
- On fair division with binary valuations respecting social networks (Q6102283) (← links)
- Fair division with minimal withheld information in social networks (Q6113835) (← links)
- Maximum Votes Pareto-Efficient Allocations via Swaps on a Social Network (Q6168490) (← links)
- Approximate envy-freeness in graphical cake cutting (Q6611013) (← links)