Algorithmic mechanism design (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Optimal solutions for multi-unit combinatorial auctions: branch and bound heuristics
Proceedings of the 2nd ACM conference on Electronic commerce
An auction agent for bidding on combinations of items
Proceedings of the fifth international conference on Autonomous agents
Mechanism design with incomplete languages
Proceedings of the 3rd ACM conference on Electronic Commerce
Automated negotiation and decision making in multiagent environments
Mutli-agents systems and applications
Agents in E-commerce: state of the art
Knowledge and Information Systems
Automated Negotiation and Decision Making in Multiagent Environments
EASSS '01 Selected Tutorial Papers from the 9th ECCAI Advanced Course ACAI 2001 and Agent Link's 3rd European Agent Systems Summer School on Multi-Agent Systems and Applications
Algorithms for Rational Agents
SOFSEM '00 Proceedings of the 27th Conference on Current Trends in Theory and Practice of Informatics
Accounting for Cognitive Costs in On-Line Auction Design
AMET '98 Selected Papers from the First International Workshop on Agent Mediated Electronic Trading on Agent Mediated Electronic Commerce
Auction based resource negotiation in NOMAD
ACSC '05 Proceedings of the Twenty-eighth Australasian conference on Computer Science - Volume 38
An optimal multiprocessor combinatorial auction solver
Computers and Operations Research
Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem
Computers and Operations Research
CABRO: Winner Determination Algorithm for Single-unit Combinatorial Auctions
Proceedings of the 2008 conference on Artificial Intelligence Research and Development: Proceedings of the 11th International Conference of the Catalan Association for Artificial Intelligence
Taming the computational complexity of combinatorial auctions: optimal and approximate approaches
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Problem reduction heuristic for the 0-1 multidimensional knapsack problem
Computers and Operations Research
| Hi-index | 0.00 |
There is interest in designing simultaneous auctions for situations in which the value of assets to a bidder depends upon which other assets he or she wins. In such cases, bidders may well wish to submit bids for combinations of assets. When this is allowed, the problem of determining the revenue maximizing set of nonconflicting bids can be a difficult one. We analyze this problem, identifying several different structures of combinatorial bids for which computational tractability is constructively demonstrated and some structures for which computational tractability cannot be guaranteed.