3 search results - page 1 / 1 » Making VCG More Robust in Combinatorial Auctions via Submodu... |
AAAI
2007
13 years 10 months ago
2007
ATAL
2006
Springer
13 years 11 months ago
2006
Springer
This paper develops a new combinatorial auction protocol called the Groves Mechanism with SubModular Approximation (GM-SMA). This protocol satisfies the following characteristics:...
SIGECOM
2008
ACM
13 years 7 months ago
2008
ACM
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...