IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v67y2021i1p72-92.html
   My bibliography  Save this article

How to Play Fantasy Sports Strategically (and Win)

Author

Listed:
  • Martin B. Haugh

    (Imperial College Business School, Imperial College London, London SW7 2AZ, United Kingdom;)

  • Raghav Singal

    (Department of Industrial Engineering and Operations Research, Columbia University, New York, New York 10027)

Abstract

Daily fantasy sports (DFS) is a multibillion-dollar industry with millions of annual users and widespread appeal among sports fans across a broad range of popular sports. Building on recent work, we provide a coherent framework for constructing DFS portfolios where we explicitly model the behavior of other DFS players. We formulate an optimization problem that accurately describes the DFS problem for a risk-neutral decision maker in both double-up and top-heavy payoff settings. Our formulation maximizes the expected reward subject to feasibility constraints, and we relate this formulation to mean-variance optimization and the outperformance of stochastic benchmarks. Using this connection, we show how the problem can be reduced to the problem of solving a series of binary quadratic programs. We also propose an algorithm for solving the problem where the decision maker can submit multiple entries to the DFS contest. This algorithm is motivated by submodularity properties of the objective function and by some new results on parimutuel betting. One of the contributions of our work is the introduction of a Dirichlet-multinomial data-generating process for modeling opponents’ team selections, and we estimate the parameters of this model via Dirichlet regressions. A further benefit to modeling opponents’ team selections is that it enables us to estimate the value, in a DFS setting, of both insider trading and collusion. We demonstrate the value of our framework by applying it to DFS contests during the 2017 National Football League season.

