An optimal algorithm for on-line bipartite matching
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
A unifying location model on tree graphs based on submodularity properties
Discrete Applied Mathematics
The space complexity of approximating the frequency moments
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
“The quickest transshipment problem”
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
A combinatorial algorithm minimizing submodular functions in strongly polynomial time
Journal of Combinatorial Theory Series B
Buffer overflow management in QoS switches
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Combinatorial auctions with decreasing marginal utilities
Proceedings of the 3rd ACM conference on Electronic Commerce
A combinatorial strongly polynomial algorithm for minimizing submodular functions
Journal of the ACM (JACM)
Approximation algorithms for combinatorial auctions with complement-free bidders
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
On the computational power of iterative auctions
Proceedings of the 6th ACM conference on Electronic commerce
AdWords and Generalized On-line Matching
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
An improved approximation algorithm for combinatorial auctions with submodular bidders
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
An improved approximation algorithm for combinatorial auctions with submodular bidders
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
On maximizing welfare when utility functions are subadditive
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Truthful randomized mechanisms for combinatorial auctions
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Welfare maximization in congestion games
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
IAT '06 Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology
Limitations of VCG-based mechanisms
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Proceedings of the 3rd international workshop on Data enginering issues in E-commerce and services: In conjunction with ACM Conference on Electronic Commerce (EC '07)
Buying cheap is expensive: hardness of non-parametric multi-product pricing
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Optimal approximation for the submodular welfare problem in the value oracle model
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions
Proceedings of the 9th ACM conference on Electronic commerce
Scheduling to maximize participation
Theoretical Computer Science
Santa Claus Meets Hypergraph Matchings
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Approximating submodular functions everywhere
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Performance Analysis about Parallel Greedy Approximation on Combinatorial Auctions
PRIMA '08 Proceedings of the 11th Pacific Rim International Conference on Multi-Agents: Intelligent Agents and Multi-Agent Systems
Inapproximability of Combinatorial Public Projects
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Fast Partial Reallocation in Combinatorial Auctions for Iterative Resource Allocation
Agent Computing and Multi-Agent Systems
Toward a large scale E-market: a greedy and local search based winner determination
IEA/AIE'07 Proceedings of the 20th international conference on Industrial, engineering, and other applications of applied intelligent systems
Scheduling to maximize participation
TGC'06 Proceedings of the 2nd international conference on Trustworthy global computing
An experimental analysis of biased parallel greedy approximation for combinatorial auctions
International Journal of Intelligent Information and Database Systems
Inapproximability for VCG-based combinatorial auctions
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
On the limitations of Greedy mechanism design for truthful combinatorial auctions
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Single-parameter combinatorial auctions with partially public valuations
SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
Approximation algorithms for non-single-minded profit-maximization problems with limited supply
WINE'10 Proceedings of the 6th international conference on Internet and network economics
On the Computational Power of Demand Queries
SIAM Journal on Computing
A truthful randomized mechanism for combinatorial public projects via convex optimization
Proceedings of the 12th ACM conference on Electronic commerce
An impossibility result for truthful combinatorial auctions with submodular valuations
Proceedings of the forty-third annual ACM symposium on Theory of computing
From convex optimization to randomized mechanisms: toward optimal combinatorial auctions
Proceedings of the forty-third annual ACM symposium on Theory of computing
ESA'11 Proceedings of the 19th European conference on Algorithms
Truthful randomized mechanisms for combinatorial auctions
Journal of Computer and System Sciences
Inapproximability results for combinatorial auctions with submodular utility functions
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Optimization with demand oracles
Proceedings of the 13th ACM Conference on Electronic Commerce
Santa claus meets hypergraph matchings
ACM Transactions on Algorithms (TALG)
Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
SIAM Journal on Computing
Quasi-polynomial local search for restricted max-min fair allocation
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Welfare maximization and the supermodular degree
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Minimizing the total weighted completion time of fully parallel jobs with integer parallel units
Theoretical Computer Science
Annals of Mathematics and Artificial Intelligence
| Hi-index | 0.00 |
We explore the allocation problem in combinatorial auctions with submodular bidders. We provide an e/e-1 approximation algorithm for this problem. Moreover, our algorithm applies to the more general class of XOS bidders. By presenting a matching unconditional lower bound in the communication model, we prove that the upper bound is tight for the XOS class.Our algorithm improves upon the previously known 2-approximation algorithm. In fact, we also exhibit another algorithm which obtains an approximation ratio better than 2 for submodular bidders, even in the value queries model.Throughout the paper we highlight interesting connections between combinatorial auctions with XOS and submodular bidders and various other combinatorial optimization problems. In particular, we discuss coverage problems and online problems.