TY - JOUR
T1 - Belief consistency and trade consistency
AU - Lehrer, Ehud
AU - Samet, Dov
PY - 2014/1
Y1 - 2014/1
N2 - Interpersonal consistency can be described in epistemic terms as a property of beliefs, or in economic terms as the impossibility of certain trades. The existence of a common prior from which all agents' beliefs are derived is of the first kind. The non-existence of an agreeable bet, that is, a contingent zero-sum trade which is always favorable to all agents, is of the second kind. It is well established that these two notions of consistency are equivalent for finite type spaces but not for countable ones. We present three equivalences of epistemic consistency and economic consistency conditions for countable type spaces, defining in this way three levels of consistency of type spaces: weak consistency, consistency, and strong consistency. These three levels coincide in the finite case. We fully analyze the level of consistency of type spaces based on the knowledge structure of Rubinstein's email game. The new notion of belief consistency introduced here helps to justify the requirement of boundedness of payoff functions in countable type spaces by showing that in a large class of spaces there exists an agreeable unbounded bet even when a common prior exists.
AB - Interpersonal consistency can be described in epistemic terms as a property of beliefs, or in economic terms as the impossibility of certain trades. The existence of a common prior from which all agents' beliefs are derived is of the first kind. The non-existence of an agreeable bet, that is, a contingent zero-sum trade which is always favorable to all agents, is of the second kind. It is well established that these two notions of consistency are equivalent for finite type spaces but not for countable ones. We present three equivalences of epistemic consistency and economic consistency conditions for countable type spaces, defining in this way three levels of consistency of type spaces: weak consistency, consistency, and strong consistency. These three levels coincide in the finite case. We fully analyze the level of consistency of type spaces based on the knowledge structure of Rubinstein's email game. The new notion of belief consistency introduced here helps to justify the requirement of boundedness of payoff functions in countable type spaces by showing that in a large class of spaces there exists an agreeable unbounded bet even when a common prior exists.
KW - Agreeing to disagree
KW - Belief consistency
KW - Common prior
KW - Dutch books
KW - No-trade theorems
KW - Type spaces
UR - http://www.scopus.com/inward/record.url?scp=84890818012&partnerID=8YFLogxK
U2 - 10.1016/j.geb.2013.11.005
DO - 10.1016/j.geb.2013.11.005
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:84890818012
SN - 0899-8256
VL - 83
SP - 165
EP - 177
JO - Games and Economic Behavior
JF - Games and Economic Behavior
ER -