Paper
A Random Rule Model
Authors
Avner Seror
Abstract
We propose a Random Rule Model (RRM) in which behavior is generated by switching among a small library of transparent, parameter-free decision rules. A differentiable gate learns environment-dependent rule propensities, producing an interpretable mixture over named procedures. We develop a global identification theory based on two verifiable conditions on the observed support. Applied to 10,000 binary lottery problems, rule-gating substantially outperforms structured neural benchmarks based on expected utility and prospect theory, approaching the most flexible benchmark while remaining highly restrictive under permutation-fit tests, and retains predictive content on an independent dataset. Mechanism diagnostics reveal that extreme-outcome screening, salience, and attention rules carry the largest responsibility weights, with systematic shifts along tradeoff complexity and dispersion asymmetry. Robustness checks confirm that the findings are not driven by the ex-ante library choice, marginal dominance relationships, or the availability of additional regressors.
Metadata
Related papers
Fractal universe and quantum gravity made simple
Fabio Briscese, Gianluca Calcagni • 2026-03-25
POLY-SIM: Polyglot Speaker Identification with Missing Modality Grand Challenge 2026 Evaluation Plan
Marta Moscati, Muhammad Saad Saeed, Marina Zanoni, Mubashir Noman, Rohan Kuma... • 2026-03-25
LensWalk: Agentic Video Understanding by Planning How You See in Videos
Keliang Li, Yansong Li, Hongze Shen, Mengdi Liu, Hong Chang, Shiguang Shan • 2026-03-25
Orientation Reconstruction of Proteins using Coulomb Explosions
Tomas André, Alfredo Bellisario, Nicusor Timneanu, Carl Caleman • 2026-03-25
The role of spatial context and multitask learning in the detection of organic and conventional farming systems based on Sentinel-2 time series
Jan Hemmerling, Marcel Schwieder, Philippe Rufin, Leon-Friedrich Thomas, Mire... • 2026-03-25
Raw Data (Debug)
{
"raw_xml": "<entry>\n <id>http://arxiv.org/abs/2603.04105v1</id>\n <title>A Random Rule Model</title>\n <updated>2026-03-04T14:18:14Z</updated>\n <link href='https://arxiv.org/abs/2603.04105v1' rel='alternate' type='text/html'/>\n <link href='https://arxiv.org/pdf/2603.04105v1' rel='related' title='pdf' type='application/pdf'/>\n <summary>We propose a Random Rule Model (RRM) in which behavior is generated by switching among a small library of transparent, parameter-free decision rules. A differentiable gate learns environment-dependent rule propensities, producing an interpretable mixture over named procedures. We develop a global identification theory based on two verifiable conditions on the observed support. Applied to 10,000 binary lottery problems, rule-gating substantially outperforms structured neural benchmarks based on expected utility and prospect theory, approaching the most flexible benchmark while remaining highly restrictive under permutation-fit tests, and retains predictive content on an independent dataset. Mechanism diagnostics reveal that extreme-outcome screening, salience, and attention rules carry the largest responsibility weights, with systematic shifts along tradeoff complexity and dispersion asymmetry. Robustness checks confirm that the findings are not driven by the ex-ante library choice, marginal dominance relationships, or the availability of additional regressors.</summary>\n <category scheme='http://arxiv.org/schemas/atom' term='econ.GN'/>\n <published>2026-03-04T14:18:14Z</published>\n <arxiv:primary_category term='econ.GN'/>\n <author>\n <name>Avner Seror</name>\n </author>\n </entry>"
}