Probabilities on streams and reflexive games

Andrew Schumann ()

Operations Research and Decisions, 2014, vol. 24, issue 1, 71-96

Abstract: Probability measures on streams (e.g. on hypernumbers and p-adic numbers) have been defined. It was shown that these probabilities can be used for simulations of reflexive games. In particular, it can be proved that Aumann’s agreement theorem does not hold for these probabilities. Instead of this theorem, there is a statement that is called the reflexion disagreement theorem. Based on this theorem, probabilistic and knowledge conditions can be defined for reflexive games at various reflexion levels up to the infinite level.

Keywords: metagame; reflexive game; coinductive probabilities; p-adic probabilities; perlocutionary effect; Aumann’s agreement theorem (search for similar items in EconPapers)
Date: 2014
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://ord.pwr.edu.pl/assets/papers_archive/1074%20-%20published.pdf (application/pdf)

Related works:
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:wut:journl:v:1:y:2014:p:71-96:id:1074

DOI: 10.5277/ord140105

Access Statistics for this article

More articles in Operations Research and Decisions from Wroclaw University of Science and Technology, Faculty of Management Contact information at EDIRC.
Bibliographic data for series maintained by Adam Kasperski ().