Solving an Infinite Horizon Adverse Selection Model Through Finite Policy Graphs

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

References

  • Abreu D, Pearce D, Stacchetti E. Towards a theory of discounted repeated games with imperfect monitoring. Econometrica (1990) 58:1041–1064CrossrefGoogle Scholar
  • Battaglini M. Long-term contracting with Markovian consumers. Amer. Econom. Rev. (2005) 95:637–658CrossrefGoogle Scholar
  • Battaglini M, Coate S. Pareto efficient income taxation with stochastic abilities. J. Public Econom. (2008) 92:844–868CrossrefGoogle Scholar
  • Bolton P, Dewatripont M. Contract Theory (2005) (MIT Press, Cambridge, MA) Google Scholar
  • Cole H, Kocherlakota N. Dynamic games with hidden actions and hidden states. J. Econom. Theory (2001) 98:114–126CrossrefGoogle Scholar
  • Doepke M, Townsend RM. Dynamic mechanism design with hidden income and hidden actions. J. Econom. Theory (2006) 126:235–285CrossrefGoogle Scholar
  • Fernandes A, Phelan C. A recursive formulation for repeated agency with history dependence. J. Econom. Theory (2000) 91:223–247CrossrefGoogle Scholar
  • Fudenberg D, Tirole J. Game Theory (1991) (MIT Press, Cambridge, MA) Google Scholar
  • Hansen EA. An improved policy iteration algorithm for partially observable MDPs. Advances in Neural Inform. Processing Systems (1998) 10(MIT Press, Cambridge, MA) 1015–1021(NIPS-97)Google Scholar
  • Howard R. Dynamic Programming and Markov Processes (1960) (Technology Press--Wiley, Cambridge, MA) Google Scholar
  • Judd KL, Yeltekin S, Conklin J. Computing supergame equilibria. Econometrica (2003) 71:1239–1254CrossrefGoogle Scholar
  • Kapicka M. Efficient allocations in dynamic private information economies with persistent shocks: A first-order approach. (2011) . Working paper, University of California, Santa Barbara, Santa Barbara, CAGoogle Scholar
  • Laffont J-J, Martimort D. The Theory of Incentives: The Principal-Agent Model (2002) (Princeton University Press, Princeton, NJ) CrossrefGoogle Scholar
  • Myerson RB. Multistage games with communication. Econometrica (1986) 54(2):323–358CrossrefGoogle Scholar
  • Phelan C, Townsend RM. Computing multi-period, information-constrained optima. Rev. Econom. Stud. (1991) 58:853–881CrossrefGoogle Scholar
  • Puterman ML. Markov Decision Processes: Discrete Stochastic Dynamic Programming (1994) (John Wiley & Sons, New York) CrossrefGoogle Scholar
  • Salanie B. The Economics of Contracts (1997) (MIT Press, Cambridge, MA) Google Scholar
  • Sleet C. On credible monetary policy and private government information. J. Econom. Theory (2001) 99:338–376CrossrefGoogle Scholar
  • Sleet C, Yeltekin S. Dynamic labor contracts with temporary layoffs and permanent separations. Econom. Theory (2001) 18:207–235CrossrefGoogle Scholar
  • Sleet C, Yeltekin S. Recursive monetary policy games with incomplete information. J. Econom. Dynam. Control (2007) 31:1557–1583CrossrefGoogle Scholar
  • Spear SE, Srivastava S. On repeated moral hazard with discounting. Rev. Econom. Stud. (1987) 54:599–617CrossrefGoogle Scholar
  • Tchistyi A. Security design with correlated hidden cash flows: The optimality of performance pricing. (2006) . Working paper, New York University, New YorkGoogle Scholar
  • Zhang H. Partially observable Markov decision processes: A geometric technique and analysis. Oper. Res. (2010) 58(1):214–228LinkGoogle Scholar
  • Zhang H. Analysis of a dynamic adverse selection model with asymptotic efficiency. Math. Oper. Res. (2012) . ePub ahead of print April 18, http://dx.doi.org/10.1287/moor.1120.0541Google Scholar
  • Zhang H, Zenios S. A dynamic principal-agent model with hidden information: Sequential optimality through truthful state revelation. Oper. Res. (2008) 56(3):681–696LinkGoogle Scholar
  • Zhang H, Nagarajan M, Sosic G. Dynamic supplier contracts under asymmetric inventory information. Oper. Res. (2010) 58(5):1380–1390LinkGoogle 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.