Related papers: On the $1/e$-strategy for the best-choice problem …
This paper answers a long-standing open question concerning the $1/e$-strategy for the problem of best choice. $N$ candidates for a job arrive at times independently uniformly distributed in $[0,1]$. The interviewer knows how each candidate…
In the best choice problem with random arrivals, an unknown number $n$ of rankable items arrive at times sampled from the uniform distribution. As is well known, a real-time player can ensure stopping at the overall best item with…
The odds theorem and the corresponding solution algorithm (odds algorithm) are tools to solve a wide range of optimal stopping problems. Its generality and tractability have caught much attention. (Google for instance "Bruss odds" to obtain…
This paper is withdrawn due to some errors, which are corrected in arXiv:0912.0071v4 [cs.LG].
The paper has been withdrawn due to an error in Lemma 1.
In a classical optimal stopping problem the aim is to maximize the expected value of a functional of a diffusion evaluated at a stopping time. This note considers optimal stopping problems beyond this paradigm. We study problems in which…
This paper has been withdrawn by the author, due a crucial error in the optimization. For the last one month I have been trying to remove the error, but it seems to take a lot of time so I decided to withdraw this paper for the moment.
This version withdrawn by arXiv administrators because the submitter did not have the right to agree to our license at the time of submission.
The author decided to withdraw this paper by 1) an error in Lemma 5.11 (and 5.12) which requires some justification; 2) the main result of this paper suffers overlap with arXiv:1203.5254; 3) the author decided to split arXiv:1203.5254 into…
This paper has been withdrawn by the author, due an error in claim 1.
This paper has been withdrawn. See v1 still available to understand the problem: Proposition 2.2 is false. The error in the proof is in claim (3). Then, the whole paper collapses. We do not have any correction for now. We apologize to…
We consider stopping problems in which a decision maker (DM) faces an unknown state of nature and decides sequentially whether to stop and take an irreversible action; pay a fee and obtain additional information; or wait without acquiring…
This paper has been withdrawn by the authors pending corrections.
The last success problem is an optimal stopping problem that aims to maximize the probability of stopping on the last success in a sequence of independent $n$ Bernoulli trials. In the classical setting where complete information about the…
This paper extends the optimal-trading framework developed in arXiv:2409.03586v1 to compute optimal strategies with real-world constraints. The aim of the current paper, as with the previous, is to study trading in the context of…
We consider a simple optimal probabilistic problem solving strategy that searches through potential solution candidates in a specific order. We are interested in what impact has interchanging the order of two solution candidates with…
We study the online stochastic bipartite matching problem, in a form motivated by display ad allocation on the Internet. In the online, but adversarial case, the celebrated result of Karp, Vazirani and Vazirani gives an approximation ratio…
This paper has been withdrawn by the author because it has been substantially modified.
This paper has been withdrawn by the author due to an error.
Chance-constrained problems involve stochastic components in the constraints which can be violated with a small probability. We investigate the impact of different types of chance constraints on the performance of iterative search…