Sciweavers

22 search results - page 1 / 5
» Ranking with Submodular Valuations
Sort
View
CORR
2010
Springer
38views Education» more  CORR 2010»
14 years 10 months ago
Ranking with Submodular Valuations
Yossi Azar, Iftah Gamzu
CORR
2012
Springer
218views Education» more  CORR 2012»
13 years 5 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
ATAL
2006
Springer
15 years 1 months ago
False-name-proof combinatorial auction protocol: Groves Mechanism with SubModular Approximation
This paper develops a new combinatorial auction protocol called the Groves Mechanism with SubModular Approximation (GM-SMA). This protocol satisfies the following characteristics:...
Makoto Yokoo, Toshihiro Matsutani, Atsushi Iwasaki
CORR
2011
Springer
177views Education» more  CORR 2011»
14 years 5 months ago
A Truthful Randomized Mechanism for Combinatorial Public Projects via Convex Optimization
In Combinatorial Public Projects, there is a set of projects that may be undertaken, and a set of selfinterested players with a stake in the set of projects chosen. A public plann...
Shaddin Dughmi
SIGECOM
2008
ACM
155views ECommerce» more  SIGECOM 2008»
14 years 10 months ago
Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
Vahab S. Mirrokni, Michael Schapira, Jan Vondr&aac...