IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2606.24015.html

Continuous-Time Information-Mechanism Control

Author

Listed:
  • Furkan Sezer

Abstract

In a continuous-time stochastic Stackelberg differential game, a leader steers strategic followers through the information structure and a transfer mechanism, not the dynamics. We pose two problems, neither formulated as a control problem with strategic followers: information control, where the leader commits only to a disclosure policy, and information-mechanism control, which adjoins transfers. The first is equilibrium-constrained and admits no dynamic programming principle; the second is tractable, and the transfer is why: alignment makes the lower level a potential game, collapsing the bilevel problem to one stochastic control problem with an exact first-order condition. Disclosure precision becomes a control input and the belief a controlled state obeying a Riccati equation. The latent environment is a jump-diffusion whose belief filter is exactly finite-dimensional under publicly observed epochs. A marginal-contribution transfer makes truthful reporting dominant and efficient action the Nash response. Equilibrium feedback is saturated on strictly convex components and bang-bang on linear ones, hence discontinuous. The master value is the unique viscosity solution of a partial integro-differential Hamilton-Jacobi-Bellman equation whose nonlocal term carries the epochs; verification holds without smoothness, and semiconcavity makes the switching set null, giving a well-posed Filippov closed loop. Instantiated on multi-area power systems, the levers are complements under a one-factor common shock. Calibrated to 2021 Winter Storm Uri, coupling removes 7.4% of social cost relative to autarky, rising to 35% at a 10-gigawatt tie, and disclosure is worth 8.7%; under a European renewable-drought calibration it is worth 37% under autarky and 48% under coupling.

