Logo
Munich Personal RePEc Archive

Robust Equilibria under Non-Common Priors

Oyama, Daisuke and Tercieux, Olivier (2005): Robust Equilibria under Non-Common Priors.

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

Download (343kB) | Preview

Abstract

This paper considers the robustness of equilibria to a small amount of incomplete information, where players are allowed to have heterogenous priors. An equilibrium of a complete information game is robust to incomplete information under non-common priors if for every incomplete information game where each player's prior assigns high probability on the event that the players know at arbitrarily high order that the payoffs are given by the complete information game, there exists a Bayesian Nash equilibrium that generates behavior close to the equilibrium in consideration. It is shown that for generic games, an equilibrium is robust under non-common priors if and only if it is the unique rationalizable action profile. Set-valued concepts are also introduced, and for generic games, a smallest robust set is shown to exist and coincide with the set of a posteriori equilibria.

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.