A new look at the returning secretary problem-Reference-Cited by-同舟云学术

A new look at the returning secretary problem

Published:2018-09-19 Issue:4 Volume:37 Page:1216-1236
ISSN:1382-6905
Container-title:Journal of Combinatorial Optimization
language:en
Short-container-title:J Comb Optim

Author:

Ribas J. M. Grau^ORCID

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications

Link

http://link.springer.com/content/pdf/10.1007/s10878-018-0349-8.pdf

Reference17 articles.

1. Bayón L, Fortuny P, Grau JM, Oller-Marcén AM, Ruiz MM (2017) The best-or-worst and the postdoc problems. J Comb Optim 35(3):703–723

2. Babaioff M, Immorlica N, Kleinberg R (2007) Matroids, secretary problems, and online mechanisms. In: Proceedings of SODA, pp 434–443

3. Bearden JN (2006) A new secretary problem with rank-based selection and cardinal payoffs. J Math Psychol 50:58–59

4. Dynkin EB (1963) the optimum choice of the instant for stopping a markov process. Sov Math Dokl 4:627–629

5. Ferguson TS (1989) Who solved the secretary problem? Stat Sci 4(3):282–296

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Conditional Evaluations of Sums of Sample Maxima and Records;REVSTAT-STAT J;2023

2. A New Method for Computing Asymptotic Results in Optimal Stopping Problems;Bulletin of the Malaysian Mathematical Sciences Society;2022-12-05

3. Sequential selections with minimization of failure;Journal of Mathematical Psychology;2022-12

4. The multi-returning secretary problem;Discrete Applied Mathematics;2022-10

5. An Optimal Stopping Problem for an Investing Firm;ECONOMIC COMPUTATION AND ECONOMIC CYBERNETICS STUDIES AND RESEARCH;2020-03-18