Logo
Munich Personal RePEc Archive

Solving Two Sided Incomplete Information Games with Bayesian Iterative Conjectures Approach

Teng, Jimmy (2012): Solving Two Sided Incomplete Information Games with Bayesian Iterative Conjectures Approach.

[thumbnail of MPRA_paper_40061.pdf]
Preview
PDF
MPRA_paper_40061.pdf

Download (210kB) | Preview

Abstract

This paper proposes a way to solve two (and multiple) sided incomplete information games which generally generates a unique equilibrium. The approach uses iterative conjectures updated by game theoretic and Bayesian statistical decision theoretic reasoning. Players in the games form conjectures about what other players want to do, starting from first order uninformative conjectures and keep updating with games theoretic and Bayesian statistical decision theoretic reasoning until a convergence of conjectures is achieved. The resulting convergent conjectures and the equilibrium (which is named Bayesian equilibrium by iterative conjectures) they supported form the solution of the game. The paper gives two examples which show that the unique equilibrium generated by this approach is compellingly intuitive and insightful. The paper also solves an example of a three sided incomplete information simultaneous game.

Atom RSS 1.0 RSS 2.0

Contact us: mpra@ub.uni-muenchen.de

This repository has been built using EPrints software.

MPRA is a RePEc service hosted by Logo of the University Library LMU Munich.