Increased volatility in video poker results in more winning players but shorter winning streaks – Evidence from simulations
Bibliographic record
Abstract
Objective and Method: Electronic gambling machines are a prominent cause of significant gambling harms globally. We use simulations of a simplified video poker game to show how changes in game volatility, defined primarily by the size of the main prize, affect patterns of wins and losses as well as winning streaks. Results: We found that in low- and medium volatility games the proportion of winning players quickly drops to zero after about 30 h of play, while in the high volatility game 5% of players are still winning after playing for 100 h. However, the proportion of winning streaks was significantly higher in the low- and medium volatility games compared with high volatility: the simulated players were on a winning streak about 26.3, 25.6 and 18% of the time in the low-, medium- and high volatility games, respectively. Conclusions: Fast-paced video poker with varying volatility levels but identical return-to-player rates and win frequencies can yield highly different result patterns across individuals. These patterns may be counter-intuitive for players and difficult to realize without simulations and visualizations. We argue that the findings have relevance for responsible gambling communication and for building a better understanding of how cognitive biases influence gambling behaviour.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.003 | 0.021 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".