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

	GROSS SUBSTITUTABILITY : AN ALGORITHMIC SURVEY RENATO PAES LEME∗ Abstract. The concept of gross substitute valuations was introduced by Kelso and Crawford as a sufficient conditions for the existence of Walrasian equil DocID: 1rptM - View Document
	143 Documenta Math. The Coming of the Matroids William H. Cunningham DocID: 1r2Rn - View Document
	On the Submodularity of Influence in Social Network DocID: 1qZB1 - View Document
	TimeMachine: Timeline Generation for Knowledge-Base Entities Tim Althoff, Xin Luna Dong† , Kevin Murphy† , Safa Alai† , Van Dang† , Wei Zhang† Computer Science Department, Stanford University, Stanford, CA 94 DocID: 1qWsb - View Document
	From Convex Optimization to Randomized Mechanisms: Toward Optimal Combinatorial Auctions∗ Shaddin Dughmi† Tim Roughgarden‡ DocID: 1qR3A - View Document