Exchangeable choice functions
classification
💻 cs.AI
keywords
assessmentchoiceexchangeabilityfunctionsassessmentscontextcountablecounterpart
read the original abstract
We investigate how to model exchangeability with choice functions. Exchangeability is a structural assessment on a sequence of uncertain variables. We show how such assessments are a special indifference assessment, and how that leads to a counterpart of de Finetti's Representation Theorem, both in a finite and a countable context.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.