Pages that link to "Item:Q2346382"
From MaRDI portal
The following pages link to Worst case compromises in matroids with applications to the allocation of indivisible goods (Q2346382):
Displayed 4 items.
- On maximin share allocations in matroids (Q1628590) (← links)
- The fair OWA one-to-one assignment problem: NP-hardness and polynomial time special cases (Q1755782) (← links)
- Agreeable sets with matroidal constraints (Q2424653) (← links)
- A Protocol for Cutting Matroids Like Cakes (Q2937759) (← links)