IDEAS home Printed from https://ideas.repec.org/p/red/sed006/871.html
   My bibliography  Save this paper

The role of information in repeated games with frequent actions

Author

Listed:
  • Yuliy Sannikov
  • Andrzej Skrzypacz

    (GSB Stanford University)

Abstract

We show that the ways incentives can be provided during dynamic interaction depend very crucially on the manner in which players learn information. This conclusion is established in a general stationary environment with noisy public monitoring and frequent actions. The monitoring process can be represented by a sum of a multi-dimensional Brownian component and a jump process. We show that jumps can be used to provide incentives both with transfers and value burning while continuous information can be used to provide incentives only with transfers. Also, it is asymptotically optimal to use the cumulative realization of the Brownian component linearly. Additionally, we approximate the equilibrium payoff set for fixed small discount rates as the periods become short by a series of linear programming problems. These problems highlight how the two types of information can be used to provide incentives.

Suggested Citation

  • Yuliy Sannikov & Andrzej Skrzypacz, 2006. "The role of information in repeated games with frequent actions," 2006 Meeting Papers 871, Society for Economic Dynamics.
    • Handle: RePEc:red:sed006:871
    as

    Download full text from publisher

    File URL: http://www.stanford.edu/~skrz/SannikovSkrzypacz.pdf
    File Function: main text
    Download Restriction: no
    ---><---

    Other versions of this item:

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Bernard, Benjamin & Frei, Christoph, 2016. "The folk theorem with imperfect public information in continuous time," Theoretical Economics, Econometric Society, vol. 11(2), May.
    2. Fudenberg, Drew & Olszewski, Wojciech, 2011. "Repeated games with asynchronous monitoring of an imperfect signal," Games and Economic Behavior, Elsevier, vol. 72(1), pages 86-99, May.
    3. Pierre Yared, 2008. "The Use of Concessions in Forestalling War," 2008 Meeting Papers 32, Society for Economic Dynamics.
    4. Christian Bayer & Klaus Waelde, 2011. "Describing the Dynamics of Distributions in Search and Matching Models by Fokker-Planck Equations," Working Papers 1110, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz, revised 21 Jul 2011.
    5. Hörner, Johannes & Takahashi, Satoru, 2016. "How fast do equilibrium payoff sets converge in repeated games?," Journal of Economic Theory, Elsevier, vol. 165(C), pages 332-359.
    6. Henri Pages & Dylan Possamaï, 2014. "A mathematical treatment of bank monitoring incentives," Finance and Stochastics, Springer, vol. 18(1), pages 39-73, January.
    7. Bhattacharya, Vivek & Manuelli, Lucas & Straub, Ludwig, 2018. "Imperfect public monitoring with a fear of signal distortion," Journal of Economic Theory, Elsevier, vol. 175(C), pages 1-37.
    8. Drew Fudenberg & David K. Levine, 2008. "Continuous time limits of repeated games with imperfect public monitoring," World Scientific Book Chapters, in: Drew Fudenberg & David K Levine (ed.), A Long-Run Collaboration On Long-Run Games, chapter 17, pages 369-388, World Scientific Publishing Co. Pte. Ltd..
    9. Osório António M., 2012. "A Folk Theorem for Games when Frequent Monitoring Decreases Noise," The B.E. Journal of Theoretical Economics, De Gruyter, vol. 12(1), pages 1-27, April.
    10. Osório Costa, Antonio Miguel, 2012. "The Limits of Discrete Time Repeated Games:Some Notes and Comments," Working Papers 2072/203171, Universitat Rovira i Virgili, Department of Economics.
    11. Aislinn Bohren, 2016. "Using Persistence to Generate Incentives in a Dynamic Moral Hazard Problem," PIER Working Paper Archive 16-024, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania, revised 15 Oct 2016.
    12. Staudigl, Mathias, 2014. "A limit theorem for Markov decision processes," Center for Mathematical Economics Working Papers 475, Center for Mathematical Economics, Bielefeld University.
    13. Hartman-Glaser, Barney & Piskorski, Tomasz & Tchistyi, Alexei, 2012. "Optimal securitization with moral hazard," Journal of Financial Economics, Elsevier, vol. 104(1), pages 186-202.
    14. Fudenberg, Drew & Ishii, Yuhta & Kominers, Scott Duke, 2014. "Delayed-response strategies in repeated games with observation lags," Journal of Economic Theory, Elsevier, vol. 150(C), pages 487-514.
    15. Piskorski, Tomasz & Westerfield, Mark M., 2016. "Optimal dynamic contracts with moral hazard and costly monitoring," Journal of Economic Theory, Elsevier, vol. 166(C), pages 242-281.
    16. Daehyun Kim & Ichiro Obara, 2023. "On the Value of Information Structures in Stochastic Games," Papers 2308.09211, arXiv.org.
    17. Hackbarth, Dirk & Taub, Bart, 2018. "Does the Potential to Merge Reduce Competition?," CEPR Discussion Papers 12732, C.E.P.R. Discussion Papers.
    18. António Osório, 2018. "Brownian Signals: Information Quality, Quantity and Timing in Repeated Games," Computational Economics, Springer;Society for Computational Economics, vol. 52(2), pages 387-404, August.
    19. Xi Chen & Yu Chen & Xuhu Wan, 2018. "Delegated Project Search," Graz Economics Papers 2018-11, University of Graz, Department of Economics.
    20. Roman, Mihai Daniel, 2010. "A game theoretic approach of war with financial influences," MPRA Paper 38389, University Library of Munich, Germany.
    21. Eduardo Faingold, 2020. "Reputation and the Flow of Information in Repeated Games," Econometrica, Econometric Society, vol. 88(4), pages 1697-1723, July.
    22. Kobayashi, Hajime & Ohta, Katsunori, 2012. "Optimal collusion under imperfect monitoring in multimarket contact," Games and Economic Behavior, Elsevier, vol. 76(2), pages 636-647.
    23. Dylan Possamai & Chiara Rossato, 2023. "Golden parachutes under the threat of accidents," Papers 2312.02101, arXiv.org.
    24. Osório Costa, Antonio Miguel, 2011. "Public Monitoring with Uncertainty in the Time Repetitions," Working Papers 2072/179668, Universitat Rovira i Virgili, Department of Economics.

    More about this item

    Keywords

    repeated games; dynamic incentives; frequent moves;
    All these keywords.

    JEL classification:

    • C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
    • C73 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Stochastic and Dynamic Games; Evolutionary Games
    • D82 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Asymmetric and Private Information; Mechanism Design

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:red:sed006:871. See general information about how to correct material in RePEc.

    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.

    We have no bibliographic references for this item. You can help adding them by using 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Christian Zimmermann (email available below). General contact details of provider: https://edirc.repec.org/data/sedddea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.