Dynamic Programming and Decision Theory
From MaRDI portal
Publication:5722654
DOI10.2307/2985407zbMath0114.34904OpenAlexW2797720335WikidataQ92167369 ScholiaQ92167369MaRDI QIDQ5722654
Publication date: 1961
Published in: Applied Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2985407
Related Items (82)
Multi-criteria optimal stopping methods applied to the portfolio optimisation problem ⋮ Expected duration of the no-information minimum rank problem ⋮ Secretary Markets with Local Information ⋮ The Secretary Problem—An Update ⋮ The Temp Secretary Problem ⋮ OPTIMAL SELECTION OF THE k-TH BEST CANDIDATE ⋮ Optimale Rangstrategien in sequentiellen Auswahlprozessen ⋮ Two Rationales Behind the ‘Buy-And-Hold or Sell-At-Once’ Strategy ⋮ Primal Beats Dual on Online Packing LPs in the Random-Order Model ⋮ Online network design with outliers ⋮ What is Known About Robbins' Problem? ⋮ The multi-returning secretary problem ⋮ Finding the second-best candidate under the Mallows model ⋮ New results for the \(k\)-secretary problem ⋮ Generelle Nutzenrelationen in Rang-Auswahlprozessen ⋮ Optimal rules for the sequential selection of uniform spacings ⋮ A Framework for the Secretary Problem on the Intersection of Matroids ⋮ An optimal algorithm for stopping on the element closest to the center of an interval ⋮ The best choice problem for upward directed graphs ⋮ A satisficing policy of the secretary problem: theory and simulation ⋮ Hunting for superstars ⋮ A unified approach for solving sequential selection problems ⋮ Query-based selection of optimal candidates under the Mallows model ⋮ Optimal stopping for many connected components in a graph ⋮ Machine covering in the random-order model ⋮ Secretary and online matching problems with machine learned advice ⋮ A new look at the returning secretary problem ⋮ The best-or-worst and the postdoc problems with random number of candidates ⋮ The secretary problem as a model of choice ⋮ Competitive weighted matching in transversal matroids ⋮ Knapsack secretary through boosting ⋮ Generalized Sequential Stochastic Assignment Problem ⋮ Uniformly Bounded Regret in the Multisecretary Problem ⋮ Analysis of heuristic solutions to the best choice problem. ⋮ The secretary problem with reservation costs ⋮ Gusein-Zade problem for directed path ⋮ Dynamic programming and the secretary problem ⋮ The best choice problem for a union of two linear orders with common maximum ⋮ Optimal stopping problems by two or more decision makers: a survey ⋮ Secretary problems with inspection costs as a game ⋮ Herbert Robbins and sequential analysis ⋮ An efficient algorithm for stopping on a sink in a directed graph ⋮ Las medidas de f*-divergencia en el diseno secuencial de experimentos en un contexto bayesiano ⋮ Improved Online Algorithms for Knapsack and GAP in the Random Order Model ⋮ The Submodular Secretary Problem Goes Linear ⋮ Maximizing the expected number of components in an online search of a graph ⋮ The best-or-worst and the postdoc problems ⋮ Optimal liquidation problem in illiquid markets ⋮ Optimal Online Selection of an Alternating Subsequence: A Central Limit Theorem ⋮ Optimal stopping for Brownian motion with applications to sequential analysis and option pricing ⋮ Secretary markets with local information ⋮ An interactive method for the optimal selection problem with two decision makers ⋮ The solution of a generalized secretary problem via analytic expressions ⋮ Sum the Multiplicative Odds to One and Stop ⋮ An Optimal Stopping Problem with Two Decision Makers ⋮ On variants of the matroid secretary problem ⋮ Unnamed Item ⋮ Percolation and best-choice problem for powers of paths ⋮ Buying and selling an asset over the finite time horizon: a non-parametric approach ⋮ Optimal partitioning of groups in selecting the best choice ⋮ Improved online algorithms for Knapsack and GAP in the random order model ⋮ The best choice problem for posets; colored complete binary trees ⋮ The Matroid Secretary Problem for Minor-Closed Classes and Random Matroids ⋮ Optimal selection based on relative rank (the 'Secretary Problem') ⋮ An optimal pattern classification system using dynamic programming ⋮ A Secretary Problem with Many Lives ⋮ A Simple O(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem ⋮ Clairvoyant Mechanisms for Online Auctions ⋮ Improved Competitive Ratios for Submodular Secretary Problems (Extended Abstract) ⋮ Optimal stopping in a search for a vertex with full degree in a random graph ⋮ A nonparametric predictive approach to sequential acceptance problems ⋮ Strong Algorithms for the Ordinal Matroid Secretary Problem ⋮ Improved online algorithm for fractional knapsack in the random order model ⋮ Counting embeddings of rooted trees into families of rooted trees ⋮ Online Resource Allocation Under Partially Predictable Demand ⋮ From Directed Path to Linear Order---The Best Choice Problem for Powers of Directed Path ⋮ Where should you park your car? The $\frac{1}{2}$ rule ⋮ Unnamed Item ⋮ A multi-attribute extension of the secretary problem: theory and experiments ⋮ A new method for computing asymptotic results in optimal stopping problems ⋮ Secretary problem with hidden information; searching for a high merit candidate ⋮ Progressive stopping heuristics that excel in individual and competitive sequential search
This page was built for publication: Dynamic Programming and Decision Theory
