Published October 7, 2026 | Version 1

The Price of Fairness: Qualification Reliability in Agentic Poker Tournaments

Authors/Creators

  • 1. FullHouse Research

Description

Agentic poker competitions select finalists from noisy outcomes under finite simulation budgets. We study top-six qualification in 60-agent, six-player no-limit hold'em Swiss tournaments using three controlled fields and two mechanism-specific reference estimands. At the baseline of 40 rounds with 400 hands per match, independent reruns change 3.83 to 4.38 of six qualifiers on average. Even in an engineered separated control, six independently validated leaders qualify individually with probabilities of only 0.31 to 0.76. Selection improves at every observed checkpoint from five to 40 rounds, without an observed plateau. At an equal scheduled hand budget, ten 1,600-hand rounds produce 0.42 to 0.87 more changed qualifiers than forty 400-hand rounds. Adaptive Swiss is more consistent than fresh-randomness replay of its realised schedules, although this comparison does not identify adaptation's causal effect. A short-match duplicate package improves ranking consistency across all three fields; improvements in changed qualifiers and regret are individually clear only in the separated control. Most wrong qualifiers lie outside the reference-ambiguous set, and reference uncertainty accounts for little of the measured strength loss. These results favour distributing scheduled simulation across more rounds in the tested setting, while leaving the budget required for stable qualification unresolved.

Files

FHR4-Supplementary-Data.zip

Files (3.9 MB)

Name Size
md5:1ec46b4e0896e699755f9c3c13a4e5da
19.5 kB Preview Download
md5:b02ce9b143e9b0f88c5117fdf35d1d64
2.8 MB Download
md5:f3077b8c1a162417cf20a74daae0c936
1.1 MB Preview Download

Additional details

Related works

References

  • Sziklai, B. R., Biró, P. and Csató, L. (2022). The efficacy of tournament designs. Computers & Operations Research, 144, 105821.
  • Hua, C. (2017). The Swiss Tournament Model. Wharton Research Scholars undergraduate thesis, University of Pennsylvania.
  • Bard, N., Hawkin, J., Rubin, J. and Zinkevich, M. (2013). The Annual Computer Poker Competition. AI Magazine, 34(2), 112-114.
  • Davidson, M., Archibald, C. and Bowling, M. (2013). Baseline: Practical Control Variates for Agent Evaluation in Zero-Sum Domains. AAMAS.
  • Burch et al. (2018). AIVAT: A New Variance Reduction Technique for Agent Evaluation in Imperfect Information Games. AAAI.