The Best-or-Worst and the Postdoc problems-Reference-Cited by-同舟云学术

The Best-or-Worst and the Postdoc problems

Published:2017-11-16 Issue:3 Volume:35 Page:703-723
ISSN:1382-6905
Container-title:Journal of Combinatorial Optimization
language:en
Short-container-title:J Comb Optim

Author:

Bayón L.,Fortuny Ayuso P.,Grau J. M.^ORCID,Oller-Marcén A. M.^ORCID,Ruiz M. M.

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/article/10.1007/s10878-017-0203-4/fulltext.html

Reference18 articles.

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

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

3. Daley DJ, Kendall DG (1965) Stochastic rumours. J Inst Math Appl 1:42–55

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 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Mathematical Intuition, Deep Learning, and Robbins’ Problem;Jahresbericht der Deutschen Mathematiker-Vereinigung;2024-02-21

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

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

4. Finding the second-best candidate under the Mallows model;Theoretical Computer Science;2022-09

5. The Postdoc Problem under the Mallows Model;2021 IEEE International Symposium on Information Theory (ISIT);2021-07-12