Pages that link to "Item:Q1675918"

The following pages link to APX-hardness of maximizing Nash social welfare with indivisible items (Q1675918):

Displaying 18 items.

• APX-hardness of maximizing Nash social welfare with indivisible items (Q1675918) (← links)
• Approximating Nash social welfare under binary XOS and binary subadditive valuations (Q2152132) (← links)
• An additive approximation scheme for the Nash social welfare maximization with identical additive valuations (Q2169968) (← links)
• Dividing bads under additive utilities (Q2417409) (← links)
• A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation (Q2436693) (← links)
• Maximum Nash welfare and other stories about EFX (Q2658044) (← links)
• Computing fair and efficient allocations with few utility values (Q2670939) (← links)
• On maximum weighted Nash welfare for binary valuations (Q2673693) (← links)
• Approximating the Nash Social Welfare with Indivisible Items (Q4571931) (← links)
• Nash Social Welfare, Matrix Permanent, and Stable Polynomials (Q4638089) (← links)
• Core Pricing in Combinatorial Exchanges with Financially Constrained Buyers: Computational Hardness and Algorithmic Solutions (Q5031010) (← links)
• On fair division for indivisible items (Q5090961) (← links)
• Fair Division of Indivisible Goods for a Class of Concave Valuations (Q5094007) (← links)
• (Q5874477) (← links)
• Approximating Nash Social Welfare under Submodular Valuations through (Un)Matchings (Q6075859) (← links)
• Existence of EFX for two additive valuations (Q6094718) (← links)
• Computing fair and efficient allocations with few utility values (Q6159026) (← links)
• Online Nash welfare maximization without predictions (Q6609160) (← links)