Procedural Decision-Making in Response to Complexity -- Fixing Approaches

How to cite

Nielsen, Kirby; Arrieta, Gonzalo. 2025. "Procedural Decision-Making in Response to Complexity -- Fixing Approaches." AEA RCT Registry. AEARCTR-0016228. https://doi.org/10.1257/rct.16228-2.0

Download: BibTeX · RIS — for reference managers without a browser translator. Zotero and most others pick up this page's citation metadata directly.

Kirby Nielsen* , Gonzalo Arrieta

* Primary investigator

Registry ID
AEARCTR-0016228
DOI
https://doi.org/10.1257/rct.16228-2.0
First registered
Last updated
Status
In development
Trial dates
2025-06-16 – 2026-12-01
Countries
Private
Registry record
http://www.socialscienceregistry.org/trials/16228

Abstract

This project follows up on AEARCTR-0010977. We recruit new participants to implement the choice processes collected in that study, and our main goal is to test whether implementers are noisier in complex decisions compared to simple decisions.

Intervention

We provide implementers with a choice process description and ask them to implement it on simple and complex lotteries, some of which are repeated and some of which are related by FOSD. We test whether implementers are noisier (i.e., less likely to choose consistently in repeated menus) in complex decisions compared to simple ones. We also test whether implementers violate FOSD more in complex lotteries. We investigate the sensitivity of these effects to specific choice processes, such as "procedures."

Experimental design

We vary whether implementers face simple or complex lotteries, and randomly select lottery menus to be repeated.

Design details

Randomization method
All randomization occurs through oTree: (e.g., assignment of either a simple message or a complex message, randomly selected lotteries, and randomly selected lotteries to repeat).
Randomization unit
We randomize into treatments at the individual-level: Implementers receive either a simple or a complex message. This interacts with another source of randomness which is whether implementers receive a message that is procedural or non-procedural. The complex messages contain more procedural processes, so these two sources of randomness are not independent.
Clusters
The design is not clustered, so each cluster is one participant. We recruit 1000 implementers to implement simple messages and 1000 implementers to implement complex messages.
Observations
We have 2000 total implementers. Each faces 20 menus, including two repeated simple menus, two repeated complex menus, one simple FOSD menu, and one complex FOSD menu.
Arms
1000 implementers to implement simple messages and 1000 implementers to implement complex messages, each facing two repeated simple menus, two repeated complex menus, one simple FOSD menu, and one complex FOSD menu
Primary outcomes
noise rates, FOSD violations
Secondary outcomes
self-reported difficulty

Cited by

No citation data available for this registration yet.

Keywords