Sitemap
A list of all the posts and pages found on the site. For you robots out there, there is an XML version available for digesting as well.
Pages
Winning Against all Odds!
Archive Layout with Content
Posts by Category
Posts by Collection
CV
Markdown
Page not in menu
Page Archive
Portfolio
Publications
Sitemap
Posts by Tags
Talk map
Talks and presentations
Teaching
Terms and Privacy Policy
Blog posts
Jupyter notebook markdown generator
Posts
Future Blog Post
Published:
This post will show up by default. To disable scheduling of future posts, edit config.yml and set future: false.
Blog Post number 4
Published:
This is a sample blog post. Lorem ipsum I can’t remember the rest of lorem ipsum and don’t have an internet connection right now. Testing testing testing this blog post. Blog posts are cool.
Blog Post number 3
Published:
This is a sample blog post. Lorem ipsum I can’t remember the rest of lorem ipsum and don’t have an internet connection right now. Testing testing testing this blog post. Blog posts are cool.
Blog Post number 2
Published:
This is a sample blog post. Lorem ipsum I can’t remember the rest of lorem ipsum and don’t have an internet connection right now. Testing testing testing this blog post. Blog posts are cool.
Blog Post number 1
Published:
This is a sample blog post. Lorem ipsum I can’t remember the rest of lorem ipsum and don’t have an internet connection right now. Testing testing testing this blog post. Blog posts are cool.
portfolio
Portfolio item number 1
Short description of portfolio item number 1
Portfolio item number 2
Short description of portfolio item number 2
publications
Simplifying the Madness of March Madness
Under 2nd round Major Revision at Production and Operations Management, 2025
Abstract: This paper investigates the effectiveness of maximizing the expected value of the best-performing entry in multi-entry betting pools for single-elimination tournaments, with a particular focus on March Madness. In such betting pools, participants select winners for each game, and their score is a weighted sum of the correct selections. Due to the top-heavy payout structures in these pools, we study whether maximizing the expected score of the highest-scoring entry, which has been successfully adopted in the sports betting literature, is a suitable modeling approach for March Madness betting pools. Unlike traditional methods that require modeling how other participants make their selections - an especially challenging task given that March Madness only occurs annually - this approach only requires win probability estimates for teams as input, and inherently provides a diversified position across multiple entries. We present an exact dynamic programming approach for calculating the expected maximum score of any fixed set of entries. Additionally, we explore the structural properties of this approach to develop several solution techniques. Using insights from one of our algorithms, we design a simple yet effective heuristic which delivers high-quality results when tested against high-roller betters in a real-world March Madness betting pool. In particular, our results demonstrate that the best 100-entry solution identified by our approach had a 2% likelihood of winning a $1 million prize in a real-world betting pool, showing that the proposed heuristic is competitive even against the best professional bettors.
Recommended citation: Jeff Decary, David Bergman, Carlos Cardonha, Jason Imbrogno, and Andrea Lodi (2025). "Simplifying the Madness of March Madness"; URL https://arxiv.org/abs/2407.13438.
Download Paper | Download Slides
Log-Optimal Portfolio Construction for Binary Options with Combinatorial Constraints
Under Review at Management Science, 2025 (Previously Reject-and-resubmit from Operations Research)
Abstract: We study the problem of optimal wealth allocation across independent binary options with known payouts, aiming to maximize log utility under practical constraints. This general framework arises in settings such as prediction markets (e.g., Kalshi and Polymarket), financial event contracts (e.g., Nadex), and sports betting (e.g., Draftkings and FanDuel). The Kelly Criterion provides a classical solution for the bet sizing of a single binary option, and numerous papers have explored extensions to multiple binary options. Our work expands on this body of research by investigating how to incorporate combinatorial constraints into the model, including limits on the number of binary options to select in a portfolio, a requirement that arises in many settings. These constraints considerably increase the computational complexity of the problem, thereby necessitating advanced solution methodologies. To address this challenge, we develop a logic-based Benders decomposition algorithm that provides a scalable and computationally efficient solution framework. Although broadly applicable, we focus on sports betting due to its market scale and unique inclusion of parlay options. We also study how sportsbooks can make slight modifications to parlay pricing so that optimal allocations do not include parlay options, even though such options may remain attractive to bettors.
Recommended citation: Jeff Decary, David Bergman, Bin Zou (2025). "Log-Optimal Portfolio Construction for Binary Options with Combinatorial Constraints".
Download Paper
talks
The Madness of Multiple Entries in March Madness
Presented at:
- Talk, INFORMS Annual Meeting, Seattle, USA (October 20-23, 2024)
- Poster, ICERM: Discrete Optimization, Brown University, Providence, USA (August 26-30, 2024)
- Poster, Economics and Computation, Yale University, New Haven, USA (July 08-11, 2024)
- Poster, NYC Operations Day, Columbia University, New York, USA (May 10, 2024)
- Talk, INFORMS Annual Meeting, Phoenix, USA (October 15-18, 2023)
- Talk, 29th International Conference on Principles and Practice of Constraint Programming, University of Toronto, Toronto, Canada (August 27-31, 2023)
teaching
OPIM 3103. Business Information Systems
Teaching Assistant
Spring 2022, Spring 2021, and Fall 2020
Undergraduate course, University of Connecticut, Operations and Information Management, 2022
I held office hours and graded homeworks and exams.
OPIM 3103. Business Information Systems
Instructor
Spring 2023 and Fall 2022
Undergraduate course, University of Connecticut, Operations and Information Management, 2023
I introduced Excel and business information systems through data analysis
OPIM 3104. Operations Management
Teaching Assistant
Spring 2024 and Fall 2021
Undergraduate course, University of Connecticut, Operations and Information Management, 2024
I held office hours, graded exams and assisted the professor during in-class activities to guide students.
OPIM 3602. Supply Chain Logistics
Teaching Assistant
Spring 2024
Undergraduate course, University of Connecticut, Operations and Information Management, 2024
I held office hours and graded exams.