paper-with-me

Papers

Optimal Online Bookmaking for Binary Games

2025-01-12 · Alankrita Bhatt, Or Ordentlich, Oron Sabag

In online betting, the bookmaker can update the payoffs it offers on a particular event many times before the event takes place, and the updated payoffs may depend on the bets accumulated thus far. We study the problem of bookmaking with the goal of maximizing the return in the worst-case, with respect to the gamblers' behavior and the event's outcome. We formalize this problem as the \emph{Optimal Online Bookmaking game}, and provide the exact solution for the binary case. To this end, we develop the optimal bookmaking strategy, which relies on a new technique called bi-balancing trees, that assures that the house loss is the same for all \emph{decisive} betting sequences, where the gambler bets all its money on a single outcome in each round.

📄 PDF Abstract BibTeX arXiv:2501.06923

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Optimal Online Bookmaking for Any Number of Outcomes

2025-06-19 · Hadar Tal, Oron Sabag

We study the Online Bookmaking problem, where a bookmaker dynamically updates betting odds on the possible outcomes of an event. In each betting round, the bookmaker can adjust the odds based on the cumulative betting be…

Optimal Bookmaking

2019-07-01 · Matthew Lorig, Zhou Zhou, Bin Zou

We introduce a general framework for continuous-time betting markets, in which a bookmaker can dynamically control the prices of bets on outcomes of random events. In turn, the prices set by the bookmaker affect the rate…

Online Learning and Solving Infinite Games with an ERM Oracle

2023-07-04 · Angelos Assos, Idan Attias, Yuval Dagan, Constantinos Daskalakis 외

While ERM suffices to attain near-optimal generalization error in the stochastic learning setting, this is not known to be the case in the online learning setting, where algorithms for general concept classes rely on com…

Binary Classification

Fast Rates for Nonparametric Online Learning: From Realizability to Learning in Games

2021-11-17 · Constantinos Daskalakis, Noah Golowich

We study fast rates of convergence in the setting of nonparametric online regression, namely where regret is defined with respect to an arbitrary function class which has bounded complexity. Our contributions are two-fol…

regression

Recognizing Affiliation: Using Behavioural Traces to Predict the Quality of Social Interactions in Online Games

2020-03-06 · Julian Frommel, Valentin Sagl, Ansgar E. Depping, Colby Johanson 외

Online social interactions in multiplayer games can be supportive and positive or toxic and harmful; however, few methods can easily assess interpersonal interaction quality in games. We use behavioural traces to predict…