Pages that link to "Item:Q5419084"
From MaRDI portal
The following pages link to From convex optimization to randomized mechanisms (Q5419084):
Displaying 13 items.
- Truthful mechanism design via correlated tree rounding (Q526848) (← links)
- A bounded-risk mechanism for the kidney exchange game (Q1752443) (← links)
- Matroid rank functions and discrete concavity (Q1926653) (← links)
- Learning in auctions: regret is hard, envy is easy (Q2155904) (← links)
- Welfare maximization with production costs: a primal dual approach (Q2278952) (← links)
- Limitations of randomized mechanisms for combinatorial auctions (Q2516249) (← links)
- Recognizing Coverage Functions (Q2944461) (← links)
- Black-Box Reductions in Mechanism Design (Q3088099) (← links)
- A combinatorial auction improves school meals in Chile: a case of OR in developing countries (Q4662760) (← links)
- Worst-Case Mechanism Design via Bayesian Analysis (Q4978196) (← links)
- Breaking the Logarithmic Barrier for Truthful Combinatorial Auctions with Submodular Bidders (Q4997307) (← links)
- The Limitations of Optimization from Samples (Q5889795) (← links)
- Mechanism design for perturbation stable combinatorial auctions (Q5918584) (← links)
