Pages that link to "Item:Q5114782"
From MaRDI portal
The following pages link to Improving Nash Social Welfare Approximations (Q5114782):
Displaying 19 items.
- Maximizing Nash product social welfare in allocating indivisible goods (Q320030) (← links)
- Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods (Q477331) (← links)
- APX-hardness of maximizing Nash social welfare with indivisible items (Q1675918) (← links)
- Multiple birds with one stone: beating 1/2 for EFX and GMMS via envy cycle elimination (Q2202022) (← links)
- The price to pay for forgoing normalization in fair division of indivisible goods (Q2202518) (← links)
- The price of fairness for indivisible goods (Q2230722) (← links)
- Fair allocation of indivisible goods with minimum inequality or minimum envy (Q2242281) (← links)
- Maximum Nash welfare and other stories about EFX (Q2658044) (← links)
- When dividing mixed manna is easier than dividing goods: competitive equilibria with a constant number of chores (Q2670938) (← links)
- Computing fair and efficient allocations with few utility values (Q2670939) (← links)
- On maximum weighted Nash welfare for binary valuations (Q2673693) (← links)
- A characterization of maximum Nash welfare for indivisible goods (Q2681826) (← links)
- Approximating the Nash Social Welfare with Indivisible Items (Q4571931) (← links)
- Nash Social Welfare Approximation for Strategic Agents (Q5031018) (← links)
- Fair Division of Indivisible Goods for a Class of Concave Valuations (Q5094007) (← links)
- Ordinal Maximin Share Approximation for Goods (Q5094017) (← links)
- Approximating Nash Social Welfare under Submodular Valuations through (Un)Matchings (Q6075859) (← links)
- Computing fair and efficient allocations with few utility values (Q6159026) (← links)
- Fair division with allocator's preference (Q6609128) (← links)
