scholarly journals Exploiting Multichannel Diversity in Spectrum Sharing Systems Using Optimal Stopping Rule

ETRI Journal ◽  
2012 ◽  
Vol 34 (2) ◽  
pp. 272-275 ◽  
Author(s):  
Yuhua Xu ◽  
Qihui Wu ◽  
Jinlong Wang ◽  
Alagan Anpalagan ◽  
Yitao Xu
Keyword(s):  
Optimal Stopping ◽  
Spectrum Sharing ◽  
Stopping Rule ◽  
Optimal Stopping Rule

A Multiple Stopping Problem

1994 ◽  
Vol 8 (2) ◽  
pp. 169-177 ◽  
Author(s):  
J. Preater
Keyword(s):  
Optimal Stopping ◽  
Stopping Rule ◽  
Reward Function ◽  
Optimal Stopping Rule ◽  
Multiple Stopping ◽  
Constant Observation ◽  
Independent And Identically Distributed

In the context of team recruitment, we discuss an optimal multiple stopping problem for an infinite independent and identically distributed sequence, with general reward function and constant observation cost. We establish the existence and nature of an optimal stopping rule. For the particular case where team quality is governed by the fitness of the weakest member, we show that the recruiter should be more discriminating with either a better, or a larger, group of appointees in hand.

scholarly journals OPTIMAL SELECTION OF THE k-TH BEST CANDIDATE

2019 ◽  
Vol 33 (3) ◽  
pp. 327-347
Author(s):  
Yi-Shen Lin ◽  
Shoou-Ren Hsiau ◽  
Yi-Ching Yao
Keyword(s):  
Optimal Stopping ◽  
Stopping Rule ◽  
Secretary Problem ◽  
Optimal Selection ◽  
Maximum Probability ◽  
Optimal Stopping Rule ◽  
The Subject ◽  
Selection Of

In the subject of optimal stopping, the classical secretary problem is concerned with optimally selecting the best of n candidates when their relative ranks are observed sequentially. This problem has been extended to optimally selecting the kth best candidate for k ≥ 2. While the optimal stopping rule for k=1,2 (and all n ≥ 2) is known to be of threshold type (involving one threshold), we solve the case k=3 (and all n ≥ 3) by deriving an explicit optimal stopping rule that involves two thresholds. We also prove several inequalities for p(k, n), the maximum probability of selecting the k-th best of n candidates. It is shown that (i) p(1, n) = p(n, n) > p(k, n) for 1<k<n, (ii) p(k, n) ≥ p(k, n + 1), (iii) p(k, n) ≥ p(k + 1, n + 1) and (iv) p(k, ∞): = lim n→∞p(k, n) is decreasing in k.

OPTIMAL STOPPING IN A STOCHASTIC GAME

2008 ◽  
Vol 23 (1) ◽  
pp. 51-60 ◽  
Author(s):  
Bahar Kaynar
Keyword(s):  
Optimal Stopping ◽  
Stochastic Game ◽  
Stopping Rule ◽  
The Other ◽  
Random Numbers ◽  
Optimal Stopping Rule

In this article we consider a stochastic game in which each player draws one or two random numbers between 0 and 1. Players can decide to stop after the first draw or to continue for a second draw. The decision is made without knowing the other players’ numbers or whether the other players continue for a second draw. The object of the game is to have the highest total score without going over 1. In the article, we will characterize the optimal stopping rule for each player.

Recognizing both the maximum and the second maximum of a sequence

1979 ◽  
Vol 16 (4) ◽  
pp. 803-812 ◽  
Author(s):  
M. Tamaki
Keyword(s):  
Decision Maker ◽  
Optimal Stopping ◽  
Stopping Rule ◽  
Maximum Probability ◽  
Second Best ◽  
Optimal Stopping Rule

We consider the situation in which the decision-maker is allowed to have two choices and he must choose both the best and the second best from a group of N applicants. The optimal stopping rule and the maximum probability of choosing both of them are derived.

Stopping rules for proofreading

1989 ◽  
Vol 26 (02) ◽  
pp. 304-313 ◽  
Author(s):  
T. S. Ferguson ◽  
J. P. Hardwick
Keyword(s):  
Sample Size ◽  
Optimal Stopping ◽  
Random Number ◽  
Poisson Model ◽  
Stopping Rule ◽  
Stopping Rules ◽  
Binomial Model ◽  
Fixed Sample Size ◽  
Fixed Sample ◽  
Optimal Stopping Rule

A manuscript with an unknown random numberMof misprints is subjected to a series of proofreadings in an effort to detect and correct the misprints. On thenthproofreading, each remaining misprint is detected independently with probabilitypn– 1. Each proofreading costs an amountCP&gt; 0, and if one stops afternproofreadings, each misprint overlooked costs an amountcn&gt; 0. Two models are treated based on the distribution ofM.In the Poisson model, the optimal stopping rule is seen to be a fixed sample size rule. In the binomial model, the myopic rule is optimal in many important cases. A generalization is made to problems in which individual misprints may have distinct probabilities of detection and distinct overlook costs.

A secretary problem with uncertain employment

1975 ◽  
Vol 12 (03) ◽  
pp. 620-624 ◽  
Author(s):  
M. H. Smith
Keyword(s):  
Optimal Stopping ◽  
Stopping Rule ◽  
Secretary Problem ◽  
Maximum Probability ◽  
Fixed Probability ◽  
Optimal Stopping Rule

A ‘Secretary Problem’ with no recall but which allows the applicant to refuse an offer of employment with a fixed probability 1 – p, (0 &lt; p &lt; 1), is considered. The optimal stopping rule and the maximum probability of employing the best applicant are derived.

Sign in / Sign up

Export Citation Format

Share Document