From Convex Optimization to Randomized Mechanisms: Toward Optimal Combinatorial Auctions∗ Shaddin Dughmi† Tim Roughgarden‡

First Page		Document Content
Date: 2012-07-04 18:28:36 Mathematical optimization Mathematics Operations research Linear programming Convex optimization Combinatorial optimization Computational complexity theory Submodular set function Randomized rounding Optimization problem Matroid Ellipsoid method		From Convex Optimization to Randomized Mechanisms: Toward Optimal Combinatorial Auctions∗ Shaddin Dughmi† Tim Roughgarden‡ Add to Reading List Source URL: www.qiqiyan.com.s3-website-us-east-1.amazonaws.com Download Document from Source Website File Size: 255,23 KB Share Document on Facebook

	Advanced Approximation Algorithms (CMU 18-854B, SpringLecture 2: LP Relaxations, Randomized Rounding Jan 17, 2008 DocID: 1tp7O - View Document
	Iterative Randomized Rounding Thomas Rothvoß Department of Mathematics, M.I.T. Carg`ese 2011 Joint work with Jaroslaw Byrka, DocID: 1skvJ - View Document
	arXiv:1110.4319v2 [cs.DS] 20 Oct 2011 DocID: 1r9bi - View Document
	The Entropy Rounding Method in Approximation Algorithms Thomas Rothvoß Department of Mathematics, M.I.T. Carg`ese 2011 DocID: 1r2GX - View Document
	Unifying Local Consistency and MAX SAT Relaxations for Scalable Inference with Rounding Guarantees Stephen H. Bach University of Maryland DocID: 1r1cx - View Document