- Dataset
6
- 10.1037/e633262013-271
Stopping Rule Selection (SRS) Theory Applied to Deferred Decision Making
- Jan 01, 2013
- PsycEXTRA Dataset
- Mario Fific + 1 more +1
Stopping Rule Selection (SRS) Theory Applied to Deferred Decision Making
On a generalized disorder problem
Stopping Rule Selection (SRS) Theory Applied to Deferred Decision Making
Stopping Rule Selection (SRS) Theory Applied to Deferred Decision Making
Optimal stopping rules for correlated random walks with a discount
Optimal stopping rules are developed for the correlated random walk when future returns are discounted by a constant factor per unit time. The optimal rule is shown to be of dual threshold form: one threshold for stopping after an up-step, and another for stopping after a down-step. Precise expressions for the thresholds are given for both the positively and the negatively correlated cases. The optimal rule is illustrated by several numerical examples.
Read moreThroughput Optimization in Multichannel Cognitive Radios With Hard-Deadline Constraints
In a cognitive radio scenario we consider a single secondary user (SU) accessing a multi-channel system. The SU senses the channels sequentially to detect if a primary user (PU) is occupying the channels, and stops its search to access a channel if it offers a significantly high throughput. The optimal stopping rule and power control problem is considered. The problem is formulated as a SU's throughput-maximization problem under a power, interference and packet delay constraints. We first show the effect of the optimal stopping rule on the packet delay, then solve this optimization problem for both the overlay system where the SU transmits only at the spectrum holes as well as the underlay system where tolerable interference (or tolerable collision probability) is allowed. We provide closed-form expressions for the optimal stopping rule, and show that the optimal power control strategy for this multi-channel problem is a modified water-filling approach. We extend the work to multiple SU scenario and show that when the number of SUs is large the complexity of the solution becomes smaller than that of the single SU case. We discuss the application of this problem in typical networks where packets arrive simultaneously and have the same departure deadline. We further propose an online adaptation policy to the optimal stopping rule that meets the packets' hard-deadline constraint and, at the same time, gives higher throughput than the offline policy.
Read moreCenters for Random Walks on Trees
We consider two distinct centers which arise in measuring how quickly a random walk on a tree mixes. Lovász and Winkler [Efficient stopping rules for Markov chains, in Proceedings of the 27th ACM Symposium on the Theory of Computing, 1995, pp. 76–82] point out that stopping rules which "look where they are going" (rather than simply walking a fixed number of steps) can achieve a desired distribution exactly and efficiently. Considering an optimal stopping rule that reflects some aspect of mixing, we can use the expected length of this rule as a mixing measure. On trees, a number of these mixing measures identify particular nodes with central properties. In this context, we study a variety of natural notions of centrality. Each of these criteria identifies the barycenter of the tree as the "average" center and the newly defined focus as the "extremal" center.
Read moreOptimal Stopping Rules. General Theory for the Discrete-Time Case in the Markov Representation
1. Recall that the problems concerning optimal stopping and optimal stopping rules considered above were stated as follows.
Read moreBehaviorally consistent optimal stopping rules
Behaviorally consistent optimal stopping rules
Optimal channel stopping rule under constrained conditions for CRNs
Cognitive radio is an innovative technique for spectrum management which uses Dynamic Spectrum Access (DSA). DSA has the potential to mitigate the spectrum scarcity by letting the Secondary User (SU) access the idle spectrum unused by the Primary User (PU). DSA improves the spectrum efficiency via spectrum sensing and optimal spectrum access. Spectrum sensing should be perfect so that the SU does not cause interference to the PU. Moreover, the channel selected should be the best for maximising throughput of the SU. In this paper we consider a best channel selection problem in Cognitive Radio Networks (CRNs). The problem is modelled as optimal stopping problem where the controller at each state can stop or continue sensing based on the channel gains achieved. There is a Markovian relation given between the channel occupancies of PU. The stopping rule comes out to be simple threshold rule. The controller stops sensing when the channel gain exceeds the given threshold.
Read moreSum the Multiplicative Odds to One and Stop
We consider the optimal stopping problem of maximizing the probability of stopping on any of the last m successes of a sequence of independent Bernoulli trials of length n, where m and n are predetermined integers such that 1 ≤ m < n. The optimal stopping rule of this problem has a nice interpretation, that is, it stops on the first success for which the sum of the m-fold multiplicative odds of success for the future trials is less than or equal to 1. This result can be viewed as a generalization of Bruss' (2000) odds theorem. Application will be made to the secretary problem. For more generality, we extend the problem in several directions in the same manner that Ferguson (2008) used to extend the odds theorem. We apply this extended result to the full-information analogue of the secretary problem, and derive the optimal stopping rule and the probability of win explicitly. The asymptotic results, as n tends to ∞, are also obtained via the planar Poisson process approach.
Read moreOn Stopping Rules and the Expected Supremum of $S_n/a_n$ and $|S_n|/a_n$
Let $\{X_n\}$ be a sequence of i.i.d. mean zero random variables. Let $S_n = X_1 + \cdots + X_n$. This paper is devoted to determining the conditions where-by $E\sup_{n\geqq 1}S_n/a_n < \infty$ and $E\sup_{n\geqq 1}|S_n|/a_n < \infty$ for quite general sequences of increasing constants $\{a_n\}$. For the sequences $\{a_n\}$ considered, we find it sufficient to examine whether or not $\lim_{n\rightarrow\infty} E(\sum^n_{k=1}X_k/a_k)^+ < \infty$. The existence of optimal extended-valued stopping rules with finite expected reward for sequences $\{S_n/a_n\}$ or $\{|S_n|/a_n\}$ is a by-product of our results. This generalizes results of D. L. Burkholder, Burgess Davis, R. F. Gundy, B. J. McCabe and L. A. Shepp, who treat the case $a_n = n$.
Read moreOn Optimal Screening Ages
Several chronic diseases are characterized by an initial asymptomatic stage during which, if detected by screening, they can be cured in a more effective way. This article considers two statistical design problems in screening for chronic disease: the choice of examination ages and the choice of the part of the population to be screened. One main goal is capturing the trade-off between the costs of examination and the losses due to late detection, while accounting for the effects of age on the incidence of the disease, on mortality, and on the relative advantages of early detection. The problem is posed in a decision theoretic way. The model adopted considers a single individual, whose history relative to the disease is represented by a discrete-valued stochastic process. The transition structure is general, but known. The decision space includes all sequences of examination times, as well as no examination. The optimality criterion accounts for the cost of examinations and, in a general way, for the goals of screening in terms of mortality and morbidity. So the optimality criterion may depend on survival, quality-adjusted life years, cost of care, and so on, as well as on combinations of these factors. A general solution and computational algorithms are derived by extending to this context methodologies developed in reliability theory. The case in which the test used for screening has high sensitivity is studied in detail; then the determination of the optimal schedule and stopping rule is reduced to a one-dimensional optimization problem by recursive dynamic methods. Moreover, sufficient conditions for screening to be increasingly worthwhile with age are derived. Under these conditions, the optimal number of planned examinations is either 0 or infinity, and there is a simple check to establish whether or not to screen without having to compute the optimal schedule. Under slightly stronger conditions, the times between examinations decrease and the optimal solution is unique and easy to compute. The conditions mentioned relate increasing times between checks to properties of the failure rate of the time to onset of the disease and of the relative incidence of the disease. Applications of the results include developing guidelines for screening for breast and cervical cancers—currently a controversial issue.
Read moreLetter to the Editor—An Optimal Stopping Rule
Suppose the random variables X1, X2, …, all from the same population, are observed sequentially. After the nth observation, the experimenter can stop and receive the net payoff of c1 [max(x1, x2, …, xn)] − nc2, where c1 is the unit value of the maximum and c2 is the sampling cost. In this paper a rule is given to determine if the experimenter should stop in the nth observation or if he should continue until the (n + 1)st observation, at which time he is faced with this decision all over again.
Read moreIntelligent Multi-Agent Based Multilayered Control System for Opportunistic Load Scheduling in Smart Buildings
Today’s power systems are subject to the high penetration of dynamic load. Volatility and intermittency of the dynamic load demand need to be compensated through optimization and scheduling without compromising user comfort. This paper proposes a multi-agent-based multi-layered hierarchical control system for residential load management under real-time pricing environment. The major objectives are to reduce peak load demand, electricity cost, and user discomfort. In doing so, different types of agents, i.e., price agent $p_{a}$ , sensor agent $s_{a}$ , decision agent $d_{a}$ , load agent $l_{a}$ , and action agent $a_{a}$ , are developed to control residential loads, such as normal load ( nl ) and heavy load ( hl ). To handle price uncertainty, dynamically, optimal stopping rule (OSR) theory has been used. Two variants of OSR are proposed: 1) priority inversion logic-based OSR to subsidize the responsive consumers and 2) maximum energy consumption limit $Q$ -based OSR-Q to maximize the profit of energy retailers. Finally, the proposed mechanism is validated on a set of loads to show the applicability and proficiency under a dynamic environment.
Read moreMultiagent Control System for Residential Energy Management under Real Time Pricing Environment
This work proposes a residential load management system using multiagent technology with the objective of cost and comfort management. Smart appliances in a residential unit are modelled as agents which are controlled using optimization algorithm. These agents cooperate and communicate with each other using agent communication language (ACL) to reduce electricity cost and high peaks without affecting end user comfort. In this regards, different types of agents including load agents, price agent, temperature agent, management agent and optimal stopping rule (OSR) agent are considered. To make agent behaviour intelligent and adaptive, OSR is used. Simulations are conducted to provide the overview of residential load management using multiagent system (MAS). Simulation results show the effectiveness of MAS in terms of electricity cost, user comfort and peak shaving.
Read moreOptimal Stopping Based on Two Types of Runs under Drawings with Replacement
In this paper we deal with the optimal stopping problem based on two types of runs under random drawings with replacement (from an urn of known composition,containing three types of balls. Our model extends that of Starr [3], to incorporate the possibility of two types of runs in the analysis of optimal stopping. In Section 2, the case when no cost is involved has been considered. In Section 3, the case when a known constant cost is incurred for each trial has been considered.Some of the results in Section 3 are new and some improve the results of Starr. We have also considered the infinite horizon case in Section 3·4. We have presented eight tables of values under the optimal stopping rule at the end of Section 2 and Section 3.
Read moreOptimal stopping in urn models with payoff depending on maximal observed element
Optimal stopping in urn models with payoff depending on maximal observed element