OpenAlex ·

Two-resolution state modelling of intermittent online gambling activity during Sweden's temporary deposit-cap period

Sam Andersson, Timo Koski, Helga Westerlind, Keenan Lyon, Per Carlbring and Olof Molander

Published
Source
OpenAlex
Published in
arXiv (Cornell University)
DOI
10.48550/arxiv.2609.07794
Original
Read it at the publisher
Topics
Artificial IntelligenceProbabilityStatistics TheoryPsychiatry & Mental Health

Abstract

Intermittent online gambling records create two distinct representation problems: calendar-time analyses must retain represented days with no recorded play, whereas analyses of active behaviour must preserve variation within active episodes. We pair calendar-time and active-bout models in a two-resolution analysis of 14.2 million player-days from a single operator during 2019-2023. The calendar-time layer retains assignable represented days in five observed categories and propagates a pre-period reference. The active-episode layer fits a Bayesian mixed-emission hidden semi-Markov model to turnover, playing time, approved deposits and session counts. In the reference four-regime fit, two regimes share a rounded model-implied turnover median of 153.5 EUR, while their model-implied playing-time and approved-deposit medians differ by factors of 4.6 and 5.7, respectively, and their expected total session counts by a factor of 2.8. This separation remains under an ordinary hidden Markov model, two routing perturbations and a residual-dependence sensitivity; the tested turnover-only fits were diagnostically unstable. Over the temporary Swedish deposit-cap period, deposits and turnover per represented player-day were roughly 55% below the propagated reference and active-category occupancy was 7.8% lower. The largest negative deviations in a prespecified Sweden-assigned cohort occurred among high pre-policy deposit-intensity customers. These are operator-specific descriptive comparisons, not causal policy effects.

The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.

Read it on ReadSearch

Each opens after you create an account, and brings you back to this paper.

Already a reader? Sign in

All new papers in Artificial Intelligence

Get the few papers worth your time in Artificial Intelligence every morning.

ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.

Papers belong to their authors and publishers; every page here links to the original. All research topics