Voting Procedure on Stopping Games of Markov Chain

Optimal stopping problems by two or more decision makers: a survey

“…Therefore, a stopping rule should be proposed to avoid these sitautions. Several stopping rules were proposed in Szajowski and Yasuda (1997), Kurano et al (1980) and Yasuda (1985) namely: each DM can stop the selection process, or if r or more DMs decide to stop, the process is then stopped (Szajowski and Yasuda 1997). Sakaguchi and Mazalov (2004) adopt the following stopping rule for the dynamic process:…”

“…The BOSP has been also modeled when both players have to select the same offer(s) as proposed by Sakaguchi (1978b), Kurano et al (1980), Szajowski and Yasuda (1997), Sakaguchi (1977), Sakaguchi and Mazalov (2004) and Ben Abdelaziz and Krichen (2005). Presman and Sonin (1975), Sakaguchi (1980) and Sakaguchi (1985b) considered a modified version of the BOSP characterized by the existence of two streams of offers.…”

Multi-variate Quickest Detection of Significant Change Process

“…Following the results of the author and Yasuda [22] the multilateral stopping of a Markov chain problem can be described in the terms of the notation used in the non-cooperative game theory (see [14], [4], [13], [15]). Let ( − → X n , F n , P x ), n = 0, 1, 2, .…”

“…We have {ω ∈ Ω : [20], [22]). If players use SS σ ∈ S and the individual preferences are converted to the effective stopping time by the aggregate rule π, then player i gets …”

A Game Variant of the Stopping Problem on Jump Processes with a Monotone Rule

“…As a related result, Presman and Sonin [6] have obtained the multiperson best choice problem on the Poisson stream but their rule of a decision to stop is different from ours. Szajowski and Yasuda [8] treat the case when the process is a Markov Chain.…”