Deludedly Agreeing to Agree
Computer Science and Game Theory
2013-10-28 v1 Logic in Computer Science
Abstract
We study conditions relating to the impossibility of agreeing to disagree in models of interactive KD45 belief (in contrast to models of S5 knowledge, which are used in nearly all the agreements literature). We show that even when the truth axiom is not assumed it turns out that players will find it impossible to agree to disagree under fairly broad conditions.
Cite
@article{arxiv.1310.6418,
title = {Deludedly Agreeing to Agree},
author = {Ziv Hellman},
journal= {arXiv preprint arXiv:1310.6418},
year = {2013}
}
Comments
6 pages, Contributed paper at TARK 2013 (arXiv:1310.6382) http://www.tark.org