Pages that link to "Item:Q802201"
From MaRDI portal
The following pages link to A unified approach to a class of best choice problems with an unknown number of options (Q802201):
Displaying 39 items.
- Stochastic processes with proportional increments and the last-arrival problem (Q444355) (← links)
- Choosing either the best or the second best when the number of applicants is random (Q597360) (← links)
- Minimax-optimal stop rules and distributions in secretary problems (Q756847) (← links)
- No-information secretary problems with cardinal payoffs and Poisson arrivals (Q844877) (← links)
- A unified approach to a class of optimal selection problems with an unknown number of options (Q1075691) (← links)
- The secretary problem for a random walk (Q1104634) (← links)
- Invariant record processes and applications to best choice modelling (Q1116180) (← links)
- Embedding optimal selection problems in a Poisson process (Q1177212) (← links)
- Rank-based selection strategies for the random walk process (Q1278511) (← links)
- Strategies in the secretary problem (Q1329670) (← links)
- The best-choice secretary problem with random freeze on jobs (Q1346162) (← links)
- On best choice problems having similar solutions (Q1613007) (← links)
- Iterated full information secretary problem (Q1683938) (← links)
- The solution of a generalized secretary problem via analytic expressions (Q2012898) (← links)
- The best choice problem with random arrivals: how to beat the \(1 / e\)-strategy (Q2074989) (← links)
- The 1/e-strategy is sub-optimal for the problem of best choice under no information (Q2145815) (← links)
- The secretary problem with biased arrival order via a Mallows distribution (Q2155929) (← links)
- Strategy-indifferent games of best choice (Q2237240) (← links)
- Hint, extortion, and guessing games in the best choice problem (Q2263295) (← links)
- The best-or-worst and the postdoc problems with random number of candidates (Q2424796) (← links)
- A generalized secretary problem (Q2816630) (← links)
- The secretary problem on an unknown poset (Q2868083) (← links)
- The Noisy Secretary Problem and Some Results on Extreme Concomitant Variables (Q3165497) (← links)
- Maximizing the probability of stopping on any of the last <i>m</i> successes in independent Bernoulli trials with random horizon (Q3173004) (← links)
- Optimal Choice of the Best Available Applicant in Full-Information Models (Q3402060) (← links)
- Recognising the last record of sequence (Q3429340) (← links)
- The Temp Secretary Problem (Q3452826) (← links)
- Adaptive approach to some stopping problems (Q3697988) (← links)
- (Q4225599) (← links)
- A SECRETARY PROBLEM WITH UNCERTAIN EMPLOYMENT WHEN THE NUMBER OF OFFERS IS RESTRICTED (Q4345048) (← links)
- Duration of a secretary problem (Q4358605) (← links)
- Some Extensions of Generalized Secretary Problem (Q4734632) (← links)
- An application of prophet regions to optimal stopping with a random number of observations (Q4820395) (← links)
- The Secretary Problem—An Update (Q5054129) (← links)
- Dokładna i asymptotyczna analiza rozwiązań optymalnych problemów zatrzymania Brussa i Webera (Q5135617) (← links)
- Odds -theorem and monotonicity (Q5135657) (← links)
- An Explicit Formula for the Optimal Gain in the Full-Information Problem of Owning a Relatively Best Object (Q5488991) (← links)
- When to stop consulting (Q6494740) (← links)
- Mathematical intuition, deep learning, and Robbins' problem (Q6554586) (← links)