Computing Equilibria of Dynamic Games

Published Online:https://doi.org/10.1287/opre.2016.1572

References

  • Abreu D, Pearce D, Stacchetti E (1986) Optimal cartel equilibria with imperfect monitoring. J. Econom. Theory 39(1):251–269.CrossrefGoogle Scholar
  • Abreu D, Pearce D, Stacchetti E (1990) Toward a theory of discounted repeated games with imperfect monitoring. Econometrica: J. Econometric Soc. 58(5):1041–1063.CrossrefGoogle Scholar
  • Atallah MJ (1983) A linear time algorithm for the Hausdorff distance between convex polygons. Inform. Processing Lett. 17(4):207–209.CrossrefGoogle Scholar
  • Baldauf M, Judd KL, Mollner J, Yeltekin S (2014) Supergames with states. Mimeo, Stanford University, Stanford, CA.Google Scholar
  • Benoit JP, Krishna V (1987) Dynamic duopoly: Prices and quantities. Rev. Econom. Stud. 54(1):23–35.CrossrefGoogle Scholar
  • Benoit JP, Krishna V (1991) Entry deterrence and dynamic competition: The role SOF capacity reconsidered. Internat. J. Indust. Organ. 9(4):477–495.CrossrefGoogle Scholar
  • Bernheim BD, Ray D, Yeltekin Ş (1999) Self-control, saving, and the low asset trap. Mimeo, Stanford University, Stanford, CA.Google Scholar
  • Bernheim BD, Ray D, Yeltekin Ş (2015) Poverty and self-control. Econometrica 83(5):1877–1911.CrossrefGoogle Scholar
  • Besanko D, Doraszelski U, Lu LX, Satterthwaite M (2010) Lumpy capacity investment and disinvestment dynamics. Oper. Res. 58(4-part-2):1178–1193.LinkGoogle Scholar
  • Conklin J, Judd KL (1996) Computing value correspondences for repeated games with state variables. Mimeo, Stanford University, Stanford, CA.Google Scholar
  • Cronshaw MB, Luenberger DG (1990) Computing value correspondences for two-player games with state variables. Mimeo, Stanford University, Stanford, CA.Google Scholar
  • Cronshaw MB, Luenberger DG (1994) Strongly symmetric subgame perfect equilibria in infinitely repeated games with perfect monitoring and discounting. Games Econom. Behav. 6(2):220–237.CrossrefGoogle Scholar
  • Davidson C, Deneckere R (1986) Long-run competition in capacity, short-run competition in price, and the Cournot model. Rand J. Econom. 17(3):404–415.CrossrefGoogle Scholar
  • Davidson C, Deneckere R (1990) Excess capacity and collusion. Internat. Econom. Rev. 31(3):521–541.CrossrefGoogle Scholar
  • Fudenberg D, Maskin E (1986) The folk theorem in repeated games with discounting or with incomplete information. Econometrica 54(3):533–554.CrossrefGoogle Scholar
  • Fudenberg D, Maskin E (1991) On the dispensability of public randomization in discounted repeated games. J. Econom. Theory 53(2):428–438.CrossrefGoogle Scholar
  • Fudenberg D, Tirole J (1983) Capital as a commitment: Strategic investment to deter mobility. J. Econom. Theory 31(2):227–250.CrossrefGoogle Scholar
  • Fudenberg D, Tirole J (1991) Game Theory (MIT Press, Cambridge, MA).Google Scholar
  • Green EJ, Marshall RC, Marx LM (2014) Tacit collusion in oligopoly. The Oxford Handbook Internat. Antitrust Econom. 2:464–497.Google Scholar
  • Judd KL, Yeltekin S, Conklin J (2003) Computing supergame equilibria. Econometrica 71(4):1239–1254.CrossrefGoogle Scholar
  • Kitti M (2016) Subgame perfect equilibria in discounted stochastic games. J. Math. Anal. Appl. 435(1):253–266.CrossrefGoogle Scholar
  • Kreps DM, Scheinkman JA (1983) Quantity precommitment and Bertrand competition yield Cournot outcomes. The Bell J. Econom. 14:326–337.CrossrefGoogle Scholar
  • Sleet C, Yeltekin Ş (2006) Optimal taxation with endogenously incomplete debt markets. J. Econom. Theory 127(1):36–73.CrossrefGoogle Scholar
  • Sleet C, Yeltekin Ş (2007) Recursive monetary policy games with incomplete information. J. Econom. Dynam. Control 31(5):1557–1583.CrossrefGoogle Scholar
  • Sorin S (1986) On repeated games with complete information. Math. Oper. Res. 11(1):147–160.LinkGoogle Scholar
  • Spence AM (1979) Investment strategy and growth in a new market. The Bell J. Econom. 10(1):1–19.CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.