✦ LIBER ✦

Finite forms of de Finetti's theorem on exchangeability

✍ Scribed by Persi Diaconis

Publisher: Springer Netherlands
Year: 1977
Tongue: English
Weight: 493 KB
Volume: 36
Category: Article
ISSN: 0039-7857
DOI: 10.1007/bf00486116

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Extended versions of Deny's theorem via

Extended versions of Deny's theorem via de Finetti's theorem

✍ D.N. Shanbhag 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 842 KB

Condorcet's jury theorem in light of de

Condorcet's jury theorem in light of de Finetti's theorem

✍ Krishna K. Ladha 📂 Article 📅 1993 🏛 Springer 🌐 English ⚖ 886 KB

This paper generalizes Condorcet's jury theorem to the case of symmetrically dependent votes with the help of de Finetti's theorem. Thus, the paper relaxes Condorcet's assumption of independent voting while preserving his main result: In jury-type situations a majority of voters is more likely than

Analogs of de Finetti's theorem and inte

Analogs of de Finetti's theorem and interpretative problems of quantum mechanics

✍ R. L. Hudson 📂 Article 📅 1981 🏛 Springer US 🌐 English ⚖ 169 KB

Locally normal symmetric states and an a

Locally normal symmetric states and an analogue of de Finetti's theorem

✍ R. L. Hudson; G. R. Moody 📂 Article 📅 1976 🏛 Springer 🌐 English ⚖ 378 KB

Complexity Bounds for Some Finite Forms

Complexity Bounds for Some Finite Forms of Kruskal's Theorem

✍ Andreas Weiermann 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 715 KB

Well-founded (partial) orders form an important and convenient mathematical basis for proving termination of algorithms. Well-partial orders provide a powerful method for proving the well-foundedness of partial orders (and hence for proving termination), since every partial ordering which extends a

A note on the decidability of de Finetti

A note on the decidability of de Finetti's coherence

✍ Francesco Corielli 📂 Article 📅 1995 🏛 Springer US 🌐 English ⚖ 561 KB