The analysis first benchmarks naive and behavioral models against interpretable machine learning and deep learning models, then evaluates the modified EWA specifications of prior work against these benchmarks and uses the LASSO diagnostics to motivate a further nested frequency tracking extension.
Abstract
Mixed strategy equilibrium predicts i.i.d play: past actions should not help predict future decisions. Human players, however, systematically depart from this benchmark, and in O'Neill's zero sum card game, these departures can be predicted by black box sequence models such as LSTMs. This paper asks whether that predictive power can be achieved by transparent alternatives that also reveal the behavioural structure behind it. Using 84,060 decisions from 2,802 pairs, the analysis first benchmarks naive and behavioral models against interpretable machine learning and deep learning models, then evaluates the modified EWA specifications of prior work against these benchmarks and uses the LASSO diagnostics to motivate a further nested frequency tracking extension. The results show that repeat or avoid behavior, especially players'management of their own recent action histories, accounts for most of the interpretable and strategically exploitable signal, while frequency tracking adds little out of sample.
A synthetic player population is constructed whose traits are ground truth by construction, and an opportunity-aware decision-moment representation is introduced that disentangles preference from the chance to express it; ablating it selectively degrades opportunity-dependent traits.
Financial markets are one of the few machine-learning settings where feedback is fast, mistakes are expensive, and deployment is constrained by execution and regulation. Yet most existing tutorials still treat finance either as an NLP benchmark or as a classical forecasting problem. This tutorial takes a different view...
Z. Iklassov, Hachem Madmoun, J. Duhot et al.· Proceedings of the 32nd ACM...· 0 citations
An agentic framework enhanced with an experience memory designed for the sequential setting and addressing common challenges of sequential decision-making such as credit assignment is introduced, and it is shown that post-game reflection and rule extraction yield measurable improvements on tic-tac-toe without modifying...
Jakub Rada, Viliam Lisý AI Center, Department of Computer Science et al.· 0 citations
The nature of test-time exploration in RLVR-trained LLMs is investigated by employing controlled maze-solving experiments and extracting a tree structure from mathematical reasoning traces (BODHI-Trees) based on semantic equivalence to delineate between entropy arising from stylistic variations and genuine inferential...
Soumadeep Saha, Krish Sharma, Akshay Chaturvedi et al.· 1 citation
This work shows that AUC can mask poor difficulty estimates, identify token-level entropy as a useful predictive signal, and show how residuals between expected and observed difficulty can expose hidden environment flaws such as contamination and infeasibility.
This work develops a black-box method for learning a single context-independent logit-bias vector, added at every decoding step, without modifying model weights or requiring gradients, and suggests that learned logit bias is a lightweight mechanism for adapting language models under minimal access requirements.