The following pages link to Who solved the secretary problem (Q1320411):
Displaying 50 items.
- 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)
- Competitive analysis of maintaining frequent items of a stream (Q476837) (← links)
- Strategic disclosure of random variables (Q617521) (← links)
- Optimal algorithms for the online time series search problem (Q621833) (← links)
- Optimal composition ordering problems for piecewise linear functions (Q724224) (← links)
- A loss minimization problem (Q736188) (← 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)
- When to stop -- a cardinal secretary search experiment (Q826903) (← links)
- No-information secretary problems with cardinal payoffs and Poisson arrivals (Q844877) (← links)
- A sequential selection game with vetoes (Q844901) (← links)
- How much information do we need? (Q857246) (← links)
- To match or not to match: Aspects of marital matchmaking under uncertainty (Q924896) (← links)
- Modeling the search for the least costly opportunity (Q1014976) (← links)
- Equilibria of two-sided matching games with common preferences (Q1041991) (← links)
- A secretary problem with restricted offering chances and random number of applications (Q1206122) (← links)
- Selecting the best choice in the weighted secretary problem (Q1268240) (← links)
- Rank-based selection strategies for the random walk process (Q1278511) (← links)
- Explicit results for a class of asset-selling problems (Q1303546) (← links)
- The senior and junior secretaries problem (Q1319677) (← 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)
- On optimal choosing of one of the \(k\) best objects. (Q1423065) (← links)
- Partial-order analogue of the secretary problem: The binary tree case (Q1584204) (← links)
- Who solved the secretary problem? With comments and a rejoinder by the author (Q1595974) (← 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)
- Shelf life of candidates in the generalized secretary problem (Q1694784) (← links)
- Know when to persist: deriving value from a stream buffer (Q1704857) (← links)
- Opportunity costs in the game of best choice (Q1733925) (← links)
- The best-or-worst and the postdoc problems (Q1743480) (← links)
- Online algorithms for the multiple time series search problem (Q1762061) (← links)
- The best choice problem for upward directed graphs (Q1926501) (← links)
- Gusein-Zade problem for directed path (Q1952502) (← links)
- Avoiding patterns and making the best choice (Q1999721) (← links)
- Stable secretaries (Q1999964) (← links)
- Full-information best choice game with hint (Q2009175) (← links)
- Secretary markets with local information (Q2010597) (← links)
- A sharp bound for winning within a proportion of the maximum of a sequence (Q2010856) (← links)
- Hold or roll: reaching the goal in jeopardy race games (Q2015046) (← links)
- Secretary problem: graphs, matroids and greedoids (Q2068844) (← links)
- The best choice problem with random arrivals: how to beat the \(1 / e\)-strategy (Q2074989) (← 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)
- Parking game (Q2146416) (← links)
- The secretary recommendation problem (Q2155898) (← links)
