Agreeing to Disagree. STOR. Robert J. Aumann. The Annals of Statistics, Vol. 4, No. 6 (Nov., ), Stable URL. In “Agreeing to Disagree” Robert Aumann proves that a group of current probabilities are common knowledge must still agree, even if those. “Agreeing to Disagree,” R. Aumann (). Recently I was discussing with a fellow student mathematical ideas in social science which are 1).
|Genre:||Health and Food|
|Published (Last):||24 April 2009|
|PDF File Size:||7.88 Mb|
|ePub File Size:||18.41 Mb|
|Price:||Free* [*Free Regsitration Required]|
Both are given the same prior probability of the world being in a certain state, and separate sets of further information. External links Twitter Facebook Discord. All-pay auction Alpha—beta pruning Bertrand paradox Bounded rationality Combinatorial game theory Confrontation analysis Coopetition First-move advantage in chess Game mechanics Glossary of game theory List of game theorists List of games in game theory No-win situation Solving chess Topological game Tragedy of the commons Tyranny of small decisions.
It may be worth noting that Yudkowsky has said he wouldn’t agree to try to reach an Aumann agreement with Hanson. Unless explicitly noted otherwise, all content licensed as indicated by RationalWiki: This theorem is almost as much a favorite of LessWrong as the “Sword of Bayes”  itself, because of its popular phrasing along the lines of “two agents acting rationally Retrieved from ” https: Aumann’s agreement theorem  is the result of Robert Aumann’s, winner of the Swedish National Bank’s Prize in Economic Sciences in Memory of Alfred Nobelgroundbreaking discovery that a sufficiently respected game theorist can get anything into a peer-reviewed journal.
For concerns on copyright infringement please see: Community Saloon bar To do list What is going on? Views Read Edit View history. Both sets of information include the posterior probability arrived at by the other, as well as the fact that their prior probabilities are the same, the fact that the other knows its posterior probability, the set of events that might affect probability, the fact that the other knows these things, the fact that the other knows it knows these things, the fact that the other knows it knows the other knows it knows, ad infinitum this is “common knowledge”.
Aumann’s agreement theorem
More specifically, if two people are genuine Bayesian rationalists with common priorsand if they each have common knowledge of their disageee-aumann posterior probabilitiesthen their posteriors must be equal. Simply knowing that another agent observed some information and came to their respective conclusion will force each to revise their beliefs, resulting eventually in total agreement on the correct posterior.
tl The Annals of Statistics. The paper presents a way to measure how distant priors are from being common. Their posterior probabilities must then be the same.
Essentially, the proof goes that if they were not, it would mean that they did not trust the accuracy of one another’s information, or did not trust the other’s computation, since a different probability being found by a rational agent is itself evidence of further evidence, and a rational agent should recognize this, and also recognize that one would, and that this would also be recognized, and so on.
From Wikipedia, the free encyclopedia. This page was last modified on 12 Septemberat Articles with short description. The one-sentence summary is “you can’t actually agree to disagree”: This page was last edited on 6 Octoberat Unlike many questionable applications of theorems, this one appears to have been the intention of the paper itself, which itself cites a paper defending the application of such techniques to the real world.
Consider two agents tasked with performing Bayesian analysis this is “perfectly rational”. However, Robin Hanson has presented an argument that Bayesians who agree about the processes that gave rise to their priors e.
Retrieved from ” https: Cooperative game Determinacy Escalation of commitment Extensive-form game First-player and second-player win Game complexity Graphical game Hierarchy of beliefs Information set Normal-form game Preference Sequential game Simultaneous game Simultaneous action selection Solved game Succinct game.
Arrow’s impossibility theorem Aumann’s agreement theorem Folk theorem Minimax theorem Nash’s theorem Purification theorem Revelation principle Zermelo’s theorem.
Scott Aaronson believes that Aumanns’s therorem can act as a corrective to overconfidence, and a guide aggreeing to what disagreements should look like.
Nash equilibrium Subgame perfection Mertens-stable disagdee-aumann Bayesian Disagree-aumnan equilibrium Perfect Bayesian equilibrium Trembling hand Proper equilibrium Epsilon-equilibrium Correlated equilibrium Sequential equilibrium Quasi-perfect equilibrium Evolutionarily stable strategy Risk dominance Core Shapley value Pareto efficiency Gibbs equilibrium Quantal response equilibrium Self-confirming equilibrium Strong Nash equilibrium Markov perfect equilibrium.
Aumann’s agreement theorem says that two people acting rationally in a certain precise sense and with common knowledge of each other’s beliefs cannot agree to disagree. For an illustration, how often do two mathematicians disagree on the invalidity of the proof within an agreed-upon framework, once one’s objections are known to the other?
It was first formulated disagree-aumanh the paper titled “Agreeing to Disagree” by Robert Aumannafter whom the theorem is named. Theory and Decision 61 4 — The Annals of Statistics 4 6 In game theoryAumann’s agreement theorem is a theorem which demonstrates that rational agents with common knowledge of each other’s beliefs cannot agree to disagree.
Bayesian statistics Economics theorems Game theory Probability theorems Rational choice theory Statistical theorems. For such careful definitions of “perfectly rational” and “common knowledge” this is equivalent to saying that two functioning calculators will not give different answers on the same input.
Business and economics portal Statistics portal Mathematics portal. Scott Aaronson  sharpens this theorem by removing the common prior and limiting the number of messages communicated. Views Read Edit Fossil record. Polemarchakis, We can’t disagree forever, Journal of Economic Theory 28′: Yudkowsky ‘s mentor Robin Hanson tries to handwave this with something about genetics and environment,  but to have sufficient common knowledge of genetics and environment for this to work practically would require a few calls to Laplace’s demon.
Studying the same issue from a different perspective, a research paper by Ziv Hellman considers what happens if priors are not common.
Aumann’s agreement theorem – RationalWiki
International Journal of Game Theory. Topics in game theory. Scott Aaronson has shown that this is indeed the case.