Tradeoffs and Comparison Complexity
This paper develops a theory of how tradeoffs govern comparison complexity, and how this complexity generates systematic mistakes in choice. In our model, options are easier to compare when they involve less pronounced tradeoffs, in particular when they are 1) more similar feature-by-feature and 2) closer to dominance. These two postulates yield tractable measures of comparison complexity in the domains of multiattribute, lottery, and intertemporal choice. We show how our model organizes a range of behavioral regularities in choice and valuation, such as context effects, preference reversals, and apparent probability weighting and hyperbolic discounting. We test our model experimentally by varying the strength and nature of tradeoffs. First, we show that our complexity measures predict choice errors, choice inconsistency, and cognitive uncertainty in binary choice data across all three domains. Second, we document that manipulations of comparison complexity can reverse classic behavioral regularities, in line with the predictions of the theory. We apply our theory to study strategic obfuscation by firms in a pricing game.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Online, Informative MCMC Thinning with Kernelized Stein Discrepancy
A fundamental challenge in Bayesian inference is efficient representation of a target distribution. Many non-parametric approaches do so by sampling a large number of points using variants of Markov Chain Monte Carlo (MC…
Bayesian InferencePerformance vs. Spectral Properties For Single-Sideband Continuous Phase Modulation
This study revokes the performance of continuous phase modulation (CPM) able to generate a single-sideband (SSB) spectrum directly. This signal is analyzed in terms of modulation indices, pulse lengths, and pulse widths,…
Confounding Tradeoffs for Neural Network Quantization
Many neural network quantization techniques have been developed to decrease the computational and memory footprint of deep learning. However, these methods are evaluated subject to confounding tradeoffs that may affect i…
QuantizationSpectral Efficiency vs Complexity in Downlink Algorithms for Reconfigurable Intelligent Surfaces
Reconfigurable Intelligent Surfaces (RIS) are an emerging technology that can be used to reconfigure the propagation environment to improve cellular communication link rates. RIS, which are thin metasurfaces composed of …
Sample, computation vs storage tradeoffs for classification using tensor subspace models
In this paper, we exhibit the tradeoffs between the (training) sample, computation and storage complexity for the problem of supervised classification using signal subspace estimation. Our main tool is the use of tensor …
General Classification