Almost common priors

Hellman, Ziv

Almost common priors

International Journal of Game Theory, 2013, vol. 42, issue 2, 399-410

Abstract: What happens when priors are not common? We introduce a measure for how far a type space is from having a common prior, which we term prior distance. If a type space has δ prior distance, then for any bet f it cannot be common knowledge that each player expects a positive gain of δ times the sup-norm of f, thus extending no betting results under common priors. Furthermore, as more information is obtained and partitions are refined, the prior distance, and thus the extent of common knowledge disagreement, can only decrease. We derive an upper bound on the number of refinements needed to arrive at a situation in which the knowledge space has a common prior, which depends only on the number of initial partition elements. Copyright Springer-Verlag 2013

Keywords: Common prior; Agreeing to disagree; No betting and no trade; Knowledge and beliefs (search for similar items in EconPapers)
Date: 2013
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
http://hdl.handle.net/10.1007/s00182-012-0347-5 (text/html)
Access to full text is restricted to subscribers.

Related works:
Working Paper: Almost Common Priors (2010)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jogath:v:42:y:2013:i:2:p:399-410

Ordering information: This journal article can be ordered from
http://www.springer. ... eory/journal/182/PS2

DOI: 10.1007/s00182-012-0347-5

Access Statistics for this article

International Journal of Game Theory is currently edited by Shmuel Zamir, Vijay Krishna and Bernhard von Stengel

More articles in International Journal of Game Theory from Springer, Game Theory Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().