A distance-based theory of lottery complexity

Giulio Principi

Papers from arXiv.org

Abstract: We propose a measure of lottery complexity that combines probabilistic dispersion with dissimilarity between outcomes. Taking degenerate lotteries, which yield a single outcome with certainty, as the simplest alternatives, we measure complexity by proximity to this class. Specifically, for each degenerate lottery, we compute the expected distance between its certain outcome and the lottery's outcomes, and take the minimum across all degenerate lotteries. We provide an axiomatic characterization establishing uniqueness up to positive rescaling, study how complexity changes under outcome compression, and characterize maximally complex lotteries. Finally, we introduce Complexity-Adjusted Expected Utility preferences and characterize adherence to stochastic dominance and strong risk aversion.

Date: 2026-08, Revised 2026-09
New Economics Papers: this item is included in nep-upt
References: Add references at CitEc
Citations:

Downloads: (external link)
https://arxiv.org/pdf/2608.14464 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:2608.14464

Access Statistics for this paper

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