356 search results - page 1 / 72 » Submodular Approximation: Sampling-based Algorithms and Lowe... |
FOCS
2008
IEEE
13 years 11 months ago
2008
IEEE
We introduce several generalizations of classical computer science problems obtained by replacing simpler objective functions with general submodular functions. The new problems i...
FOCS
2008
IEEE
13 years 5 months ago
2008
IEEE
In this paper we consider the following maximum budgeted allocation (MBA) problem: Given a set of m indivisible items and n agents; each agent i willing to pay bij on item j and w...
FOCS
2009
IEEE
13 years 11 months ago
2009
IEEE
Abstract— Applications in complex systems such as the Internet have spawned recent interest in studying situations involving multiple agents with their individual cost or utility...
STOC
2005
ACM
14 years 5 months ago
2005
ACM
We exhibit three approximation algorithms for the allocation problem in combinatorial auctions with complement free bidders. The running time of these algorithms is polynomial in ...
SIGECOM
2008
ACM
13 years 4 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...