Search arXivSearch

arXiv · 2608.28825

When to take one box, when to take two: A concrete analysis of Newcomb's problem

Abstract

Fifty-seven years of debate have not led to a consensus on Newcomb's problem. I argue that this failure comes from not viewing the problem in concrete terms, for which common-sense intuitions are clearly applicable. If near-perfect predictions are not required - only predictions good enough that Evidential Decision Theory (EDT) recommends taking only one box - Newcomb scenarios without any fantastic elements are actually feasible. I give a detailed account of such concrete scenarios, in which the decision-maker has varying amounts of information about the prediction process. I argue that in these scenarios it is rational to take both boxes, as Causal Decision Theory (CDT) recommends. To make this more convincing, I introduce a simpler impersonal Newcomb problem, also with a concrete realization, to help bridge causal intuitions from everyday decisions to the standard Newcomb scenario. I also argue that Newcomb's problem with nearly perfect predictions can only be realized by a (currently fantastic) process in which the Predictor accurately simulates the thoughts of a Participant. In a functionalist view of consciousness, this simulation will be a conscious entity, whose experience will not be distinguishable from that of a ``real'' person. In this scenario, CDT recommends taking one box. I conclude that when Newcomb's problem is properly analysed in concrete terms, CDT gives the correct answer in all scenarios.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Radford M. Neal. 2026-08-28. When to take one box, when to take two: A concrete analysis of Newcomb's problem. https://arxiv.org/abs/2608.28825

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

See You at the Posterior Line: Learning Bayesian Modeling Through a Car Racing Game

We present an interactive classroom activity designed to address a central challenge in teaching introductory Bayesian statistics: how to formalize subjective knowledge and available information into prior distributions and then update them with empirical data. Role-playing as data analysts for a racing team, students evaluate candidate tires by converting qualitative engineering reports into prior distributions, collecting primary data via a virtual racing game, and using a Beta-Binomial model to inform team strategy. This discovery-based exercise allows small groups to observe directly how different prior choices and sample data jointly shape posterior inference. Student feedback ($n=32$) highlights high enjoyment, engagement and improved conceptual clarity. Open-access materials to implement the activity are provided, alongside recommendations for adapting it to other teaching contexts.

stat.OT

Why is Regularization Underused? An Empirical Study on Trust and Adoption of Statistical Methods

Statistical practice does not automatically follow methodological innovation. Regularization methods, widely advocated to reduce overfitting and stabilize inference, are readily available in modern software, but are not consistently used by data analysts. We investigate this implementation gap in a large-scale empirical study of trust in, and acceptance of, regularization techniques, based on $N = 606$ data analysts. Drawing on measurement frameworks from technology acceptance research, we survey practitioners and embed a randomized experiment to test whether written recommendation of regularization methods increases trust or intended use. We find no evidence of such an effect. Instead, adoption intentions are strongly associated with analysts' perceptions of ease of implementation and practical benefit, such as improved bias control or interpretability. Perceived social norms also emerge as a central driver. These results indicate that uptake of statistical methodology depends less on formal recommendations than on usability, perceived utility, and community practice.

stat.OT

Exact analysis of a split--merge queue with latent Erlang-factor dependent subtask times

This paper studies a two-server split--merge queue with positively dependent subtask service times modeled through a latent-factor bivariate Erlang construction. An exact characterization of the split--merge completion time is obtained, including explicit formulas for its first two moments and the resulting mean waiting time. Under fixed marginal service-time distributions, independence is shown to stochastically increase the completion time and hence overestimate mean waiting time. Numerical illustrations show that this benchmark gap can be substantial.

stat.OT