Multiple equilibria and selection by learning in an applied setting
We explore two complementary approaches to counterfactual analysis in an empirical ATM network example with multiple equilibria. First we simply enumerate and compare the possible equilibria. Second, we examine how different learning algorithms select among them.
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.:
- McLennan, Andrew & Berg, Johannes, 2005. "Asymptotic expected number of Nash equilibria of two-player normal form games," Games and Economic Behavior, Elsevier, vol. 51(2), pages 264-295, May.
- Andrew McLennan, 2005.
"The Expected Number of Nash Equilibria of a Normal Form Game,"
Econometric Society, vol. 73(1), pages 141-174, January.
- McLennan, A., 1999. "The Expected Number of Nash Equilibria of a Normal Form Game," Papers 306, Minnesota - Center for Economic Research.
- Young, H. Peyton, 2004. "Strategic Learning and its Limits," OUP Catalogue, Oxford University Press, number 9780199269181.
- Panle Jia, 2008. "What Happens When Wal-Mart Comes to Town: An Empirical Analysis of the Discount Retailing Industry," Econometrica, Econometric Society, vol. 76(6), pages 1263-1316, November.
- Drew Fudenberg & David K. Levine, 1998. "The Theory of Learning in Games," MIT Press Books, The MIT Press, edition 1, volume 1, number 0262061945, January.