Order Independence for Iterated Weak Dominance
In general, the result of the elimination of weakly dominated strategies depends on order. We find a condition, satisfied by the normal form of any generic extensive form, and by some important games which do not admit generic extensive forms, under which any two games resulting from the elimination of weakly dominated strategies (subject to no more eliminations being possible) are equivalent. We also extend our condition and result to the case of elimination by mixed strategies. The result strengthens the intuitive connection between backward induction and weak dominance. And, under our condition, some computational problems relating to weak dominance, which are gnerally complex, become simple.
(This abstract was borrowed from another version of this item.)
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
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.:
- Leslie M. Marx & Jeroen M. Swinkels, 1996.
"Order Independence for Iterated Weak Dominance,"
1066R, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Marx, Leslie M. & Swinkels, Jeroen M., 1997. "Order Independence for Iterated Weak Dominance," Games and Economic Behavior, Elsevier, vol. 18(2), pages 219-245, February.
- Marx, Leslie M. & Swinkels, Jeroen M., 2000. "Order Independence for Iterated Weak Dominance," Games and Economic Behavior, Elsevier, vol. 31(2), pages 324-329, May.
- Satterthwaite, Mark A & Sonnenschein, Hugo, 1981. "Strategy-Proof Allocation Mechanisms at Differentiable Points," Review of Economic Studies, Wiley Blackwell, vol. 48(4), pages 587-97, October.
- Samuelson, Larry, 1992. "Dominated strategies and common knowledge," Games and Economic Behavior, Elsevier, vol. 4(2), pages 284-313, April.
- Ehud Kalai & Eitan Zemel, 1988. "On The Order of Eliminating Dominated Strategies," Discussion Papers 789, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Itzhak Gilboa & Ehud Kalai & Eitan Zemel, 1989. "The Complexity of Eliminating Dominated Strategies," Discussion Papers 853, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Mailath, George J & Samuelson, Larry & Swinkels, Jeroen M, 1993.
"Extensive Form Reasoning in Normal Form Games,"
Econometric Society, vol. 61(2), pages 273-302, March.
- Mailath, G.J. & Samuelson, L. & Swinkels, J., 1991. "extensive Form Reasoning in Normal Form Games," Papers 9130, Tilburg - Center for Economic Research.
- Mailath, G.J. & Samuelson, L. & Swinkels, J., 1990. "Extensive Form Reasoning In Normal Form Games," Papers 1-90-1, Pennsylvania State - Department of Economics.
- Mailath, G.J. & Samuelson, L. & Swinkels, J., 1990. "Extensive Form Reasoning In Normal Form Games," Working papers 90-13, Wisconsin Madison - Social Systems.
- Moulin, Herve, 1984. "Dominance solvability and cournot stability," Mathematical Social Sciences, Elsevier, vol. 7(1), pages 83-102, February.
- Moulin, Herve, 1979. "Dominance Solvable Voting Schemes," Econometrica, Econometric Society, vol. 47(6), pages 1137-51, November.
When requesting a correction, please mention this item's handle: RePEc:eee:gamebe:v:31:y:2000:i:2:p:324-329. 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: (Zhang, Lei)
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.