“…Then, they compute the DBNE strategy pair σ * ,0:K i , ∀i ∈ {1, 2}, under the given belief sequence at each stage by solving program C k from stage K to stage 0 in sequence. Next, they update their beliefs at each stage according to the strategy pair σ * ,0:K−1 i , ∀i ∈ {1, 2}, via the Bayesian update (2). If the strategy pair σ * ,0:K−1 i , ∀i ∈ {1, 2}, satisfies (5) under the updated belief, we find the ε-PBNE and terminate the iteration.…”