We describe a process to compose and decompose choice behavior, called resolution. In the forward direction, resolutions amalgamate simple choices to create a complex one. In the backward direction, resolutions detect when and how a primitive choice can be deconstructed into smaller choices. A choice is resolvable if it is the resolution of smaller choices. Rationalizability, rationalizability by a preorder, and path independence are all preserved (backward and forward) by resolutions, whereas rationalizability by a weak order (equivalently, WARP) is not. We characterize resolvable choices, and show that resolvability generalizes WARP.
Choice resolutions
Cantone D.;Giarlotta A.
;
2021-01-01
Abstract
We describe a process to compose and decompose choice behavior, called resolution. In the forward direction, resolutions amalgamate simple choices to create a complex one. In the backward direction, resolutions detect when and how a primitive choice can be deconstructed into smaller choices. A choice is resolvable if it is the resolution of smaller choices. Rationalizability, rationalizability by a preorder, and path independence are all preserved (backward and forward) by resolutions, whereas rationalizability by a weak order (equivalently, WARP) is not. We characterize resolvable choices, and show that resolvability generalizes WARP.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
