Non-reactive strategies in decision-form games
In this paper we propose a concept of rationalizable solution for two-player decision-form games: the solution by iterated elimination of non-reactive strategies. Several original theorems are proved about this kind of solution. We study the relations between solutions by iterated elimination of non reactive strategies and game equilibria. We present an existence theorem for bistrategies surviving the iterated elimination and an existence theorem for solution by iterated elimination in contracting games. We, also, show that an equilibrium of a game survives iterated elimination of non-reactive strategies. At the end we prove a characterization of solvability by iterated elimination of non-reactive strategies.
|Date of creation:||2009|
|Date of revision:|
|Publication status:||Published in AAPP | Physical, Mathematical, and Natural Sciences 1.LXXXVI(2009): pp. 1-12|
|Contact details of provider:|| Postal: Ludwigstraße 33, D-80539 Munich, Germany|
Web page: https://mpra.ub.uni-muenchen.de
More information through EDIRC
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Martin J Osborne & Ariel Rubinstein, 2009.
"A Course in Game Theory,"
814577000000000225, UCLA Department of Economics.
When requesting a correction, please mention this item's handle: RePEc:pra:mprapa:29262. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Joachim Winter)
If references are entirely missing, you can add them using this form.