Permutation-Invariance in Koml\'os' Theorem for Non-negative Random Variables
Abdessamad Dehaj, Mohamed Guessous, Noureddine Sabiri
TL;DR
This paper introduces a permutation-invariant version of Komlós' theorem for non-negative random variables, providing an elementary proof that avoids the Axiom of Choice, based on recent results.
Contribution
It presents a new permutation-invariant formulation of Komlós' theorem with an elementary proof avoiding the Axiom of Choice.
Findings
Permutation-invariant version of Komlós' theorem established
Elementary proof without Axiom of Choice provided
Based on recent foundational results
Abstract
We provide a permutation-invariant version of the Koml\'os' theorem for non-negative random variables. The proof is quite elementary in the sense that it did not use the Axiom of Choice, and was based on a recent result in [3].
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGame Theory and Voting Systems · Probability and Risk Models · Random Matrices and Applications