Pages that link to "Item:Q2941527"

The following pages link to Approximating the Nash Social Welfare with Indivisible Items (Q2941527):

Displaying 15 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)
• Exact solution approaches for integer linear generalized maximum multiplicative programs through the lens of multi-objective optimization (Q2669645) (← links)
• Approximate competitive equilibrium with generic budget (Q2670929) (← links)
• Computing fair and efficient allocations with few utility values (Q2670939) (← links)
• Approximating the Nash Social Welfare with Indivisible Items (Q4571931) (← links)
• Nash Social Welfare, Matrix Permanent, and Stable Polynomials (Q4638089) (← links)
• From Monetary to Nonmonetary Mechanism Design via Artificial Currencies (Q4958545) (← links)
• Ascending-Price Algorithms for Unknown Markets (Q4972683) (← 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)
• (Q5874477) (← links)
• Computing welfare-maximizing fair allocations of indivisible goods (Q6109821) (← links)
• Computing fair and efficient allocations with few utility values (Q6159026) (← links)
• Online Nash welfare maximization without predictions (Q6609160) (← links)