Auction optimization using regression trees and linear models as integer programs
From MaRDI portal
(Redirected from Publication:511796)
Abstract: In a sequential auction with multiple bidding agents, it is highly challenging to determine the ordering of the items to sell in order to maximize the revenue due to the fact that the autonomy and private information of the agents heavily influence the outcome of the auction. The main contribution of this paper is two-fold. First, we demonstrate how to apply machine learning techniques to solve the optimal ordering problem in sequential auctions. We learn regression models from historical auctions, which are subsequently used to predict the expected value of orderings for new auctions. Given the learned models, we propose two types of optimization methods: a black-box best-first search approach, and a novel white-box approach that maps learned models to integer linear programs (ILP) which can then be solved by any ILP-solver. Although the studied auction design problem is hard, our proposed optimization methods obtain good orderings with high revenues. Our second main contribution is the insight that the internal structure of regression models can be efficiently evaluated inside an ILP solver for optimization purposes. To this end, we provide efficient encodings of regression trees and linear regression models as ILP constraints. This new way of using learned models for optimization is promising. As the experimental results show, it significantly outperforms the black-box best-first search in nearly all settings.
Recommendations
Cites work
- scientific article; zbMATH DE number 3860199 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2090195 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- A Smart Market for Industrial Procurement with Capacity Constraints
- A mixed-integer programming approach to multi-class data classification problem
- Bilinear separation of two sets in n-space
- Budget-constrained sequential auctions with incomplete information
- Combinatorial auctions. Foreword by Vernon L. Smith.
- Derivative-free optimization: a review of algorithms and comparison of software implementations
- Discovering dispatching rules using data mining
- Efficient global optimization of expensive black-box functions
- Exact DFA Identification Using SAT Solvers
- Grammatical inference. Learning automata and grammars.
- Multiple-object auctions with budget constrained bidders
- Optimization and analysis aid via data-mining for simulated production systems
- Pattern recognition and machine learning.
- Robust optimization
- Scikit-learn: machine learning in Python
- Structured learning with constrained conditional models
- Supervised classification and mathematical optimization
- Surrogate-based methods
- Survey of modeling and optimization strategies to solve high-dimensional design problems with computationally-expensive black-box functions
- Synergies between operations research and data mining: the emerging use of multi-objective approaches
- Synergies of operations research and data mining
- The Importance of Ordering in Sequential Auctions
- The interplay of optimization and machine learning research
- Using bid data for the management of sequential, multi-unit, online auctions with uniformly distributed bidder valuations
Cited in
(12)- Mathematical optimization in classification and regression trees
- Injecting domain knowledge in neural networks: a controlled experiment on a constrained problem
- Classifier-based constraint acquisition
- Optimal randomized classification trees
- On optimal regression trees to detect critical intervals for multivariate functional data
- Learning decision trees with flexible constraints and objectives using integer optimization
- Column generation based heuristic for learning classification trees
- Sparsity in optimal randomized classification trees
- Optimization problems for machine learning: a survey
- Data driven design for online industrial auctions
- Mixed-Integer Convex Nonlinear Optimization with Gradient-Boosted Trees Embedded
- Black-box combinatorial optimization using models with integer-valued minima
This page was built for publication: Auction optimization using regression trees and linear models as integer programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q511796)
