Empirical hardness models, methodology and a case study on combinatorial auctions

DOI10.1145/1538902.1538906MaRDI QIDQ3452218zbMATHOpenAlexWikidataFDO

Authors Kevin Leyton-Brown, Eugene Nudelman, Yoav Shoham

Publication date 11 November 2015

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1538902.1538906

zbMATH Keywords

runtime predictionalgorithm portfolioscombinatorial auctionsempirical analysis of algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Auctions, bargaining, bidding and selling, and other market models (91B26) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Algorithm runtime prediction: methods \& evaluation
• Performance Prediction and Automated Tuning of Randomized and Parametric Algorithms
• A Bayesian approach to tackling hard computational problems. (Preliminary report)
• Hierarchical Hardness Models for SAT
• A machine learning approach to algorithm selection for \(\mathcal{NP}\)-hard optimization problems: a case study on the MPE problem

Cited in

(19)

• Evolutionary Computation in Combinatorial Optimization
• Generation techniques for linear programming instances with controllable properties
• A Bayesian approach to tackling hard computational problems. (Preliminary report)
• Practical performance models of algorithms in evolutionary program induction and other domains
• A faster tree-decomposition based algorithm for counting linear extensions
• A faster tree-decomposition based algorithm for counting linear extensions
• Algorithms and mechanisms for procuring services with uncertain durations using redundancy
• Discovering the suitability of optimisation algorithms by learning from evolved instances
• Online over time processing of combinatorial problems
• Learning dynamic algorithm portfolios
• Efficient benchmarking of algorithm configurators via model-based surrogates
• Metalearning and algorithm selection: progress, state of the art and introduction to the 2018 special issue
• Compact bidding languages and supplier selection for markets with economies of scale and scope
• A PAC Approach to Application-Specific Algorithm Selection
• A machine learning approach to algorithm selection for \(\mathcal{NP}\)-hard optimization problems: a case study on the MPE problem
• Algorithm runtime prediction: methods \& evaluation
• Empirical decision model learning
• Hierarchical Hardness Models for SAT
• Performance Prediction and Automated Tuning of Randomized and Parametric Algorithms

This page was built for publication: Empirical hardness models, methodology and a case study on combinatorial auctions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3452218)