Depth-first iterative-deepening: an optimal admissible tree search
Artificial Intelligence
Computationally Manageable Combinational Auctions
Management Science
Greedy local improvement and weighted set packing approximation
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Approximations of Independent Sets in Graphs
APPROX '98 Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization
Clique is hard to approximate within n1-
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
eMediator: a next generation electronic commerce server
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
A brokering algorithm for cost & QoS-based winner determination in combinatorial auctions
IEA/AIE '00 Proceedings of the 13th international conference on Industrial and engineering applications of artificial intelligence and expert systems: Intelligent problem solving: methodologies and approaches
Supporting Co-Allocation in an Auctioning-Based Resource Allocator for Grid Systems
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Declarative Specification and Solution of Combinatorial Auctions Using Logic Programming
LPNMR '01 Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning
Proceedings of the 5th Pacific Rim International Workshop on Multi Agents: Intelligent Agents and Multi-Agent Systems
Task Allocation in the RoboCup Rescue Simulation Domain: A Short Note
RoboCup 2001: Robot Soccer World Cup V
Evaluating Resource Bundle Derivatives for Multi-agent Negotiation of Resource Allocation
E-Commerce Agents, Marketplace Solutions, Security Issues, and Supply and Demand
An Efficient Approximate Algorithm for Winner Determination in Combinatorial Auctions
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Learning the Empirical Hardness of Optimization Problems: The Case of Combinatorial Auctions
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
An Evaluation of Formalisms for Negotiations in E-commerce
DCW '00 Proceedings of the Third International Workshop on Distributed Communities on the Web
An English Auction Protocol for Multi-attribute Items
AAMAS '02 Revised Papers from the Workshop on Agent Mediated Electronic Commerce on Agent-Mediated Electronic Commerce IV, Designing Mechanisms and Systems
Generating Bids for Group-Related Actions in the Context of Prior Commitments
ATAL '01 Revised Papers from the 8th International Workshop on Intelligent Agents VIII
On line markets for distributed object services: the MAJIC system
USITS'01 Proceedings of the 3rd conference on USENIX Symposium on Internet Technologies and Systems - Volume 3
Exploring local search in winner determination problem
Information Technology and Management
Best-First AND/OR Search for 0/1 Integer Programming
CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Distributed Production Scheduling Using Federated Agent Architecture
HoloMAS '07 Proceedings of the 3rd international conference on Industrial Applications of Holonic and Multi-Agent Systems: Holonic and Multi-Agent Systems for Manufacturing
Branch and Bound for Boolean Optimization and the Generation of Optimality Certificates
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Bid evaluation in combinatorial auctions: optimization and learning
Software—Practice & Experience
Approximation Algorithms for Combinatorial Auctions with Complement-Free Bidders
Mathematics of Operations Research
Secure combinatorial auctions by dynamic programming with polynomial secret sharing
FC'02 Proceedings of the 6th international conference on Financial cryptography
Approximation algorithms for k-duplicates combinatorial auctions with subadditive bidders
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
Advanced generic neighborhood heuristics for VNS
Engineering Applications of Artificial Intelligence
A new approach to detecting shill bids in e-auctions
International Journal of Intelligent Information and Database Systems
A Framework for Certified Boolean Branch-and-Bound Optimization
Journal of Automated Reasoning
Pricing the resource in computational market based on Bayes-game model
ACOS'06 Proceedings of the 5th WSEAS international conference on Applied computer science
The computon in computing grid
SMO'05 Proceedings of the 5th WSEAS international conference on Simulation, modelling and optimization
UAI'01 Proceedings of the Seventeenth conference on Uncertainty in artificial intelligence
A lagrangian heuristic for winner determination problem in combinatorial auctions
AI'05 Proceedings of the 18th Australian Joint conference on Advances in Artificial Intelligence
Inapproximability results for combinatorial auctions with submodular utility functions
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Process definition language support for rapid simulation prototyping
SPW'05 Proceedings of the 2005 international conference on Unifying the Software Process Spectrum
AND/OR branch-and-bound search for pure 0/1 integer linear programming problems
CPAIOR'06 Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Conflict-Directed a* search for soft constraints
CPAIOR'06 Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
An approach to detecting shill-biddable allocations in combinatorial auctions
DEECS'06 Proceedings of the Second international conference on Data Engineering Issues in E-Commerce and Services
An experimental study of the misdirection algorithm for combinatorial auctions
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
| Hi-index | 0.00 |
Combinatorial auctions, i.e. auctions where bidders can bid on combinations of items, tend to lead to more efficient allocations than traditional auctions in multi-item auctions where the agents' valuations of the items are not additive. However, determining the winners so as to maximize revenue is NP complete. We present a search algorithm for optimal winner determination. Experiments are shown on several bid distributions. The algorithm allows combinatorial auctions to scale up to significantly larger numbers of items and bids than prior approaches to optimal winner determination by capitalizing on the fact that the space of bids is necessarily sparsely populated in practice. We do this via provably sufficient selective generation of children in the search and by using a method for fast child generation, heuristics that are accurate and optimized for speed, and four methods for preprocessing the search space.