2000 character limit reached
Quantum(-like) decision making: on validity of the Aumann theorem
Published 25 Mar 2014 in q-bio.NC, math.PR, and quant-ph | (1403.6279v2)
Abstract: Through set-theoretic formalization of the notion of common knowledge, Aumann proved that if two agents have the common priors, and their posteriors for a given event are common knowledge, then their posteriors must be equal. In this paper we investigate the problem of validity of this theorem in the framework of quantum(-like) decision making.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.