Pages that link to "Item:Q2525084"

The following pages link to Optimal selection based on relative rank (the 'Secretary Problem') (Q2525084):

Displaying 48 items.

• Online \((J, K)\)-search problem and its competitive analysis (Q501005) (← links)
• An interactive method for the optimal selection problem with two decision makers (Q704098) (← links)
• Expected duration of the no-information minimum rank problem (Q826693) (← links)
• On an optimal stopping problem of Gusein-Zade (Q1140921) (← links)
• The secretary problem as a model of choice (Q1146483) (← links)
• Secretary problems with inspection costs as a game (Q1171846) (← links)
• Selecting the best choice in the weighted secretary problem (Q1268240) (← links)
• Dynamic programming formulation of the group interview problem with a general utility function (Q1341989) (← 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)
• Multi-criteria optimal stopping methods applied to the portfolio optimisation problem (Q1615933) (← links)
• Online algorithms for the multiple time series search problem (Q1762061) (← links)
• A secretary problem on fuzzy sets (Q1906575) (← 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)
• A unified approach for solving sequential selection problems (Q2188431) (← links)
• A nonparametric predictive approach to sequential acceptance problems (Q2320771) (← links)
• The best choice problem for a union of two linear orders with common maximum (Q2446902) (← links)
• Asymmetric equilibria in dynamic two-sided matching markets with independent preferences (Q2482672) (← links)
• A rank-based approach to the sequential selection and assignment problem (Q2503101) (← links)
• Optimal selection problems based on exchangeable trials (Q2564692) (← links)
• A multi-attribute extension of the secretary problem: theory and experiments (Q2581773) (← links)
• Sequential selections with minimization of failure (Q2677694) (← links)
• A model of finite-step random walk with absorbent boundaries (Q3543515) (← links)
• The secretary problem of minimizing the expected rank: a simple suboptimal approach with generalizations (Q3558937) (← links)
• A Continuous-Time Approach to Robbins' Problem of Minimizing the Expected Rank (Q3621144) (← links)
• ON A multi-person time-sequential game with priorities (Q3772011) (← links)
• Remarks on the Secretary Problem (Q3988370) (← links)
• The secretary problem: optimal selection with interview cost from two groups of candidates (Q4322931) (← links)
• Minimax strategies for discounted ?secretary problems? with interview costs (Q4698116) (← links)
• On-line VWAP Trading Strategies (Q4931850) (← links)
• Sum the Multiplicative Odds to One and Stop (Q4933198) (← links)
• The Secretary Problem—An Update (Q5054129) (← links)
• Optimal rules for the sequential selection of uniform spacings (Q5086637) (← links)
• Generalized Sequential Stochastic Assignment Problem (Q5113887) (← links)
• Uniformly Bounded Regret in the Multisecretary Problem (Q5113899) (← links)
• (Q5223069) (← links)
• What is Known About Robbins' Problem? (Q5312844) (← links)
• NASH EQUILIBRIUM IN TWO-SIDED MATE CHOICE PROBLEM (Q5324559) (← links)
• Optimale Rangstrategien in sequentiellen Auswahlprozessen (Q5580812) (← links)
• Generelle Nutzenrelationen in Rang-Auswahlprozessen (Q5623471) (← links)
• Where should you park your car? The $\frac{1}{2}$ rule (Q5854149) (← links)
• Buying and selling an asset over the finite time horizon: a non-parametric approach (Q5955095) (← links)
• Optimal partitioning of groups in selecting the best choice (Q5955972) (← links)
• Hunting for superstars (Q6051341) (← links)
• Mathematical intuition, deep learning, and Robbins' problem (Q6554586) (← links)
• Two measures of efficiency for the secretary problem with multiple items at each rank (Q6614408) (← links)