Suggested Citation

  • Martin B. Haugh & Raghav Singal, 2021. "How to Play Fantasy Sports Strategically (and Win)," Management Science, INFORMS, vol. 67(1), pages 72-92, January.
    • Handle: RePEc:inm:ormnsc:v:67:y:2021:i:1:p:72-92
    DOI: 10.1287/mnsc.2019.3528
    as

    Download full text from publisher

    File URL: https://doi.org/10.1287/mnsc.2019.3528
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.2019.3528?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Charles R. Plott & Jorgen Wit & Winston C. Yang, 2003. "Parimutuel betting markets as information aggregation devices: experimental results," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 22(2), pages 311-351, September.
    2. Terrell, Dek & Farmer, Amy, 1996. "Optimal Betting and Efficiency in Parimutuel Betting Markets with Information Costs," Economic Journal, Royal Economic Society, vol. 106(437), pages 846-868, July.
    3. Edward H. Kaplan & Stanley J. Garstka, 2001. "March Madness and the Office Pool," Management Science, INFORMS, vol. 47(3), pages 369-382, March.
    4. repec:czx:journl:v:10:y:2003:i:18:id:117 is not listed on IDEAS
    5. Thaler, Richard H & Ziemba, William T, 1988. "Parimutuel Betting Markets: Racetracks and Lotteries," Journal of Economic Perspectives, American Economic Association, vol. 2(2), pages 161-174, Spring.
    6. Fisher, M.L. & Nemhauser, G.L. & Wolsey, L.A., 1978. "An analysis of approximations for maximizing submodular set functions," LIDAM Reprints CORE 341, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    7. Fisher, M.L. & Nemhauser, G.L. & Wolsey, L.A., 1978. "An analysis of approximations for maximizing submodular set functions - 1," LIDAM Reprints CORE 334, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    8. Bryan Clair & David Letscher, 2007. "Optimal Strategies for Sports Betting Pools," Operations Research, INFORMS, vol. 55(6), pages 1163-1177, December.
    9. Fry Michael J & Lundberg Andrew W & Ohlmann Jeffrey W, 2007. "A Player Selection Heuristic for a Sports League Draft," Journal of Quantitative Analysis in Sports, De Gruyter, vol. 3(2), pages 1-35, April.
    10. Erhan Bayraktar & Alexander Munk, 2016. "High-Roller Impact: A Large Generalized Game Model of Parimutuel Wagering," Papers 1605.03653, arXiv.org, revised Mar 2017.
    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. David Bergman & Carlos Cardonha & Jason Imbrogno & Leonardo Lozano, 2023. "Optimizing the Expected Maximum of Two Linear Functions Defined on a Multivariate Gaussian Distribution," INFORMS Journal on Computing, INFORMS, vol. 35(2), pages 304-317, March.
    2. Martin B. Haugh & Chun Wang, 2022. "Play Like the Pros? Solving the Game of Darts as a Dynamic Zero-Sum Game," INFORMS Journal on Computing, INFORMS, vol. 34(5), pages 2540-2551, September.

    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. Stekler Herman O. & Klein Andrew, 2012. "Predicting the Outcomes of NCAA Basketball Championship Games," Journal of Quantitative Analysis in Sports, De Gruyter, vol. 8(1), pages 1-10, March.
    2. Frederic Koessler & Ch. Noussair & A. Ziegelmeyer, 2005. "Individual Behavior and Beliefs in Experimental Parimutuel Betting Markets," THEMA Working Papers 2005-08, THEMA (THéorie Economique, Modélisation et Applications), Université de Cergy-Pontoise.
    3. David Bergman & Carlos Cardonha & Jason Imbrogno & Leonardo Lozano, 2023. "Optimizing the Expected Maximum of Two Linear Functions Defined on a Multivariate Gaussian Distribution," INFORMS Journal on Computing, INFORMS, vol. 35(2), pages 304-317, March.
    4. Mohit Singh & Weijun Xie, 2020. "Approximation Algorithms for D -optimal Design," Mathematics of Operations Research, INFORMS, vol. 45(4), pages 1512-1534, November.
    5. Koessler, Frédéric & Noussair, Charles & Ziegelmeyer, Anthony, 2008. "Parimutuel betting under asymmetric information," Journal of Mathematical Economics, Elsevier, vol. 44(7-8), pages 733-744, July.
    6. Ortiz-Astorquiza, Camilo & Contreras, Ivan & Laporte, Gilbert, 2018. "Multi-level facility location problems," European Journal of Operational Research, Elsevier, vol. 267(3), pages 791-805.
    7. Dam, Tien Thanh & Ta, Thuy Anh & Mai, Tien, 2022. "Submodularity and local search approaches for maximum capture problems under generalized extreme value models," European Journal of Operational Research, Elsevier, vol. 300(3), pages 953-965.
    8. Beck, Yasmine & Ljubić, Ivana & Schmidt, Martin, 2023. "A survey on bilevel optimization under uncertainty," European Journal of Operational Research, Elsevier, vol. 311(2), pages 401-426.
    9. Guanyi Wang, 2024. "Robust Network Targeting with Multiple Nash Equilibria," Papers 2410.20860, arXiv.org, revised Nov 2024.
    10. Majun Shi & Zishen Yang & Wei Wang, 2023. "Greedy Guarantees for Non-submodular Function Maximization Under Independent System Constraint with Applications," Journal of Optimization Theory and Applications, Springer, vol. 196(2), pages 516-543, February.
    11. Rad Niazadeh & Negin Golrezaei & Joshua Wang & Fransisca Susan & Ashwinkumar Badanidiyuru, 2023. "Online Learning via Offline Greedy Algorithms: Applications in Market Design and Optimization," Management Science, INFORMS, vol. 69(7), pages 3797-3817, July.
    12. Angelini, Giovanni & De Angelis, Luca & Singleton, Carl, 2022. "Informational efficiency and behaviour within in-play prediction markets," International Journal of Forecasting, Elsevier, vol. 38(1), pages 282-299.
    13. Mohammad Abouei Mehrizi & Federico Corò & Emilio Cruciani & Gianlorenzo D’Angelo, 2022. "Election control through social influence with voters’ uncertainty," Journal of Combinatorial Optimization, Springer, vol. 44(1), pages 635-669, August.
    14. Eli Towle & James Luedtke, 2018. "New solution approaches for the maximum-reliability stochastic network interdiction problem," Computational Management Science, Springer, vol. 15(3), pages 455-477, October.
    15. Philip W. S. Newall & Dominic Cortis, 2021. "Are Sports Bettors Biased toward Longshots, Favorites, or Both? A Literature Review," Risks, MDPI, vol. 9(1), pages 1-9, January.
    16. Suning Gong & Qingqin Nong & Shuyu Bao & Qizhi Fang & Ding-Zhu Du, 2023. "A fast and deterministic algorithm for Knapsack-constrained monotone DR-submodular maximization over an integer lattice," Journal of Global Optimization, Springer, vol. 85(1), pages 15-38, January.
    17. Emily M. Craparo & Mumtaz Karatas & Tobias U. Kuhn, 2017. "Sensor placement in active multistatic sonar networks," Naval Research Logistics (NRL), John Wiley & Sons, vol. 64(4), pages 287-304, June.
    18. Alexandre D. Jesus & Luís Paquete & Arnaud Liefooghe, 2021. "A model of anytime algorithm performance for bi-objective optimization," Journal of Global Optimization, Springer, vol. 79(2), pages 329-350, February.
    19. Paul J. Healy & Sera Linardi & J. Richard Lowery & John O. Ledyard, 2010. "Prediction Markets: Alternative Mechanisms for Complex Environments with Few Traders," Management Science, INFORMS, vol. 56(11), pages 1977-1996, November.
    20. Oded Berman & Dmitry Krass & Mozart B. C. Menezes, 2007. "Facility Reliability Issues in Network p -Median Problems: Strategic Centralization and Co-Location Effects," Operations Research, INFORMS, vol. 55(2), pages 332-350, April.

    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:inm:ormnsc:v:67:y:2021:i:1:p:72-92. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.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.