IDEAS home Printed from https://ideas.repec.org/p/tse/wpaper/31316.html

Optimal Dynamic Information Provision

Author

Listed:
  • Renault, Jérôme
  • Solan, Eilon
  • Vieille, Nicolas

Abstract

We study a dynamic model of information provision. A state of nature evolves according to a Markov chain. An advisor with commitment power decides how much information to provide to an uninformed decision maker, so as to influence his short-term decisions. We deal with a stylized class of situations, in which the decision maker has a risky action and a safe action, and the payoff to the advisor only depends on the action chosen by the decision maker. The greedy disclosure policy is the policy which, at each round, minimizes the amount of information being disclosed in that round, under the constraint that it maximizes the current payoff of the advisor. We prove that the greedy policy is optimal in many cases – but not always.

Suggested Citation

  • Renault, Jérôme & Solan, Eilon & Vieille, Nicolas, 2017. "Optimal Dynamic Information Provision," TSE Working Papers 17-749, Toulouse School of Economics (TSE).
    • Handle: RePEc:tse:wpaper:31316
    as

    Download full text from publisher

    File URL: https://docs.google.com/viewer?a=v&pid=sites&srcid=ZGVmYXVsdGRvbWFpbnxqcmVuYXVsdHNpdGV8Z3g6MzVhMWQ0ZDU2N2UyM2NmZA
    File Function: Full text
    Download Restriction: no
    ---><---

    Other versions of this item:

    More about this item

    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

    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:tse:wpaper:31316. 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: the person in charge (email available below). General contact details of provider: https://edirc.repec.org/data/tsetofr.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.