Approximative solutions of best choice problems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1061196
- A class of best simultaneous approximation problems
- On solutions of a class of best simultaneous approximation problems
- On a class of best-choice problems
- scientific article; zbMATH DE number 7650561
- Best approximation and optimization
- On Approximate Solutions for Combinatorial Optimization Problems
- Quick solutions for general best choice problems in continuous time
Cited in
(13)- Probability of stopping at a nondominated option
- Approximation of choice functions with a constrained set of presentations
- Optimal consistent approximation of a preference matrix in decision making
- Running minimum in the best-choice problem
- scientific article; zbMATH DE number 3922360 (Why is no real title available?)
- scientific article; zbMATH DE number 3968316 (Why is no real title available?)
- scientific article; zbMATH DE number 4020836 (Why is no real title available?)
- On a Best Choice Problem for Discounted Sequences
- Quick solutions for general best choice problems in continuous time
- Why do these quite different best-choice problems have the same solutions?
- scientific article; zbMATH DE number 849068 (Why is no real title available?)
- Optimal choice from known rewards with uncertain response
- Winning Rate in the Full-Information Best-Choice Problem
This page was built for publication: Approximative solutions of best choice problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q456197)
