Learning Equilibrium Play: A Myopic Approach

1. Ya.I. Alber, A.I. Iusem, and M.V. Solodov, “On the projected subgradient method for nonsmooth convex optimization in a Hilbert space,” Manuscript, 1996.

2. J.-P. Aubin, Viability Theory, Birkhaüser: Basel, 1991.

   Google Scholar 

3. A. Benveniste, M. Métivier, and P. Priouret, Adaptive Algorithms and Stochastic Approximations, Springer-Verlag: Berlin, 1990.

   Google Scholar 

4. J.F. Bonnans and A. Ioffe, “Second-order sufficiency and quadratic growth for nonisolated minima,” Mathemartics of Operations Research, vol. 20, pp. 801–807, 1995.

   Google Scholar 

5. J. Conlisk, “Why bounded rationality,” Journal of Economic Literature, vol. 34, pp. 669–700, 1996.

   Google Scholar 

6. V.P. Crawford, “Theory and experiment in the analysis of strategic interaction,” in Advances in Economics and Econometrics: Theory and Applications I, D.M. Kreps and K.F. Wallis (Eds.), Cambridge University Press, 1977, pp. 206–242.

7. P. Dupuis and A. Nagurney, “Dynamical systems and variational inequalities,” Annals of Operations Research, vol. 44, pp. 9–42, 1993.

   Google Scholar 

8. Yu.M. Ermoliev and S.P. Uryasiev, “Nash equilibrium in n-person games,” (in Russian) Kibernetika, vol. 3, pp. 85–88, 1982.

   Google Scholar 

9. S.D. Flåm and C. Horvath, “Network games: Adaptations to Cournot-Nash equilibrium,” Annals of Operations Research, vol. 64, pp. 179–195, 1996.

   Google Scholar 

10. S.D. Flåm, “Approaches to economic equilibrium,” Journal of Economic Dynamics and Control, vol. 20, pp. 1505–1522, 1996.

    Google Scholar 

11. S.D. Flåm, “Learning competitive market equilibrium,” Economic Theory, vol. 6. pp. 511–518, 1995.

    Google Scholar 

12. S.D. Flåm and A. Ruszczyński, “Noncooperative convex games: Computing equilibrium by partial regularization,” Working Paper 94–42 IIASA, 1994.

13. J.-B. Hiriart-Urruty and C. Lemaréchal, Convex Analysis and Minimization Algorithms II, Springer-Verlag, 1993.

14. L.J. Mirman, L. Samuelson, and L.E. Schlee, “Strategic information manipulation in duopolies,” Journal of Economic Theory, vol. 62, pp. 362–384, 1994.

    Google Scholar 

15. M.J. Osborne and A. Rubinstein, A Course in Game Theory, The MIT Press: Cambridge, 1994.

    Google Scholar 

16. J. Robinson, “An iterative method for solving a game,” Ann. Math., vol. 54, pp. 296–301, 1951.

    Google Scholar 

17. H. Robbins and D. Siegmund, “A convergence theorem for non-negative almost surmartingales,” in Optimizing Methods in Statistics, J. Rustagi (Ed.), Academic Press: New York, 1971, pp. 235–257.

    Google Scholar 

18. R.T. Rockafellar, Convex Analysis, Princeton University Press, 1970.

19. J.B. Rosen, Existence and uniqueness of equilibrium points for concave n-person games, Econometrica, vol. 33, pp. 520–534, 1965.

    Google Scholar 

20. J. Tirole, Theory of Industrial Organization, The MIT Press: Cambridge, Massachusetts, 1993.

    Google Scholar 

21. J.W. Weibull, Evolutionary Game Theory, The MIT Press: Cambridge, Massachusetts, 1996.

    Google Scholar 

Download references