Entangled vs. Separable Choice
We investigate joint probabilistic choice rules describing the behavior of two decision makers, each facing potentially distinct menus. These rules are separable when they can be decomposed into individual choices correlated solely through their respective probabilistic choice rules. Despite its significant interest for the study of peer effects, influence, and taste variation, a complete characterization of these rules has remained elusive (Chambers, Masatlioglu, and Turansick, 2021). We fully characterize separable choices through a finite system of inequalities inspired by Afriat's theorem. Our results address the possibility of entangled choices, where decision makers behave as if they do not communicate, yet their choices are not separable. More generally, we establish that separable joint choice restrictions can be factored into individual choice restrictions if only if at least one decision maker's probabilistic choice rule uniquely identifies the distribution over deterministic choice rules. The no communication condition and the individual restrictions are no longer sufficient in the absence of this uniqueness. Our results offer robust tools for distinguishing between separable decision-making and behaviors beyond mere peer effects such as imitation and cheating.
Code (0)
등록된 구현이 없습니다.
Tasks
Decision MakingSimilar Papers 제목 키워드 기반
Data-driven criteria for quantum correlations
We build a machine learning model to detect correlations in a three-qubit system using a neural network trained in an unsupervised manner on randomly generated states. The network is forced to recognize separable states,…
Entangled Kernels -- Beyond Separability
We consider the problem of operator-valued kernel learning and investigate the possibility of going beyond the well-known separable kernels. Borrowing tools and concepts from the field of quantum computing, such as parti…
Dimensionality ReductionSupervised dimensionality reductionLearning entanglement breakdown as a phase transition by confusion
Quantum technologies require methods for preparing and manipulating entangled multiparticle states. However, the problem of determining whether a given quantum state is entangled or separable is known to be an NP-hard pr…
On the Role of Entanglement and Statistics in Learning
In this work we make progress in understanding the relationship between learning models with access to entangled, separable and statistical measurements in the quantum statistical query (QSQ) model. To this end, we show …
PAC learningNext state prediction gives rise to entangled, yet compositional representations of objects
Compositional representations are thought to enable humans to generalize across combinatorially vast state spaces. Models with learnable object slots, which encode information about objects in separate latent codes, have…
Object