Pages that link to "Item:Q2321268"
From MaRDI portal
The following pages link to Computing a small agreeable set of indivisible items (Q2321268):
Displaying 10 items.
- Finding a collective set of items: from proportional multirepresentation to group recommendation (Q334810) (← links)
- The complexity of finding fair independent sets in cycles (Q2087771) (← links)
- Almost envy-freeness in group resource allocation (Q2202023) (← links)
- Democratic fair allocation of indivisible goods (Q2289012) (← links)
- Agreeable sets with matroidal constraints (Q2424653) (← links)
- Portioning using ordinal preferences: fairness and efficiency (Q2680774) (← links)
- Consensus Halving for Sets of Items (Q5870379) (← links)
- On finding constrained independent sets in cycles (Q6130317) (← links)
- Fixed-Parameter Algorithms for the Kneser and Schrijver Problems (Q6154195) (← links)
- Allocation of indivisible items with individual preference graphs (Q6157417) (← links)