Suggested Citation

  • Furkan Sezer, 2026. "Continuous-Time Information-Mechanism Control," Papers 2606.24015, arXiv.org, revised Aug 2026.
  • Handle: RePEc:arx:papers:2606.24015
    as

    Download full text from publisher

    File URL: https://arxiv.org/pdf/2606.24015
    File Function: Latest version
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Wolfram Wiesemann & Daniel Kuhn & Melvyn Sim, 2014. "Distributionally Robust Convex Optimization," Operations Research, INFORMS, vol. 62(6), pages 1358-1376, December.
    2. Aïd, René & Bonesini, Ofelia & Callegaro, Giorgia & Campi, Luciano, 2025. "Continuous-time persuasion by filtering," LSE Research Online Documents on Economics 127889, London School of Economics and Political Science, LSE Library.
    3. Bergemann, Dirk & Morris, Stephen, 2016. "Bayes correlated equilibrium and the comparison of information structures in games," Theoretical Economics, Econometric Society, vol. 11(2), May.
    4. Fabio Bagagiolo & Dario Bauso, 2014. "Mean-Field Games and Dynamic Demand Management in Power Grids," Dynamic Games and Applications, Springer, vol. 4(2), pages 155-176, June.
    5. Laurent Mathevet & Jacopo Perego & Ina Taneva, 2020. "On Information Design in Games," Journal of Political Economy, University of Chicago Press, vol. 128(4), pages 1370-1404.
    6. Aïd, René & Bonesini, Ofelia & Callegaro, Giorgia & Campi, Luciano, 2025. "Continuous-time persuasion by filtering," Journal of Economic Dynamics and Control, Elsevier, vol. 176(C).
    7. Dirk Bergemann & Stephen Morris, 2019. "Information Design: A Unified Perspective," Journal of Economic Literature, American Economic Association, vol. 57(1), pages 44-95, March.
    8. Yang Yang & Minglei Bao & Yi Ding & Yonghua Song & Zhenzhi Lin & Changzheng Shao, 2018. "Review of Information Disclosure in Different Electricity Markets," Energies, MDPI, vol. 11(12), pages 1-20, December.
    9. Pär Holmberg & Frank A. Wolak, 2018. "Comparing auction designs where suppliers have uncertain costs and uncertain pivotal status," RAND Journal of Economics, RAND Corporation, vol. 49(4), pages 995-1027, December.
    10. Luis Rayo & Ilya Segal, 2010. "Optimal Information Disclosure," Journal of Political Economy, University of Chicago Press, vol. 118(5), pages 949-987.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Furkan Sezer, 2026. "Markov Information Processes," Papers 2607.04308, arXiv.org.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Chan, Jimmy & Gupta, Seher & Li, Fei & Wang, Yun, 2019. "Pivotal persuasion," Journal of Economic Theory, Elsevier, vol. 180(C), pages 178-202.
      • Jimmy Chan & Seher Gupta & Fei Li & Yun Wang, 2018. "Pivotal Persuasion," Working Papers 2018-11-03, Wang Yanan Institute for Studies in Economics (WISE), Xiamen University.
    2. Alonso, Ricardo & Zachariadis, Konstantinos E., 2024. "Persuading large investors," Journal of Economic Theory, Elsevier, vol. 222(C).
    3. Feng, Xin, 2020. "Information disclosure on the contest mechanism," Journal of Mathematical Economics, Elsevier, vol. 91(C), pages 148-156.
    4. Li, Fei & Song, Yangbo & Zhao, Mofei, 2023. "Global manipulation by local obfuscation," Journal of Economic Theory, Elsevier, vol. 207(C).
    5. Toygar T. Kerman & P. Jean‐Jacques Herings & Dominik Karos, 2024. "Persuading sincere and strategic voters," Journal of Public Economic Theory, Association for Public Economic Theory, vol. 26(1), February.
    6. Sato, Hiroto & Shirakawa, Ryo, 2025. "Information structures in college admissions," Journal of Economic Behavior & Organization, Elsevier, vol. 240(C).
    7. Asriyan, Vladimir & Fuchs, William & Green, Brett, 2021. "Aggregation and design of information in asset markets with adverse selection," Journal of Economic Theory, Elsevier, vol. 191(C).
    8. Zeng, Yishu, 2023. "Derandomization of persuasion mechanisms," Journal of Economic Theory, Elsevier, vol. 212(C).
    9. Carroni, Elias & Ferrari, Luca & Righi, Simone, 2019. "The price of discovering your needs online," Journal of Economic Behavior & Organization, Elsevier, vol. 164(C), pages 317-330.
    10. Hiroto Sato, 2023. "Robust implementation in sequential information design under supermodular payoffs and objective," Review of Economic Design, Springer;Society for Economic Design, vol. 27(2), pages 269-285, June.
    11. Frédéric Koessler & Marie Laclau & Tristan Tomala, 2022. "Interactive Information Design," Mathematics of Operations Research, INFORMS, vol. 47(1), pages 153-175, February.
    12. Ozan Candogan & Philipp Strack, 2021. "Optimal Disclosure of Information to a Privately Informed Receiver," Papers 2101.10431, arXiv.org, revised Jan 2022.
    13. Li, Xuelin & Szydlowski, Martin & Yu, Fangyuan, 2025. "Dynamic information design in an entry game," Journal of Economic Theory, Elsevier, vol. 226(C).
    14. Jerry Anunrojwong & Krishnamurthy Iyer & David Lingenbrink, 2024. "Persuading Risk-Conscious Agents: A Geometric Approach," Operations Research, INFORMS, vol. 72(1), pages 151-166, January.
    15. Shih-Tang Su & Vijay G. Subramanian, 2022. "Order of Commitments in Bayesian Persuasion with Partial-informed Senders," Papers 2202.06479, arXiv.org.
    16. Makoto Shimoji, 2022. "Bayesian persuasion in unlinked games," International Journal of Game Theory, Springer;Game Theory Society, vol. 51(3), pages 451-481, November.
    17. Masaki Miyashita & Takashi Ui, 2023. "LQG Information Design," Papers 2312.09479, arXiv.org, revised Aug 2025.
    18. Frederic Koessler & Marco Scarsini & Tristan Tomala, 2025. "Information Design and Full Implementation in Nonatomic Games," Papers 2502.05920, arXiv.org, revised Feb 2026.
    19. You Zu & Krishnamurthy Iyer & Haifeng Xu, 2025. "Learning to Persuade on the Fly: Robustness Against Ignorance," Operations Research, INFORMS, vol. 73(1), pages 194-208, January.
    20. Farzaneh Farhadi & Demosthenis Teneketzis, 2022. "Dynamic Information Design: A Simple Problem on Optimal Sequential Information Disclosure," Dynamic Games and Applications, Springer, vol. 12(2), pages 443-484, June.

    More about this item

    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:arx:papers:2606.24015. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: arXiv administrators (email available below). General contact details of provider: https://arxiv.org/ .

    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.