Near fairness in matroids
From MaRDI portal
Publication:5282999
Recommendations
Cited in
(17)- Fairly taking turns
- Minimising inequality in multiagent resource allocation: structural analysis of a distributed approach
- On maximin share allocations in matroids
- Fair in the Eyes of Others
- A protocol for cutting matroids like cakes
- Computing fair and efficient allocations with few utility values
- Local fairness in hedonic games via individual threshold coalitions
- On Fair Division under Heterogeneous Matroid Constraints
- EFX allocations for indivisible chores: matching-based approach
- Fair division of indivisible goods: recent progress and open questions
- Maximum Nash welfare and other stories about EFX
- Allocating indivisible goods to strategic agents: pure Nash equilibria and fairness
- Computing fair and efficient allocations with few utility values
- EFX allocations for indivisible chores: matching-based approach
- The frontier of intractability for EFX with two agents
- The price of equity with binary valuations and few agent types
- Envy-free relaxations for goods, chores, and mixed items
This page was built for publication: Near fairness in matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5282999)