The Near-Miss Effect in Slot Machines: A Review and Experimental Analysis Over Half a Century Later
Bibliographic record
Abstract
In games of chance, a near miss is said to occur when feedback for a loss approximates a win. For instance, obtaining "cherry-cherry-lemon" on a slot machine could be considered a near miss. Sixty-six years ago, B.F. Skinner first proposed the idea that near-miss events might reinforce continued play in slot machines, and despite some inconsistencies in the experimental literature, belief in this "near-miss effect" has remained strong. In the present manuscript, we will review this literature and present experimental assessments of the near-miss effect on the frequency of the gambling response. Experiment 1 used a tightly controlled resistance-to-extinction procedure in pigeons to evaluate the putative reinforcing effect of near misses relative to a control "far-miss" reel pattern. Experiment 2 extended Experiment 1's procedure to human participants. The results of both experiments failed to support the near-miss effect hypothesis. Experiment 3 used a further simplified procedure to assess the validity of the resistance-to-extinction paradigm when a probable conditional reinforcer was present on the reel stimuli. Although a clear conditional response was obtained from the reel, subsequent testing in extinction revealed no conditionally reinforcing function of this stimulus on operant response frequency.
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.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.002 | 0.001 |
| Bibliometrics | 0.003 | 0.004 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 0.001 |
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".