Bayesian equilibrium by iterative conjectures (BEIC) analyzes games with players forming their conjectures of what other players will do iteratively starting with first order uninformative conjectures (or prior distribution functions) and updating their conjectures iteratively with game...

This article proposes using Schelling point as a refinement of Nash equilibrium. It also introduces an algorithm way to locate Schelling points in games. The paper shows that in pure coordination games and games with significant proportion of coordination (and certain proportion of conflict),...

Perfect Bayesian equilibrium is not a subset of Nash equilibrium. Perfect Bayesian equilibrium requires players to have beliefs that are consistent with the equilibrium strategies of other players. Nash equilibrium does not explicitly specify the beliefs of the players. However, the default...

This paper uses Bayesian equilibrium by iterative conjectures approach to solve a noisy sequential game, that is, a sequential game with inaccurate observation clouded by noise. Bayesian equilibrium by iterative conjectures requires players to form conjectures about the strategies of the other...