On the complexity of cooperative solution concepts
Mathematics of Operations Research
Communication complexity
Truth revelation in approximately efficient combinatorial auctions
Proceedings of the 1st ACM conference on Electronic commerce
Cooperative facility location games
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Algorithmic Aspects of the Core of Combinatorial Optimization Games
Mathematics of Operations Research
Combinatorial auctions with decreasing marginal utilities
Proceedings of the 3rd ACM conference on Electronic Commerce
On the complexity of equilibria
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Winner determination in combinatorial auction generalizations
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 1
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
An approximate truthful mechanism for combinatorial auctions with single parameter agents
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Market Equilibrium via a Primal-Dual-Type Algorithm
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Truthful approximation mechanisms for restricted combinatorial auctions: extended abstract
Eighteenth national conference on Artificial intelligence
Combinatorial auction across independent markets [Extended Abstract]
Proceedings of the 4th ACM conference on Electronic commerce
Some complexity questions related to distributive computing(Preliminary Report)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Combinatorial Auctions: A Survey
INFORMS Journal on Computing
Anonymous Pricing of Efficient Allocations in Combinatorial Economies
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 1
On walrasian price of CPU time
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Walrasian equilibrium: hardness, approximations and tractable instances
WINE'05 Proceedings of the First international conference on Internet and Network Economics
On envy-free pareto efficient pricing
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
Hyper-T-width and hyper-D-width: Stable connectivity measures for hypergraphs
Theoretical Computer Science
| Hi-index | 0.00 |
We consider complexity issues for a special type of combinatorial auctions, the single-minded auction, where every agent is interested in only one subset of the commodities.First, we present a matching bound on the communication complexity for the single-minded auction under a general communication model. Next, we prove that it is NP-hard to decide whether Walrasian equilibrium exists in a single-minded auction. Finally, we establish a polynomial size duality theorem for the existence of Walrasian equilibrium for the single-minded auction.