Pages that link to "Item:Q3177806"
From MaRDI portal
The following pages link to Optimal Mechanisms for Combinatorial Auctions and Combinatorial Public Projects via Convex Rounding (Q3177806):
Displaying 7 items.
- Item bidding for combinatorial public projects (Q526903) (← links)
- Gross substitutability: an algorithmic survey (Q1682734) (← links)
- Tight approximation bounds for maximum multi-coverage (Q2118140) (← links)
- Oblivious Rounding and the Integrality Gap (Q4636438) (← links)
- A combinatorial auction improves school meals in Chile: a case of OR in developing countries (Q4662760) (← links)
- Algorithms as Mechanisms: The Price of Anarchy of Relax and Round (Q4991678) (← links)
- Tight Approximation Bounds for Maximum Multi-coverage (Q5041735) (← links)