EconPapers    
Economics at your fingertips  
 

Challenge Theory: The Structure and Measurement of Risky Binary Choice Behavior

Samuel Shye and Ido Haber

Papers from arXiv.org

Abstract: Challenge Theory (Shye & Haber 2015; 2020) has demonstrated that a newly devised challenge index (CI) attributable to every binary choice problem predicts the popularity of the bold option, the one of lower probability to gain a higher monetary outcome (in a gain problem); and the one of higher probability to lose a lower monetary outcome (in a loss problem). In this paper we show how Facet Theory structures the choice-behavior concept-space and yields rationalized measurements of gambling behavior. The data of this study consist of responses obtained from 126 student, specifying their preferences in 44 risky decision problems. A Faceted Smallest Space Analysis (SSA) of the 44 problems confirmed the hypothesis that the space of binary risky choice problems is partitionable by two binary axial facets: (a) Type of Problem (gain vs. loss); and (b) CI (Low vs. High). Four composite variables, representing the validated constructs: Gain, Loss, High-CI and Low-CI, were processed using Multiple Scaling by Partial Order Scalogram Analysis with base Coordinates (POSAC), leading to a meaningful and intuitively appealing interpretation of two necessary and sufficient gambling-behavior measurement scales.

Date: 2020-03
New Economics Papers: this item is included in nep-upt
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://arxiv.org/pdf/2003.12474 Latest version (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:arx:papers:2003.12474

Access Statistics for this paper

More papers in Papers from arXiv.org
Bibliographic data for series maintained by arXiv administrators (help@arxiv.org).

 
Page updated 2025-03-19
Handle: RePEc:arx:papers:2003.12474