Avner Seror

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.