Dynamic Programming and Decision Theory
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1455133
- scientific article; zbMATH DE number 3174053
- scientific article; zbMATH DE number 4061056
- The theory of dynamic programming
- Decision methods of dynamic programming equations
- Dynamic programming and stochastic control
- scientific article; zbMATH DE number 53073
- scientific article; zbMATH DE number 5866260
- scientific article; zbMATH DE number 1260458
- scientific article; zbMATH DE number 1431652
Cited in
(95)- Expected duration of the no-information minimum rank problem
- A nonparametric predictive approach to sequential acceptance problems
- The best choice problem for a union of two linear orders with common maximum
- Optimale Rangstrategien in sequentiellen Auswahlprozessen
- Optimal rules for the sequential selection of uniform spacings
- Primal beats dual on online packing LPs in the random-order model
- The Secretary Problem—An Update
- A new method for computing asymptotic results in optimal stopping problems
- Strong algorithms for the ordinal matroid secretary problem
- A Framework for the Secretary Problem on the Intersection of Matroids
- The multi-returning secretary problem
- Improved Online Algorithms for Knapsack and GAP in the Random Order Model
- A satisficing policy of the secretary problem: theory and simulation
- Las medidas de f*-divergencia en el diseno secuencial de experimentos en un contexto bayesiano
- Secretary problem with hidden information; searching for a high merit candidate
- Progressive stopping heuristics that excel in individual and competitive sequential search
- The best-or-worst and the postdoc problems with random number of candidates
- Multi-criteria optimal stopping methods applied to the portfolio optimisation problem
- An optimal algorithm for stopping on the element closest to the center of an interval
- A new look at the returning secretary problem
- Secretary markets with local information
- An interactive method for the optimal selection problem with two decision makers
- The submodular secretary problem goes linear
- Generelle Nutzenrelationen in Rang-Auswahlprozessen
- The best-or-worst and the postdoc problems
- Competitive secretary problem
- Secretary markets with local information
- The solution of a generalized secretary problem via analytic expressions
- The Temp Secretary Problem
- Using dynamic programming to determine an optimal strategy in a contract bridge tournament
- Optimal selection based on relative rank (the 'Secretary Problem')
- Optimal stopping problems by two or more decision makers: a survey
- An efficient algorithm for stopping on a sink in a directed graph
- A unified approach for solving sequential selection problems
- Herbert Robbins and sequential analysis
- The best choice problem for posets; colored complete binary trees
- Query-based selection of optimal candidates under the Mallows model
- Improved online algorithms for knapsack and GAP in the random order model
- A simple \(O(\log\log(\mathrm{rank}))\)-competitive algorithm for the matroid secretary problem
- Optimal stopping for Brownian motion with applications to sequential analysis and option pricing
- Optimal partitioning of groups in selecting the best choice
- Percolation and best-choice problem for powers of paths
- Optimal liquidation problem in illiquid markets
- Online resource allocation under partially predictable demand
- Dynamic programming approach to optimization of approximate decision rules
- The matroid secretary problem for minor-closed classes and random matroids
- What is Known About Robbins' Problem?
- Clairvoyant mechanisms for online auctions
- Optimal online selection of an alternating subsequence: a central limit theorem
- Dynamic Programming and Systems of Uncertain Duration
- Secretary and online matching problems with machine learned advice
- Competition and recall in selection problems
- The best choice problem for upward directed graphs
- From directed path to linear order -- the best choice problem for powers of directed path
- New results for the \(k\)-secretary problem
- Online network design with outliers
- Buying and selling an asset over the finite time horizon: a non-parametric approach
- Optimal stopping in a search for a vertex with full degree in a random graph
- Finding the second-best candidate under the Mallows model
- Improved competitive ratios for submodular secretary problems (extended abstract)
- Laminar matroid secretary: greedy strikes back
- OPTIMAL SELECTION OF THE k-TH BEST CANDIDATE
- Improved competitive ratio for the matroid secretary problem
- Sum the multiplicative odds to one and stop
- Secretary problems with inspection costs as a game
- Knapsack secretary through boosting
- Two Rationales Behind the ‘Buy-And-Hold or Sell-At-Once’ Strategy
- The secretary problem as a model of choice
- Generalized assignment and knapsack problems in the random-order model
- Matroid secretary via labeling schemes
- Competitive analysis with a sample and the secretary problem
- Online bipartite matching in the probe-commit model
- Dynamic programming and the secretary problem
- Analysis of heuristic solutions to the best choice problem.
- Uniformly bounded regret in the multisecretary problem
- Optimal stopping methodology for the secretary problem with random queries
- Competitive weighted matching in transversal matroids
- Machine covering in the random-order model
- An optimal pattern classification system using dynamic programming
- Generalized sequential stochastic assignment problem
- A survey of online knapsack problems
- Where should you park your car? The $\frac{1}{2}$ rule
- The secretary problem with reservation costs
- Gusein-Zade problem for directed path
- Improved online algorithm for fractional knapsack in the random order model
- Counting embeddings of rooted trees into families of rooted trees
- Hiring strategies
- Hunting for superstars
- An Optimal Stopping Problem with Two Decision Makers
- Optimal stopping for many connected components in a graph
- scientific article; zbMATH DE number 4122712 (Why is no real title available?)
- Maximizing the expected number of components in an online search of a graph
- A multi-attribute extension of the secretary problem: theory and experiments
- A Secretary Problem with Many Lives
- Submodular secretary problem with shortlists
This page was built for publication: Dynamic Programming and Decision Theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5722654)
