Pages that link to "Item:Q3664260"

The following pages link to The Secretary Problem and Its Extensions: A Review (Q3664260):

Displaying 50 items.

• Shrinking maxima, decreasing costs: new online packing and covering problems (Q289907) (← links)
• The simulated greedy algorithm for several submodular matroid secretary problems (Q290918) (← links)
• Multi-attribute sequential decision problem with optimizing and satisficing attributes (Q319056) (← links)
• Lending decisions with limits on capital available: the polygamous marriage problem (Q320958) (← links)
• Online network design with outliers (Q334928) (← links)
• The best choice problem under ambiguity (Q372378) (← links)
• Analysis of the ``hiring above the median'' selection strategy for the hiring problem (Q378233) (← links)
• Analysis of the strategy ``hiring above the \(m\)-th best candidate'' (Q486994) (← links)
• Delay-tolerant delivery of quality information in ad hoc networks (Q635374) (← links)
• An interactive method for the optimal selection problem with two decision makers (Q704098) (← links)
• The secretary problem with a call option (Q800824) (← links)
• When to stop -- a cardinal secretary search experiment (Q826903) (← links)
• Dynamic programming and the secretary problem (Q918875) (← links)
• Optimal stopping problems by two or more decision makers: a survey (Q926553) (← links)
• The full-information best choice problem with a random number of observations (Q1091672) (← links)
• The secretary problem for a random walk (Q1104634) (← links)
• Invariant record processes and applications to best choice modelling (Q1116180) (← links)
• Optimal choice and assignment of the best \(m\) of \(n\) randomly arriving items (Q1180196) (← links)
• A secretary problem with restricted offering chances and random number of applications (Q1206122) (← links)
• Optimal stopping in urn models with payoff depending on maximal observed element (Q1210126) (← links)
• Selecting the best choice in the weighted secretary problem (Q1268240) (← links)
• Rank-based selection strategies for the random walk process (Q1278511) (← links)
• Action-timing problem with sequential Bayesian belief revision process (Q1291712) (← links)
• Explicit results for a class of asset-selling problems (Q1303546) (← links)
• Dynamic programming formulation of the group interview problem with a general utility function (Q1341989) (← links)
• An optimal stopping problem with two levels of incomplete information (Q1360874) (← links)
• Optimal selection of the \(k\) best of a sequence with \(k\) stops (Q1374694) (← links)
• Analysis of heuristic solutions to the best choice problem. (Q1406961) (← links)
• Herbert Robbins and sequential analysis (Q1429307) (← links)
• Partial-order analogue of the secretary problem: The binary tree case (Q1584204) (← links)
• Characterization of the monotone case for a best choice problem with a random number of objects (Q1613020) (← links)
• Multi-criteria optimal stopping methods applied to the portfolio optimisation problem (Q1615933) (← links)
• Know when to persist: deriving value from a stream buffer (Q1704857) (← links)
• Opportunity costs in the game of best choice (Q1733925) (← links)
• Overcoming human trafficking via operations research and analytics: opportunities for methods, models, and applications (Q1751884) (← links)
• Selecting the best choice in the full information group interview problem (Q1809843) (← links)
• The best-choice problem for partially ordered objects. (Q1969766) (← links)
• Avoiding patterns and making the best choice (Q1999721) (← links)
• The solution of a generalized secretary problem via analytic expressions (Q2012898) (← links)
• The secretary problem with multiple job vacancies and batch candidate arrivals (Q2060597) (← links)
• Counting embeddings of rooted trees into families of rooted trees (Q2088692) (← 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 secretary recommendation problem (Q2155898) (← links)
• The secretary problem with biased arrival order via a Mallows distribution (Q2155929) (← links)
• Mate choice when males are in patches: optimal strategies and good rules of thumb (Q2186550) (← links)
• A unified approach for solving sequential selection problems (Q2188431) (← links)
• Robust best choice problem (Q2216194) (← links)
• The stable marriage problem: an interdisciplinary review from the physicist's perspective (Q2231919) (← links)
• Strategy-indifferent games of best choice (Q2237240) (← links)