IDEAS home Printed from https://ideas.repec.org/p/arx/papers/1204.3496.html
   My bibliography  Save this paper

Bayesian logistic betting strategy against probability forecasting

Author

Listed:
  • Masayuki Kumon
  • Jing Li
  • Akimichi Takemura
  • Kei Takeuchi

Abstract

We propose a betting strategy based on Bayesian logistic regression modeling for the probability forecasting game in the framework of game-theoretic probability by Shafer and Vovk (2001). We prove some results concerning the strong law of large numbers in the probability forecasting game with side information based on our strategy. We also apply our strategy for assessing the quality of probability forecasting by the Japan Meteorological Agency. We find that our strategy beats the agency by exploiting its tendency of avoiding clear-cut forecasts.

Suggested Citation

  • Masayuki Kumon & Jing Li & Akimichi Takemura & Kei Takeuchi, 2012. "Bayesian logistic betting strategy against probability forecasting," Papers 1204.3496, arXiv.org.
  • Handle: RePEc:arx:papers:1204.3496
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Masayuki Kumon & Akimichi Takemura & Kei Takeuchi, 2005. "Capital process and optimality properties of a Bayesian Skeptic in coin-tossing games," Papers math/0510662, arXiv.org, revised Sep 2008.
    2. Kei Takeuchi & Akimichi Takemura & Masayuki Kumon, 2009. "New procedures for testing whether stock price processes are martingales," Papers 0907.3273, arXiv.org, revised Feb 2010.
    3. Thomas M. Cover, 1991. "Universal Portfolios," Mathematical Finance, Wiley Blackwell, vol. 1(1), pages 1-29, January.
    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. Kumon, Masayuki & Takemura, Akimichi & Takeuchi, Kei, 2011. "Sequential optimizing strategy in multi-dimensional bounded forecasting games," Stochastic Processes and their Applications, Elsevier, vol. 121(1), pages 155-183, January.
    2. Foster, Dean P. & Vohra, Rakesh, 1999. "Regret in the On-Line Decision Problem," Games and Economic Behavior, Elsevier, vol. 29(1-2), pages 7-35, October.
    3. Seung-Hyun Moon & Yong-Hyuk Kim & Byung-Ro Moon, 2019. "Empirical investigation of state-of-the-art mean reversion strategies for equity markets," Papers 1909.04327, arXiv.org.
    4. Man Yiu Tsang & Tony Sit & Hoi Ying Wong, 2022. "Adaptive Robust Online Portfolio Selection," Papers 2206.01064, arXiv.org.
    5. Luo, Yong & Zhu, Bo & Tang, Yong, 2014. "Simulated annealing algorithm for optimal capital growth," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 408(C), pages 10-18.
    6. Fabio Stella & Alfonso Ventura, 2011. "Defensive online portfolio selection," International Journal of Financial Markets and Derivatives, Inderscience Enterprises Ltd, vol. 2(1/2), pages 88-105.
    7. Erhan Bayraktar & Donghan Kim & Abhishek Tilva, 2023. "Quantifying dimensional change in stochastic portfolio theory," Papers 2303.00858, arXiv.org, revised Apr 2023.
    8. Ormos, Mihály & Urbán, András & Zoltán, Tamás, 2009. "Logoptimális portfóliók empirikus vizsgálata [Empirical analysis of log-optimal portfolios]," Közgazdasági Szemle (Economic Review - monthly of the Hungarian Academy of Sciences), Közgazdasági Szemle Alapítvány (Economic Review Foundation), vol. 0(1), pages 1-18.
    9. Jarrod Wilcox, 2020. "Better portfolios with higher moments," Journal of Asset Management, Palgrave Macmillan, vol. 21(7), pages 569-580, December.
    10. Dmitry B. Rokhlin, 2021. "Relative utility bounds for empirically optimal portfolios," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 93(3), pages 437-462, June.
    11. Vladimir V'yugin, 2014. "Log-Optimal Portfolio Selection Using the Blackwell Approachability Theorem," Papers 1410.5996, arXiv.org, revised Jun 2015.
    12. R'emi J'ez'equel & Dmitrii M. Ostrovskii & Pierre Gaillard, 2022. "Efficient and Near-Optimal Online Portfolio Selection," Papers 2209.13932, arXiv.org.
    13. Miquel Noguer i Alonso & Sonam Srivastava, 2020. "Deep Reinforcement Learning for Asset Allocation in US Equities," Papers 2010.04404, arXiv.org.
    14. Malo Huard & Rémy Garnier & Gilles Stoltz, 2020. "Hierarchical robust aggregation of sales forecasts at aggregated levels in e-commerce, based on exponential smoothing and Holt's linear trend method," Working Papers hal-02794320, HAL.
    15. Christopher Dance & Alexei Gaivoronski, 2012. "Stochastic optimization for real time service capacity allocation under random service demand," Annals of Operations Research, Springer, vol. 193(1), pages 221-253, March.
    16. James Chok & Geoffrey M. Vasil, 2023. "Convex optimization over a probability simplex," Papers 2305.09046, arXiv.org.
    17. Kei Takeuchi & Akimichi Takemura & Masayuki Kumon, 2009. "New procedures for testing whether stock price processes are martingales," Papers 0907.3273, arXiv.org, revised Feb 2010.
    18. Shmilovici Armin & Ben-Gal Irad, 2012. "Predicting Stock Returns Using a Variable Order Markov Tree Model," Studies in Nonlinear Dynamics & Econometrics, De Gruyter, vol. 16(5), pages 1-33, December.
    19. Bin Li & Steven C. H. Hoi, 2012. "On-Line Portfolio Selection with Moving Average Reversion," Papers 1206.4626, arXiv.org.
    20. Alex Garivaltis, 2018. "Super-Replication of the Best Pairs Trade in Hindsight," Papers 1810.02444, arXiv.org, revised Oct 2022.

    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:1204.3496. 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: http://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.