IDEAS home Printed from https://ideas.repec.org/p/hal/journl/halshs-00754314.html
   My bibliography  Save this paper

Entropy bounds on Bayesian learning

Author

Listed:
  • Olivier Gossner

    (PJSE - Paris-Jourdan Sciences Economiques - ENS-PSL - École normale supérieure - Paris - PSL - Université Paris Sciences et Lettres - EHESS - École des hautes études en sciences sociales - ENPC - École des Ponts ParisTech - CNRS - Centre National de la Recherche Scientifique, PSE - Paris School of Economics - UP1 - Université Paris 1 Panthéon-Sorbonne - ENS-PSL - École normale supérieure - Paris - PSL - Université Paris Sciences et Lettres - EHESS - École des hautes études en sciences sociales - ENPC - École des Ponts ParisTech - CNRS - Centre National de la Recherche Scientifique - INRAE - Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement, Northwestern University [Evanston])

  • Tristan Tomala

    (CEREMADE - CEntre de REcherches en MAthématiques de la DEcision - Université Paris Dauphine-PSL - PSL - Université Paris Sciences et Lettres - CNRS - Centre National de la Recherche Scientifique)

Abstract

An observer of a process View the MathML source believes the process is governed by Q whereas the true law is P. We bound the expected average distance between P(xt|x1,...,xt−1) and Q(xt|x1,...,xt−1) for t=1,...,n by a function of the relative entropy between the marginals of P and Q on the n first realizations. We apply this bound to the cost of learning in sequential decision problems and to the merging of Q to P.

