36 search results - page 8 / 8 » Factoring polynomials via polytopes |
SIGECOM
2008
ACM
13 years 5 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...