IDEAS home Printed from https://ideas.repec.org/p/cla/levarc/590.html
   My bibliography  Save this paper

Predicting a binary sequence almost as well as the optimal biased coin

Author

Listed:
  • Yoav Freund

Abstract

No abstract is available for this item.

Suggested Citation

  • Yoav Freund, 1997. "Predicting a binary sequence almost as well as the optimal biased coin," Levine's Working Paper Archive 590, David K. Levine.
    • Handle: RePEc:cla:levarc:590
    as

    Download full text from publisher

    File URL: http://www.dklevine.com/archive/binarylong.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. N. Littlestone & M. Warmuth, 2010. "The Weighted Majority Algorithm," Levine's Working Paper Archive 575, David K. Levine.
    2. M. Feder & N. Mehrav & M. Gutman, 2010. "Universal Prediction of Individual Sequences," Levine's Working Paper Archive 567, David K. Levine.
    Full references (including those not matched with items on IDEAS)

    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. Fudenberg, Drew & Levine, David K., 1999. "Conditional Universal Consistency," Games and Economic Behavior, Elsevier, vol. 29(1-2), pages 104-130, October.
    2. Sergiu Hart & Andreu Mas-Colell, 2013. "A General Class Of Adaptive Strategies," World Scientific Book Chapters, in: Simple Adaptive Strategies From Regret-Matching to Uncoupled Dynamics, chapter 3, pages 47-76, World Scientific Publishing Co. Pte. Ltd..
    3. Yoav Freund & Robert E Shapire, 1997. "Game Theory, On-line Prediction and Boosting," Levine's Working Paper Archive 593, David K. Levine.
    4. Bin Li & Steven C. H. Hoi, 2012. "Online Portfolio Selection: A Survey," Papers 1212.2129, arXiv.org, revised May 2013.
    5. Karl Schlag & Andriy Zapechelnyuk, 2010. "On the Impossibility of Regret Minimization in Repeated Games," Working Papers 676, Queen Mary University of London, School of Economics and Finance.

    More about this item

    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:cla:levarc:590. 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: David K. Levine (email available below). General contact details of provider: http://www.dklevine.com/ .

    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.