Sciweavers

26 search results - page 5 / 6
» Revenue Monotonicity in Combinatorial Auctions
Sort
View
CORR
2012
Springer
218views Education» more  CORR 2012»
12 years 2 months ago
On the Hardness of Welfare Maximization in Combinatorial Auctions with Submodular Valuations
We present a new type of monotone submodular functions: multi-peak submodular functions. Roughly speaking, given a family of sets F, we construct a monotone submodular function f ...
Shahar Dobzinski, Jan Vondrák
SIGECOM
2004
ACM
135views ECommerce» more  SIGECOM 2004»
13 years 11 months ago
Applying learning algorithms to preference elicitation
We consider the parallels between the preference elicitation problem in combinatorial auctions and the problem of learning an unknown function from learning theory. We show that l...
Sébastien Lahaie, David C. Parkes
SIGECOM
2010
ACM
156views ECommerce» more  SIGECOM 2010»
13 years 11 months ago
Robust mechanisms for risk-averse sellers
The existing literature on optimal auctions focuses on optimizing the expected revenue of the seller, and is appropriate for risk-neutral sellers. In this paper, we identify good ...
Mukund Sundararajan, Qiqi Yan
STOC
2012
ACM
221views Algorithms» more  STOC 2012»
11 years 8 months ago
From query complexity to computational complexity
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...
Shahar Dobzinski, Jan Vondrák
CORR
2010
Springer
121views Education» more  CORR 2010»
13 years 4 months ago
Mechanism Design via Correlation Gap
For revenue and welfare maximization in singledimensional Bayesian settings, Chawla et al. (STOC10) recently showed that sequential posted-price mechanisms (SPMs), though simple i...
Qiqi Yan