Iterated backward inference: An algorithm for proper rationalizability
David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
An important approach to game theory is to examine the consequences of beliefs that agents may have about each other. This paper investigates respect for public preferences. Consider an agent A who believes that B strictly prefers an option a to an option b. Then A respects B’s preference if A assigns probability 1 to the choice of a given that B chooses a or b. Respect for public preferences requires that if it is common belief that B prefers a to b, then it is common belief that all other agents respect that preference. Along the lines of Blume, Brandenburger and Dekel  and Asheim , I treat respect for public preferences as a constraint on lexicographic probability systems. The main result is that given respect for public preferences and perfect recall, players choose in accordance with Iterated Backward Inference. Iterated Backward Inference is a procedure that generalizes standard backward induction reasoning for games of both perfect and imperfect information. From Asheim’s characterization of proper rationalizability  it follows that properly rationalizable strategies are consistent with respect for public preferences; hence strategies eliminated by Iterated Backward Inference are not properly rationalizable.
|Keywords||No keywords specified (fix it)|
No categories specified
(categorize this paper)
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library||
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
John K. Davis (2004). Precedent Autonomy and Subsequent Consent. Ethical Theory and Moral Practice 7 (3):267-291.
Oliver Schulte (1996). Common Reasoning About Admissibility. Erkenntnis 45 (2/3):299 - 325.
Cristina Bicchieri & Oliver Schulte (1996). Common Reasoning About Admissibility. Erkenntnis 45 (2-3):299 - 325.
Thorsten Clausing (2003). Doxastic Conditions for Backward Induction. Theory and Decision 54 (4):315-336.
Magnus Jiborn & Wlodek Rabinowicz (2003). Reconsidering the Foole's Rejoinder: Backward Induction in Indefinitely Iterated Prisoner's Dilemmas. Synthese 136 (2):135 - 157.
Thorsten Clausing (2004). Belief Revision in Games of Perfect Information. Economics and Philosophy 20 (1):89-115.
Antonio Quesada (2002). Belief System Foundations of Backward Induction. Theory and Decision 53 (4):393-403.
Cristina Bicchieri (1988). Backward Induction Without Common Knowledge. PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1988:329 - 343.
Jordan Howard Sobel (1993). Backward-Induction Arguments: A Paradox Regained. Philosophy of Science 60 (1):114-133.
Sorry, there are not enough data points to plot this chart.
Added to index2009-01-28
Recent downloads (6 months)0
How can I increase my downloads?