Empirical hardness models, methodology and a case study on combinatorial auctions
DOI10.1145/1538902.1538906zbMATH Open1325.68110OpenAlexW2086886584WikidataQ60521670 ScholiaQ60521670MaRDI QIDQ3452218FDOQ3452218
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
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
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)
Cited In (18)
- Algorithms and mechanisms for procuring services with uncertain durations using redundancy
- A PAC Approach to Application-Specific Algorithm Selection
- Algorithm runtime prediction: methods \& evaluation
- Online over time processing of combinatorial problems
- Learning dynamic algorithm portfolios
- Practical performance models of algorithms in evolutionary program induction and other domains
- A Faster Tree-Decomposition Based Algorithm for Counting Linear Extensions
- Discovering the suitability of optimisation algorithms by learning from evolved instances
- A Bayesian approach to tackling hard computational problems. (Preliminary report)
- A machine learning approach to algorithm selection for \(\mathcal{NP}\)-hard optimization problems: a case study on the MPE problem
- Generation techniques for linear programming instances with controllable properties
- A faster tree-decomposition based algorithm for counting linear extensions
- Compact bidding languages and supplier selection for markets with economies of scale and scope
- Hierarchical Hardness Models for SAT
- Performance Prediction and Automated Tuning of Randomized and Parametric Algorithms
- 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
- Evolutionary Computation in Combinatorial Optimization
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)
