Complexity analysis admissible heuristic search
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Computationally Manageable Combinational Auctions
Management Science
iBundle: an efficient ascending price bundle auction
Proceedings of the 1st ACM conference on Electronic commerce
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
Towards a universal test suite for combinatorial auction algorithms
Proceedings of the 2nd ACM conference on Electronic commerce
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
Generating Satisfiable Problem Instances
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Combinatorial Auctions, Knapsack Problems, and Hill-Climbing Search
AI '01 Proceedings of the 14th Biennial Conference of the Canadian Society on Computational Studies of Intelligence: Advances in Artificial Intelligence
Combinatorial Auctions: A Survey
INFORMS Journal on Computing
An algorithm for optimal winner determination in combinatorial auctions
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
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
Where the really hard problems are
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Backbones in optimization and approximation
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
The exponentiated subgradient algorithm for heuristic Boolean programming
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
CABOB: a fast optimal algorithm for combinatorial auctions
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 2
Problem structure in the presence of perturbations
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
A bayesian approach to tackling hard computational problems
UAI'01 Proceedings of the Seventeenth conference on Uncertainty in artificial intelligence
Run the GAMUT: A Comprehensive Approach to Evaluating Game-Theoretic Algorithms
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 2
Propositional Satisfiability and Constraint Programming: A comparative survey
ACM Computing Surveys (CSUR)
Markets vs auctions: Approaches to distributed combinatorial resource scheduling
Multiagent and Grid Systems - Smart Grid Technologies & Market Models
A Branch-and-Price Algorithm and New Test Problems for Spectrum Auctions
Management Science
A comparison of distributed and centralised agent based bundling systems
Proceedings of the ninth international conference on Electronic commerce
Cross-disciplinary perspectives on meta-learning for algorithm selection
ACM Computing Surveys (CSUR)
Empirical hardness models: Methodology and a case study on combinatorial auctions
Journal of the ACM (JACM)
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
An experimental investigation of model-based parameter optimisation: SPO and beyond
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
An Efficient and Adaptive Mechanism for Parallel Simulation Replication
PADS '09 Proceedings of the 2009 ACM/IEEE/SCS 23rd Workshop on Principles of Advanced and Distributed Simulation
Matrix Bidding in Combinatorial Auctions
Operations Research
GROWRANGE: anytime VCG-based mechanisms
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Low-knowledge algorithm control
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
Bid evaluation in combinatorial auctions: optimization and learning
Software—Practice & Experience
SATzilla: portfolio-based algorithm selection for SAT
Journal of Artificial Intelligence Research
A portfolio approach to algorithm select
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Performance prediction for RNA design using parametric and non-parametric regression models
CIBCB'09 Proceedings of the 6th Annual IEEE conference on Computational Intelligence in Bioinformatics and Computational Biology
ParamILS: an automatic algorithm configuration framework
Journal of Artificial Intelligence Research
Hierarchical hardness models for SAT
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
SATzilla-07: the design and analysis of an algorithm portfolio for SAT
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Online estimation of SAT solving runtime
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Practical performance models of algorithms in evolutionary program induction and other domains
Artificial Intelligence
ANTS'10 Proceedings of the 7th international conference on Swarm intelligence
Algorithm selection as a bandit problem with unbounded losses
LION'10 Proceedings of the 4th international conference on Learning and intelligent optimization
A constraint satisfaction framework for executing perceptions and actions in diagrammatic reasoning
Journal of Artificial Intelligence Research
Combining Constraint Programming and Local Search for Job-Shop Scheduling
INFORMS Journal on Computing
Tradeoffs in the empirical evaluation of competing algorithm designs
Annals of Mathematics and Artificial Intelligence
Enhancing accuracy of hybrid packing systems through general-purpose characterization
HAIS'11 Proceedings of the 6th international conference on Hybrid artificial intelligent systems - Volume Part II
Review: Measuring instance difficulty for combinatorial optimization problems
Computers and Operations Research
Algorithm portfolio selection as a bandit problem with unbounded losses
Annals of Mathematics and Artificial Intelligence
Discovering the suitability of optimisation algorithms by learning from evolved instances
Annals of Mathematics and Artificial Intelligence
Performance prediction and automated tuning of randomized and parametric algorithms
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
An evaluation of machine learning in algorithm selection for search problems
AI Communications - The Symposium on Combinatorial Search
Models of performance of time series forecasters
Neurocomputing
Algorithm runtime prediction: Methods & evaluation
Artificial Intelligence
Contrasting meta-learning and hyper-heuristic research: the role of evolutionary algorithms
Genetic Programming and Evolvable Machines
| Hi-index | 0.00 |
We propose a new approach for understanding the algorithm-specific empiricalh ardness of NP-Hard problems. In this work we focus on the empirical hardness of the winner determination problem--an optimization problem arising in combinatorial auctions--when solved by ILOG's CPLEX software. We consider nine widely-used problem distributions and sample randomly from a continuum of parameter settings for each distribution. We identify a large number of distribution-nonspecific features of data instances and use statisticalregression techniques to learn, evaluate and interpret a function from these features to the predicted hardness of an instance.