Suggested Citation

  • Olivier Gossner & Tristan Tomala, 2008. "Entropy bounds on Bayesian learning," Post-Print halshs-00754314, HAL.
    • Handle: RePEc:hal:journl:halshs-00754314
    DOI: 10.1016/j.jmateco.2007.04.006
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Other versions of this item:

    References listed on IDEAS

    as
    1. Kalai, Ehud & Lehrer, Ehud, 1994. "Weak and strong merging of opinions," Journal of Mathematical Economics, Elsevier, vol. 23(1), pages 73-86, January.
    2. Kalai, Ehud & Lehrer, Ehud, 1993. "Rational Learning Leads to Nash Equilibrium," Econometrica, Econometric Society, vol. 61(5), pages 1019-1045, September.
    3. Kalai, Ehud & Lehrer, Ehud & Smorodinsky, Rann, 1999. "Calibrated Forecasting and Merging," Games and Economic Behavior, Elsevier, vol. 29(1-2), pages 151-169, October.
    4. Lehrer, Ehud & Smorodinsky, Rann, 2000. "Relative entropy in sequential decision problems1," Journal of Mathematical Economics, Elsevier, vol. 33(4), pages 425-439, May.
    5. Ehud Lehrer & Rann Smorodinsky, 1996. "Compatible Measures and Merging," Mathematics of Operations Research, INFORMS, vol. 21(3), pages 697-706, August.
    6. Alvaro Sandroni & Rann Smorodinsky, 1999. "The speed of rational learning," International Journal of Game Theory, Springer;Game Theory Society, vol. 28(2), pages 199-210.
    7. D. Blackwell & L. Dubins, 2010. "Merging of Opinions with Increasing Information," Levine's Working Paper Archive 565, David K. Levine.
    8. Sorin, Sylvain, 1999. "Merging, Reputation, and Repeated Games with Incomplete Information," Games and Economic Behavior, Elsevier, vol. 29(1-2), pages 274-308, October.
    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. Ekmekci, Mehmet & Gossner, Olivier & Wilson, Andrea, 2012. "Impermanent types and permanent reputations," Journal of Economic Theory, Elsevier, vol. 147(1), pages 162-178.
    2. Benjamin Van Roy & Xiang Yan, 2009. "Manipulation Robustness of Collaborative Filtering Systems," Working Papers 09-21, NET Institute, revised Sep 2009.
    3. Benjamin Van Roy & Xiang Yan, 2010. "Manipulation Robustness of Collaborative Filtering," Management Science, INFORMS, vol. 56(11), pages 1911-1929, November.

    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. Colin, Stewart, 2011. "Nonmanipulable Bayesian testing," Journal of Economic Theory, Elsevier, vol. 146(5), pages 2029-2041, September.
    2. Al-Najjar, Nabil I. & Shmaya, Eran, 2018. "Learning the fundamentals in a stationary environment," Games and Economic Behavior, Elsevier, vol. 109(C), pages 616-624.
    3. Mario Gilli, 2002. "Rational Learning in Imperfect Monitoring Games," Working Papers 46, University of Milano-Bicocca, Department of Economics, revised Mar 2002.
    4. Al-Najjar, Nabil I. & Sandroni, Alvaro & Smorodinsky, Rann & Weinstein, Jonathan, 2010. "Testing theories with learnable and predictive representations," Journal of Economic Theory, Elsevier, vol. 145(6), pages 2203-2217, November.
    5. Sandroni, Alvaro, 1998. "Necessary and Sufficient Conditions for Convergence to Nash Equilibrium: The Almost Absolute Continuity Hypothesis," Games and Economic Behavior, Elsevier, vol. 22(1), pages 121-147, January.
    6. Lehrer, Ehud & Smorodinsky, Rann, 2000. "Relative entropy in sequential decision problems1," Journal of Mathematical Economics, Elsevier, vol. 33(4), pages 425-439, May.
    7. Norman, Thomas W.L., 2022. "The possibility of Bayesian learning in repeated games," Games and Economic Behavior, Elsevier, vol. 136(C), pages 142-152.
    8. Sorin, Sylvain, 1999. "Merging, Reputation, and Repeated Games with Incomplete Information," Games and Economic Behavior, Elsevier, vol. 29(1-2), pages 274-308, October.
    9. repec:ebl:ecbull:v:4:y:2003:i:11:p:1-12 is not listed on IDEAS
    10. Sandroni, Alvaro & Smorodinsky, Rann, 2004. "Belief-based equilibrium," Games and Economic Behavior, Elsevier, vol. 47(1), pages 157-171, April.
    11. Lehrer, Ehud & Smorodinsky, Rann, 1997. "Repeated Large Games with Incomplete Information," Games and Economic Behavior, Elsevier, vol. 18(1), pages 116-134, January.
    12. Miller, Ronald I. & Sanchirico, Chris William, 1999. "The Role of Absolute Continuity in "Merging of Opinions" and "Rational Learning"," Games and Economic Behavior, Elsevier, vol. 29(1-2), pages 170-190, October.
    13. Kalai, Ehud & Lehrer, Ehud & Smorodinsky, Rann, 1999. "Calibrated Forecasting and Merging," Games and Economic Behavior, Elsevier, vol. 29(1-2), pages 151-169, October.
    14. Ekmekci, Mehmet & Gossner, Olivier & Wilson, Andrea, 2012. "Impermanent types and permanent reputations," Journal of Economic Theory, Elsevier, vol. 147(1), pages 162-178.
    15. Monte, Daniel, 2013. "Bounded memory and permanent reputations," Journal of Mathematical Economics, Elsevier, vol. 49(5), pages 345-354.
    16. Alvaro Sandroni, "undated". ""Necessary and Sufficient Conditions for Convergence to Nash Equilibrium: The Almost Absolute Continuity Hypothesis''," CARESS Working Papres 95-08, University of Pennsylvania Center for Analytic Research and Economics in the Social Sciences.
    17. Conlon, John R., 2003. "Hope springs eternal: learning and the stability of cooperation in short horizon repeated games," Journal of Economic Theory, Elsevier, vol. 112(1), pages 35-65, September.
    18. Kalai, Ehud & Lehrer, Ehud, 1995. "Subjective games and equilibria," Games and Economic Behavior, Elsevier, vol. 8(1), pages 123-163.
    19. John H. Nachbar, 2005. "Beliefs in Repeated Games," Econometrica, Econometric Society, vol. 73(2), pages 459-480, March.
    20. Marco Scarsini & Yossi Feinberg, 2003. "Rate of Arbitrage and Reconciled Beliefs," Economics Bulletin, AccessEcon, vol. 4(11), pages 1-12.
    21. Burkhard C. Schipper, 2022. "Strategic Teaching and Learning in Games," American Economic Journal: Microeconomics, American Economic Association, vol. 14(3), pages 321-352, August.

    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:hal:journl:halshs-00754314. 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: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    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.