We consider agents who choose by proceeding through a checklist of criteria (for any pair of alternatives the …rst criterion that ranks the pair determines the agent’s choice). Regardless of the discriminating capacity of the criteria in a checklist, choices that maximize complete and transitive preferences can always be the outcome of a ‘quick’checklist that uses a small number of criteria. Fo...

The problem of sequentially detecting a moving anomaly is studied, in which the affects different parts sensor network over time. Each characterized by pre- and post-change distribution. Initially, observations each are generated according to corresponding pre-change After some unknown but deterministic time instant, emerges, affecting sets sensors as progresses. Our goal design stopping proced...

In this paper we resolve an open problem proposed by [9]. Consider a sequence of Brownian Motions with unknown drift equal to one or zero, which may be observed one at a time. We give a procedure for finding, as quickly as possible, a process which is a Brownian Motion with nonzero drift. This original quickest search problem, in which the filtration itself is dependent on the observation strat...

This paper considers the problem of finding a quickest path between two points in the Euclidean plane in the presence of a transportation network. A transportation network consists of a planar network where each road (edge) has an individual speed. A traveller may enter and exit the network at any point on the roads. Along any road the traveller moves with a fixed speed depending on the road, a...

Given a network N = (V,E, c, l), where G = (V,E), |V | = n and |E| = m, is a directed graph, c(e) > 0 is the capacity and l(e) ≥ 0 is the lead time (or delay) for each edge e ∈ E, the quickest path problem is to find a path for a given source–destination pair such that the total lead time plus the inverse of the minimum edge capacity of the path is minimal. The problem has applications to fast ...

We study the problem of estimating source a network cascade given time series noisy information about spread. Initially, there is single vertex affected by (the source) and spreads in discrete steps across network. Although evolution hidden, one observes measurement at each step. Given this information, we aim to reliably estimate as fast possible. investigate Bayesian minimax formulations esti...

In a dynamic network, the quickest path problem asks for a path such that a given amount of flow can be sent from source to sink via this path in minimal time. In practical settings, for example, in evacuation or transportation planning, the problem parameters might not be known exactly a priori. It is therefore of interest to consider robust versions of these problems in which travel times and...

We consider the problem of quickest transient change detection under a Bayesian setting. The change occurs at a random time Γ1 and disappears at a random time Γ2 > Γ1. Thus, at any time k, the system can be in one of the following states, i) prechange, ii) in–change, and iii) out–of–change. We model the evolution of the state by a Markov chain. The state of the system can only be observed parti...