Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Bruss, F.Thomas
1988.
Invariant record processes and applications to best choice modelling.
Stochastic Processes and their Applications,
Vol. 30,
Issue. 2,
p.
303.
Stadje, W.
1990.
A full information pricing problem for the sale of several identical commodities.
ZOR Zeitschrift f�r Operations Research Methods and Models of Operations Research,
Vol. 34,
Issue. 3,
p.
161.
1998.
Records.
p.
279.
Bruss, F. Thomas
and
Ferguson, Thomas S.
2002.
High-risk and competitive investment models.
The Annals of Applied Probability,
Vol. 12,
Issue. 4,
Kurushima, Aiko
and
Ano, Katsunori
2003.
A note on the full-information Poisson arrival selection problem.
Journal of Applied Probability,
Vol. 40,
Issue. 04,
p.
1147.
Bruss, F. Thomas
and
Louchard, Guy
2003.
Optimal stopping on patterns in strings generated by independent random variables.
Journal of Applied Probability,
Vol. 40,
Issue. 01,
p.
49.
Ben Abdelaziz, F.
and
Krichen, S.
2005.
An interactive method for the optimal selection problem with two decision makers.
European Journal of Operational Research,
Vol. 162,
Issue. 3,
p.
602.
Szajowski, Krzysztof
2007.
A game version of the Cowan–Zabczyk–Bruss’ problem.
Statistics & Probability Letters,
Vol. 77,
Issue. 17,
p.
1683.
Krasnosielska, Anna
2009.
A version of the Elfving problem with random starting time.
Statistics & Probability Letters,
Vol. 79,
Issue. 23,
p.
2429.
Kurushima, Aiko
and
Ano, Katsunori
2009.
Maximizing the Expected Duration of Owning a Relatively Best Object in a Poisson Process with Rankable Observations.
Journal of Applied Probability,
Vol. 46,
Issue. 2,
p.
402.
Bayraktar, Erhan
and
Ludkovski, Michael
2010.
OPTIMAL TRADE EXECUTION IN ILLIQUID MARKETS.
Mathematical Finance,
p.
no.
Ferenstein, Elżbieta Z.
and
Krasnosielska, Anna
2010.
No-information secretary problems with cardinal payoffs and Poisson arrivals.
Statistics & Probability Letters,
Vol. 80,
Issue. 3-4,
p.
221.
Das, Sanmay
and
Tsitsiklis, John N.
2010.
When is it important to know you’ve been rejected? A search problem with probabilistic appearance of offers.
Journal of Economic Behavior & Organization,
Vol. 74,
Issue. 1-2,
p.
104.
Tamaki, Mitsushi
and
Wang, Qi
2010.
Optimization and Optimal Control.
Vol. 39,
Issue. ,
p.
499.
Bayón, L.
Fortuny, P.
Grau, J.
Oller-Marcén, A. M.
and
Ruiz, M. M.
2019.
The Best-or-Worst and the Postdoc problems with random number of candidates.
Journal of Combinatorial Optimization,
Vol. 38,
Issue. 1,
p.
86.
Gnedin, Alexander
2022.
The best choice problem with random arrivals: How to beat the 1/e-strategy.
Stochastic Processes and their Applications,
Vol. 145,
Issue. ,
p.
226.
Gnedin, Alexander
and
Derbazi, Zakaria
2022.
Trapping the Ultimate Success.
Mathematics,
Vol. 10,
Issue. 1,
p.
158.
Perez-Salazar, Sebastian
Singh, Mohit
and
Toriello, Alejandro
2024.
Robust Online Selection with Uncertain Offer Acceptance.
Mathematics of Operations Research,
Gnedin, Alexander
and
Derbazi, Zakaria
2024.
The last-success stopping problem with random observation times.
Mathematical Methods of Operations Research,