<--- Back to Details
First PageDocument Content
Mathematical analysis / Analysis / Mathematics / Combinatorial optimization / Functional analysis / Generalized functions / Submodular set function / Subadditivity / Limit of a function / Subadditive set function / Distribution / Modulus of continuity
Date: 2011-10-17 15:14:48
Mathematical analysis
Analysis
Mathematics
Combinatorial optimization
Functional analysis
Generalized functions
Submodular set function
Subadditivity
Limit of a function
Subadditive set function
Distribution
Modulus of continuity

Sketching Valuation Functions Ashwinkumar Badanidiyuru ∗ Shahar Dobzinski∗

Add to Reading List

Source URL: theory.stanford.edu

Download Document from Source Website

File Size: 391,56 KB

Share Document on Facebook

Similar Documents

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

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

143 Documenta Math. The Coming of the Matroids William H. Cunningham

DocID: 1r2Rn - View Document

On the Submodularity of Influence in Social Network

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

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‡

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

DocID: 1qR3A - View Document