Pages that link to "Item:Q1748541"
From MaRDI portal
The following pages link to Approximate maximin shares for groups of agents (Q1748541):
Displaying 20 items.
- Asymptotic existence of fair divisions for groups (Q1680744) (← links)
- Local fairness in hedonic games via individual threshold coalitions (Q2034790) (← links)
- Almost envy-freeness for groups: improved bounds via discrepancy theory (Q2166776) (← links)
- Multiple birds with one stone: beating 1/2 for EFX and GMMS via envy cycle elimination (Q2202022) (← links)
- Almost envy-freeness in group resource allocation (Q2202023) (← links)
- The price of fairness for indivisible goods (Q2230722) (← links)
- Maximin share guarantee for goods with positive externalities (Q2244422) (← links)
- Democratic fair allocation of indivisible goods (Q2289012) (← links)
- Fair cake-cutting among families (Q2296036) (← links)
- Computing a small agreeable set of indivisible items (Q2321268) (← links)
- Allocation problems among sharing groups (Q2491882) (← links)
- Maximum Nash welfare and other stories about EFX (Q2658044) (← links)
- Closing Gaps in Asymptotic Fair Division (Q4986806) (← links)
- When Do Envy-Free Allocations Exist? (Q5130903) (← links)
- Consensus Halving for Sets of Items (Q5870379) (← links)
- Stable matching with multilayer approval preferences: approvals can be harder than strict preferences (Q6109539) (← links)
- Fair division of indivisible goods: recent progress and open questions (Q6136107) (← links)
- Fairness for multi-self agents (Q6176741) (← links)
- Stable matching with multilayer approval preferences: approvals can be harder than strict preferences (Q6188265) (← links)
- Fair division with allocator's preference (Q6609128) (← links)
