Pages that link to "Item:Q5722654"
From MaRDI portal
The following pages link to Dynamic Programming and Decision Theory (Q5722654):
Displayed 50 items.
- Online network design with outliers (Q334928) (← links)
- An interactive method for the optimal selection problem with two decision makers (Q704098) (← links)
- Optimal stopping in a search for a vertex with full degree in a random graph (Q765377) (← links)
- Expected duration of the no-information minimum rank problem (Q826693) (← links)
- Dynamic programming and the secretary problem (Q918875) (← links)
- Optimal stopping problems by two or more decision makers: a survey (Q926553) (← links)
- The secretary problem as a model of choice (Q1146483) (← links)
- Secretary problems with inspection costs as a game (Q1171846) (← links)
- Analysis of heuristic solutions to the best choice problem. (Q1406961) (← links)
- Herbert Robbins and sequential analysis (Q1429307) (← links)
- Multi-criteria optimal stopping methods applied to the portfolio optimisation problem (Q1615933) (← links)
- The best-or-worst and the postdoc problems (Q1743480) (← links)
- Optimal stopping for Brownian motion with applications to sequential analysis and option pricing (Q1763432) (← links)
- The best choice problem for upward directed graphs (Q1926501) (← links)
- Gusein-Zade problem for directed path (Q1952502) (← links)
- Secretary markets with local information (Q2010597) (← links)
- The solution of a generalized secretary problem via analytic expressions (Q2012898) (← links)
- On variants of the matroid secretary problem (Q2017872) (← links)
- Improved online algorithms for Knapsack and GAP in the random order model (Q2032350) (← links)
- Improved online algorithm for fractional knapsack in the random order model (Q2085749) (← links)
- Counting embeddings of rooted trees into families of rooted trees (Q2088692) (← links)
- A new method for computing asymptotic results in optimal stopping problems (Q2105922) (← links)
- Secretary problem with hidden information; searching for a high merit candidate (Q2111202) (← links)
- Progressive stopping heuristics that excel in individual and competitive sequential search (Q2112306) (← links)
- The multi-returning secretary problem (Q2166212) (← links)
- Finding the second-best candidate under the Mallows model (Q2166728) (← links)
- A unified approach for solving sequential selection problems (Q2188431) (← links)
- Maximizing the expected number of components in an online search of a graph (Q2237242) (← links)
- Optimal liquidation problem in illiquid markets (Q2242363) (← links)
- A nonparametric predictive approach to sequential acceptance problems (Q2320771) (← links)
- A new look at the returning secretary problem (Q2424722) (← links)
- The best-or-worst and the postdoc problems with random number of candidates (Q2424796) (← links)
- Competitive weighted matching in transversal matroids (Q2428661) (← links)
- The best choice problem for a union of two linear orders with common maximum (Q2446902) (← links)
- An efficient algorithm for stopping on a sink in a directed graph (Q2450610) (← links)
- Optimal selection based on relative rank (the 'Secretary Problem') (Q2525084) (← links)
- An optimal pattern classification system using dynamic programming (Q2525096) (← links)
- A multi-attribute extension of the secretary problem: theory and experiments (Q2581773) (← links)
- New results for the \(k\)-secretary problem (Q2658048) (← links)
- An optimal algorithm for stopping on the element closest to the center of an interval (Q2665754) (← links)
- The secretary problem with reservation costs (Q2695326) (← links)
- A Secretary Problem with Many Lives (Q2815355) (← links)
- Clairvoyant Mechanisms for Online Auctions (Q2817844) (← links)
- Improved Competitive Ratios for Submodular Secretary Problems (Extended Abstract) (Q3088096) (← links)
- Two Rationales Behind the ‘Buy-And-Hold or Sell-At-Once’ Strategy (Q3182424) (← links)
- Secretary Markets with Local Information (Q3449504) (← links)
- The Temp Secretary Problem (Q3452826) (← links)
- Las medidas de f*-divergencia en el diseno secuencial de experimentos en un contexto bayesiano (Q3805684) (← links)
- Primal Beats Dual on Online Packing LPs in the Random-Order Model (Q4554073) (← links)
- The Submodular Secretary Problem Goes Linear (Q4637502) (← links)