Searcharxiv⌕ Search

arXiv · 2611.13335

Universally Measurable Sets and Correlated Equilibria

Abstract

We study alternate definitions of correlated equilibrium in games with Polish strategy spaces. We first consider universally measurable decision problems equipped with a measure assignment and a prior, comparing deviation stability with the stronger requirement of conditional rationality. We show they are equivalent for Borel measurable problems, but their equivalence for all analytically measurable problems depends on the model of set theory. The full equivalence follows from $\mathsf{MUP}$, while a nonmeasurable set of reals yields a counterexample. When the set of strategies which are best responses to their assigned measures is measurable by the prior, we characterize the equivalence by the principle $\mathsf{MUP}^{\mathsf{UM}}$, which holds in a model of Larson--Neeman--Shelah. The results carry over to games, where we further show that conditionally rational priors must concentrate on $\text{RCBR}$ strategies, while deviation stable priors may fail to do so even in games with analytically measurable payoffs. This provides an epistemic justification for defining a correlated equilibrium as a conditionally rational prior.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Stuart Zoble. 2026-11-09. Universally Measurable Sets and Correlated Equilibria. https://searcharxiv.com/abs/2611.13335

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related papers

A Dubnov-Ivanov-Nagata-Higman Theorem for NIP nilrings

We prove that NIP nilrings of bounded nilexponent are nilpotent. We also deduce that NIP $ω$-categorical $n$-Engel Lie algebras of characteristic $p>n$ are nilpotent, yielding a case of the Lie algebra analogous of Wilson conjecture for $ω$-categorical groups.

math.LO↗

Relative computability and definability for nonregular oracles

Classically, a set is computable from an oracle if both the set and its complement are computably enumerable (c.e.) relative to that oracle. We construct a countable nonstandard model of true arithmetic with sets A and X such that both A and its complement are c.e. relative to X, yet A is not pointwise Turing reducible to X. The Turing functionals used here are single-valued at every oracle. For regular oracles, we prove that the classical equivalence holds over ISigma_1. Two further phenomena, each known from earlier work, are realized with the same oracle X that witnesses our main separation. Strong and pointwise Turing reducibility differ for this X, and some Delta_1^X set is not X-c.e.

math.LO↗