SearcharxivSearch

arXiv subjects

Erya Yang

Publications and source records attributed to Erya Yang.

2 recordsLinked to original sources

A Conditional Probability Hierarchy for Stochastic Choice

We introduce point conditional probability spaces (PCPSs) as primitive building blocks for stochastic choice. This concept goes back to R\'enyi (1955), who proposed conditional probability spaces (CPSs) as a basis for probability theory. Luce (1959) noted the connection between CPSs and stochastic choice, and Cerreia-Vioglio et al. (2021) have developed the connection further. A PCPS is a CPS each of whose component probability measures concentrates on a singleton selection. We build a four-level PCPS-based hierarchy of families of stochastic choice rules. Level 1 consists of PCPSs, Level 2 is made up of "conditionally consistent" mixtures of PCPSs, Level 3 comprises all probabilistic mixtures of PCPSs, and Level 4 consists of all signed mixtures of PCPSs. We construct our hierarchy at a general measure-theoretic level that encompasses infinite choice sets. We also connect each level of our hierarchy to well-known axioms for stochastic choice, namely, the Weak Axiom of Stochastic Revealed Preference, Independence of Irrelevant Alternatives, and no Dutch Book. We establish the relationship between total orders and PCPSs and demonstrate a sense in which PCPSs can be a more parsimonious representation of choice.

math.PR

Conditional Probability Spaces and the Structure of Agreement

We use the machinery of a conditional probability space (R\'enyi, 1955) to obtain an Agreement Theorem (Aumann, 1976) under general conditions. A conditional probability space (CPS) is a family of probability measures defined relative to a family of conditioning events that satisfies concentration and a chain rule. Using this apparatus, we derive an Agreement Theorem that dispenses with the traditional assumptions of a common prior, information partitions, positivity of measure, and knowledge operators. Our treatment can be viewed as "deconstructing" the classic Agreement Theorem, by showing how it can be built up from local probabilistic-epistemic ingredients. The main technical contribution is to define an augmentation procedure for CPSs that adds into the conditioning family all (sub)events that receive probability $1$ -- thereby achieving consistency between an agent's information and subjective certainty of events.

math.PR