Justification of Stable Equilibria
Two assumptions are used to justify selection of equilibria in stable sets. One assumption requires that a selected set is invariant to addition of redundant strategies. The other is a strong version of backward induction. Backward induction is interpreted as the requirement that behavior strategies in an extensive-form game are sequentially rational and conditionally admissible at every information set; viz., quasi-perfect as defined by van Damme. The strong version requires 'truly' quasi-perfect, in that every action perturbation selects a quasi-perfect equilibrium in the set. For two-player games we also provide an exact characterization of stable sets.
|Date of creation:||Jun 2005|
|Contact details of provider:|| Postal: Stanford University, Stanford, CA 94305-5015|
Phone: (650) 723-2146
Web page: http://gsbapps.stanford.edu/researchpapers/
More information through EDIRC
References listed on IDEAS
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.:
- Kreps, David M & Wilson, Robert, 1982.
Econometric Society, vol. 50(4), pages 863-894, July.
- David Kreps & Robert Wilson, 1998. "Sequential Equilibria," Levine's Working Paper Archive 237, David K. Levine.
- David M Kreps & Robert Wilson, 2003. "Sequential Equilibria," Levine's Working Paper Archive 618897000000000813, David K. Levine.
- Srihari Govindan & Robert Wilson, 2009. "On Forward Induction," Econometrica, Econometric Society, vol. 77(1), pages 1-28, 01.
- Srihari Govindan & Robert Wilson, 2006. "On Forward Induction," Levine's Working Paper Archive 321307000000000618, David K. Levine.
- Srihari Govindan & Robert Wilson, 2008. "On Forward Induction," Levine's Working Paper Archive 122247000000001859, David K. Levine.
- Wilson, Robert B. & Govindan, Srihari, 2007. "On Forward Induction," Research Papers 1955, Stanford University, Graduate School of Business.
- Srihari Govindan & Robert Wilson, 2007. "On Forward Induction," Levine's Bibliography 321307000000000788, UCLA Department of Economics.
- Srihari Govindan & Robert Wilson, 2007. "'On Forward Induction," Levine's Working Paper Archive 321307000000000825, David K. Levine.
- Govindan, Srihari & Wilson, Robert, 2001. "Direct Proofs of Generic Finiteness of Nash Equilibrium Outcomes," Econometrica, Econometric Society, vol. 69(3), pages 765-769, May.
- Lawrence Blume & Adam Brandenburger & Eddie Dekel, 2014. "Lexicographic Probabilities and Choice Under Uncertainty," World Scientific Book Chapters,in: The Language of Game Theory Putting Epistemics into the Mathematics of Games, chapter 6, pages 137-160 World Scientific Publishing Co. Pte. Ltd..
- Blume, Lawrence & Brandenburger, Adam & Dekel, Eddie, 1991. "Lexicographic Probabilities and Choice under Uncertainty," Econometrica, Econometric Society, vol. 59(1), pages 61-79, January.
When requesting a correction, please mention this item's handle: RePEc:ecl:stabus:1896. 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: ()
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.