16 June 2009 in IEEE Transactions on Information Theory
This work considers the problem of quickest detection with N distributed sensors that receive sequential observations either in discrete or in continuous time from the environment. These sensors employ cumulative sum (CUSUM) strategies and communicate to a central fusion center by one shot schemes. One shot schemes are schemes in which the sensors communicate with the fusion center only once, via which they signal a detection. The communication is clearly asynchronous and the case is considered in which the fusion center employs a minimal strategy, which means that it declares an alarm when the first communication takes place. It is assumed that the observations received at the sensors are independent and that the time points at which the appearance of a signal can take place are different. Both the cases of the same and different signal distributions across sensors are considered. It is shown that there is no loss of performance of one shot schemes as compared to the centralized case in an extended Lorden min-max sense, since the minimum of N CUSUMs is asymptotically optimal as the mean time between false alarms increases without bound. In the case of different signal distributions the optimal threshold parameters are explicitly computed.
1 December 2011 in International Journal of Theoretical and Applied Finance
1 November 2013 in Insurance: Mathematics and Economics
19 November 2011 in Methodology and Computing in Applied Probability
1 February 2017 in Bernoulli
Project Euclid - mathematics and statistics online
1 October 2015 in Mathematics of Operations Research
We investigate a game of singular control and strategic exit in a model of competitive market share control. In the model, each player can make irreversible investments to increase his market share, which is modeled as a diffusion process. In addition, each player has an option to exit the market at any point in time. We formulate a verification theorem for best responses of the game and characterize Markov perfect equilibria (MPE) under a set of verifiable assumptions. We find a class of MPEs with a rich structure. In particular, each player maintains up to two disconnected intervals of singular control regions, one of which plays a defensive role, and the other plays an offensive role. We also identify a set of conditions under which the outcome of the game may be unique despite the multiplicity of the equilibria.