Abstract: We provide comparable algorithms for the Dekel-Fudenberg procedure, iterated admissibility, proper rationalizability and full permissibility by means of the concepts of preference restrictions and likelihood orderings. We apply the algorithms for comparing iterated admissibility, proper rationalizability and full permissibility, and provide a sufficient condition under which iterated admissibility does not rule out properly rationalizable strategies. Finally, we use the algorithms to examine an economically relevant strategic situation, namely a bilateral commitment bargaining game.
Publication Year: 2017
Publication Date: 2017-10-01
Language: en
Type: preprint
Access and Citation
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot