On the hardness of approximating minimization problems
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
The space complexity of approximating the frequency moments
Journal of Computer and System Sciences
Truth revelation in approximately efficient combinatorial auctions
Proceedings of the 1st ACM conference on Electronic commerce
An efficient approximate allocation algorithm for combinatorial auctions
Proceedings of the 3rd ACM conference on Electronic Commerce
On the Distributional Complexity of Disjontness
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
Some complexity questions related to distributive computing(Preliminary Report)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
CABOB: a fast optimal algorithm for combinatorial auctions
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 2
Partial-revelation VCG mechanism for combinatorial auctions
Eighteenth national conference on Artificial intelligence
Incentive compatible multi unit combinatorial auctions
Proceedings of the 9th conference on Theoretical aspects of rationality and knowledge
On the complexity of price equilibria
Journal of Computer and System Sciences - STOC 2002
Approximation algorithms for combinatorial auctions with complement-free bidders
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Truthful and Near-Optimal Mechanism Design via Linear Programming
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Single-value combinatorial auctions and implementation in undominated strategies
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Limitations of VCG-based mechanisms
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Two Randomized Mechanisms for Combinatorial Auctions
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
On the Approximability of Combinatorial Exchange Problems
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Inapproximability of Combinatorial Public Projects
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Approximation Algorithms for Combinatorial Auctions with Complement-Free Bidders
Mathematics of Operations Research
ACM SIGACT News
Combinatorial auctions with verification are tractable
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
On the Computational Power of Demand Queries
SIAM Journal on Computing
Truthful and Near-Optimal Mechanism Design via Linear Programming
Journal of the ACM (JACM)
Truthful randomized mechanisms for combinatorial auctions
Journal of Computer and System Sciences
Best-response dynamics out of sync: complexity and characterization
Proceedings of the fourteenth ACM conference on Electronic commerce
| Hi-index | 0.00 |
We consider a settingwhere k players are each holdingsome collection of subsets of {1..n}. We consider the communication complexity of approximately solvingt wo problems: The cover number: the minimal number of sets (in the union of their collections) whose union is {1...n} and the packing number: the maximum number of sets (in the union of their collections) that are pair-wise disjoint.We prove that while computinga (ln n)-approximation for the cover number and an min(k,O(驴n)-approximation for the packingn umber can be done with polynomial (in n) amount of communication, getting a (1/2 - 驴) log n approximation for the cover number or a better than min(k, n1/2-驴)-approximation for the packingn umber requires exponential communication complexity.