An incremental linear-time algorithm for recognizing interval graphs
SIAM Journal on Computing
Artificial intelligence: a modern approach
Artificial intelligence: a modern approach
Computationally Manageable Combinational Auctions
Management Science
An O(n2 algorithm for circular-arc graph recognition
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
eMediator: a next generation electronic commerce server
AGENTS '00 Proceedings of the fourth international conference on Autonomous agents
Bidding and allocation in combinatorial auctions
Proceedings of the 2nd ACM conference on Electronic commerce
Optimal solutions for multi-unit combinatorial auctions: branch and bound heuristics
Proceedings of the 2nd ACM conference on Electronic commerce
Data Structures and Algorithm Analysis in C++
Data Structures and Algorithm Analysis in C++
Winner determination in combinatorial auction generalizations
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 1
Truth revelation in approximately efficient combinatorial auctions
Journal of the ACM (JACM)
Taming the Computational Complexity of Combinatorial Auctions: Optimal and Approximate Approaches
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
An Algorithm for Optimal Winner Determination in Combinatorial Auctions
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Sequential Auctions for the Allocation of Resources with Complementarities
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Solving Combinatorial Auctions Using Stochastic Local Search
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
An Algorithm for Multi-Unit Combinatorial Auctions
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Some Tractable Combinatorial Auctions
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Integer Programming for Combinatorial Auction Winner Determination
ICMAS '00 Proceedings of the Fourth International Conference on MultiAgent Systems (ICMAS-2000)
A Combinatorial Auction with Multiple Winners for Universal Service
Management Science
Issues in computational Vickrey auctions
International Journal of Electronic Commerce - Special issue: Intelligent agents for electronic commerce
CABOB: a fast optimal algorithm for combinatorial auctions
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 2
Rule-Based Specification of Auction Mechanisms
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 2
Solving Combinatorial Exchanges: Optimality via a Few Partial Bids
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 3
Sequential auctions for objects with common and private values
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Discount auctions for procuring heterogeneous items
ICEC '05 Proceedings of the 7th international conference on Electronic commerce
Online algorithms for market clearing
Journal of the ACM (JACM)
A Market-Based Adaptation for Resolving Competing Needs for Scarce Resources
IAT '06 Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology
Realising Common Knowledge Assumptions in Agent Auctions
IAT '06 Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology
A Classification Structure for Automated Negotiations
WI-IATW '06 Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology
On the complexity of combinatorial auctions: structured item graphs and hypertree decomposition
Proceedings of the 8th ACM conference on Electronic commerce
Combinatorial auctions with tractable winner determination
ACM SIGecom Exchanges
The complexity of deciding reachability properties of distributed negotiation schemes
Theoretical Computer Science
An optimal multiprocessor combinatorial auction solver
Computers and Operations Research
A model and heuristic algorithms for multi-unit nondiscriminatory combinatorial auction
Computers and Operations Research
Unifying simulation and optimization of strategic sourcing and transportation
Proceedings of the 40th Conference on Winter Simulation
Search Better and Gain More: Investigating New Graph Structures for Multi-Agent Negotiations
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Expressive commerce and its application to sourcing
IAAI'06 Proceedings of the 18th conference on Innovative applications of artificial intelligence - Volume 2
Combinatorial auctions with structured item graphs
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Combinatorial auctions with k-wise dependent valuations
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Extremal behaviour in multiagent contract negotiation
Journal of Artificial Intelligence Research
Maximizing revenue in sequential auctions
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Algorithms and theory of computation handbook
Comparing multiagent systems research in combinatorial auctions and voting
Annals of Mathematics and Artificial Intelligence
Sequential auctions for common value objects with budget constrained bidders
Multiagent and Grid Systems - Advances in Agent-mediated Automated Negotiations
Expressive markets for donating to charities
Artificial Intelligence
An efficient reverse auction mechanism for limited supplier base
Electronic Commerce Research and Applications
rBundle: an iterative combinatorial auction-based approach to supporting advance reservation
GCC'05 Proceedings of the 4th international conference on Grid and Cooperative Computing
Optimal agendas for sequential english auctions with private and common values
PRIMA'06 Proceedings of the 9th Pacific Rim international conference on Agent Computing and Multi-Agent Systems
An immune partheno-genetic algorithm for winner determination in combinatorial auctions
ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part III
An analysis of sequential auctions for common and private value objects
AMEC'05 Proceedings of the 2005 international conference on Agent-Mediated Electronic Commerce: designing Trading Agents and Mechanisms
An overview of cooperative and competitive multiagent learning
LAMAS'05 Proceedings of the First international conference on Learning and Adaption in Multi-Agent Systems
Information-theoretic approaches to branching in search
Discrete Optimization
A REVIEW OF TREE CONVEX SETS TEST
Computational Intelligence
Managing spectrum into abundance
Proceedings of the 24th International Teletraffic Congress
Decomposing combinatorial auctions and set packing problems
Journal of the ACM (JACM)
Hi-index | 0.00 |
Combinatorial auctions can be used to reach efficient resource and task allocations in multiagent systems where the items are complementary or substitutable. Determining the winners is NP- complete and inapproximable, but it was recently shown that optimal search algorithms do very well on average. This paper presents a more sophisticated search algorithm for optimal (and anytime) winner determination, including structural improvements that reduce search tree size, faster data structures, and optimizations at search nodes based on driving toward, identifying and solving tractable special cases. We also uncover a more general tractable special case, and design algorithms for solving it as well as for solving known tractable special cases substantially faster. We generalize combinatorial auctions to multiple units of each item, to reserve prices on singletons as well as combinations, and to combinatorial exchanges. All of these generalizations support both complementarity and substitutability of the items. Finally, we present algorithms for determining the winners in these generalizations.