Pages that link to "Item:Q3225165"

The following pages link to Approximation Techniques for Utilitarian Mechanism Design (Q3225165):

Displaying 19 items.

• Approximate composable truthful mechanism design (Q344791) (← links)
• Combinatorial auctions without money (Q521808) (← links)
• Improved approximation algorithms for box contact representations (Q521820) (← links)
• Truthful mechanism design for bin packing with applications on cloud computing (Q2084605) (← links)
• Packing under convex quadratic constraints (Q2118134) (← links)
• On black-box transformations in downward-closed environments (Q2322707) (← links)
• Incentive compatible mulit-unit combinatorial auctions: a primal dual approach (Q2345944) (← links)
• The minimum approval mechanism implements the efficient public good allocation theoretically and experimentally (Q2437168) (← links)
• Beyond the worst-case analysis of random priority: smoothed and average-case approximation ratios in mechanism design (Q2672280) (← links)
• Utilitarian mechanism design for multiobjective optimization (Q2929697) (← links)
• Smoothness for Simultaneous Composition of Mechanisms with Admission (Q2959837) (← links)
• Approximate Truthful Mechanism Design for Two-Dimensional Orthogonal Knapsack Problem (Q3196401) (← links)
• Welfare Maximization with Deferred Acceptance Auctions in Reallocation Problems (Q3452842) (← links)
• Algorithms as Mechanisms: The Price of Anarchy of Relax and Round (Q4991678) (← links)
• Packing Under Convex Quadratic Constraints (Q5041751) (← links)
• (Q5417649) (← links)
• (Q5743445) (← links)
• Computing simple mechanisms: Lift-and-round over marginal reduced forms (Q6083525) (← links)
• On improved interval cover mechanisms for crowdsourcing markets (Q6164503) (← links)