Skip to main content

On a Notion of Independence Proposed by Teddy Seidenfeld

  • Chapter
  • First Online:
Reflections on the Foundations of Probability and Statistics

Part of the book series: Theory and Decision Library A: ((TDLA,volume 54))

  • 205 Accesses

Abstract

Teddy Seidenfeld has been arguing for quite a long time that binary preference models are not powerful enough to deal with a number of crucial aspects of imprecision and indeterminacy in uncertain inference and decision making. It is at his insistence that we initiated our study of so-called sets of desirable option sets, which we have argued elsewhere provides an elegant and powerful approach to dealing with general, binary as well as non-binary, decision-making under uncertainty. We use this approach here to explore an interesting notion of irrelevance (and independence), first suggested by Seidenfeld in an example intended as a criticism of a number of specific decision methodologies based on (convex) binary preferences. We show that the consequences of making such an irrelevance or independence assessment are very strong, and might be used to argue for the use of so-called mixing choice functions, and E-admissibility as the resulting decision scheme.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 129.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 129.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    How to also deal with ‘NOT’ in this and related languages, was studied in quite some detail by one of us in an earlier collaboration (Quaeghebeur et al. 2015).

  2. 2.

    We will use the language of events, rather than propositions, to express the things we are uncertain about, but the difference is immaterial for what we have in mind.

  3. 3.

    Our results can be developed using horse lotteries, but we opt here for a simplified version.

  4. 4.

    In both his hand-outs and the above-mentioned paper (Seidenfeld et al. 2010), Seidenfeld argues, similarly, for what he calls the inadmissibility of the third option.

  5. 5.

    For a more general approach to desirability-based choice functions, where options can take values in an abstract vector space, we refer the interested reader to one of our earlier papers (De Bock and De Cooman 2019a,b).

  6. 6.

    Our general approach (De Bock and De Cooman 2019a,b) allows for more general ‘background orderings’ ≻ to replace the ordering based on ‘\(\inf f >0\)’ considered here.

  7. 7.

    It is also customary in much of the literature to furthermore remove from a choice set C(A) those options that are dominated by other options in A for the point-wise ordering ≥ of options. We will leave this implicit here, as an operation that can always be performed afterwards.

  8. 8.

    Strictly speaking, Levi only introduced, and argued for, this criterion in a context where he required the set \(\mathcal {P}\) to be convex. We will still use the term ‘E-admissibility’ even when \(\mathcal {P}\) is not convex. As mentioned before, we also leave the removal of ≥-dominated options implicit, as something that can be done afterwards.

  9. 9.

    Again, we leave the removal of dominated options for the point-wise ordering ≥ implicit, as something that can be done afterwards.

  10. 10.

    There may arise, due to Walley’s (1991, 2000) perhaps unfortunate introduction of this terminology, some confusion in the reader’s mind about the use of ‘strict’. In most accounts of preference relations, the term ‘strict preference’ refers to ‘(weak) preference without indifference’, and it is also in this sense that we have used the term ‘strict preference’ in the Introduction. Walley uses the moniker ‘strict’ for a stronger requirement, which is essentially based on some lower (or linear) prevision being strictly positive. We maintain this rather unhappy use of terminology here merely for historical reasons, but insist on warning the reader about the possible confusion this may entail.

  11. 11.

    In this sense, it would perhaps be preferable to call it an ‘unmixing property’, as the term ‘mixing’ is better suited for an approach that favours choice over rejection. Nevertheless, we have decided to stick to ‘mixing’, for reasons of consistency with the terminology introduced in Seidenfeld et al. (2010).

  12. 12.

    Although it is related to what we call a variable in spirit, we will refrain from using the term ‘random variable’, as that is typically associated with precise and countable additive probability models, and typically comes with a measurability requirement.

  13. 13.

    An engaged reader will be able to verify further on that, despite our insistence on a finitary approach, this doesn’t really matter from a mathematical point of view. In particular, none of our proofs—even the ones that establish sufficient conditions for S-irrelevance or S-independence for variables—will actually require the restriction that the gambles s E—or s G—should be simple.

  14. 14.

    Since ‘factorisation’ of this kind for multiple variables leads to a version of the law of large numbers (De Cooman and Miranda 2008; De Cooman et al. 2011), it doesn’t seem too farfetched to envision extensions of S-irrelevance and S-independence from two to multiple variables that allow us to prove similar laws of large numbers.

  15. 15.

    This notation uses the implicit convention that gambles with domain \(\mathcal {Y}\) are considered as special instances of gambles with domain \(\mathcal {X}\times \mathcal {Y}\).

References

  • Augustin, T., F.P.A. Coolen, G. de Cooman, and M.C.M. Troffaes, eds. 2014. Introduction to imprecise probabilities. John Wiley & Sons.

    Google Scholar 

  • Couso, I., and S. Moral. 2011. Sets of desirable gambles: conditioning, representation, and precise probabilities. International Journal of Approximate Reasoning 52(7):1034–1055.

    Article  Google Scholar 

  • De Bock, J. 2015. Credal networks under epistemic irrelevance: theory and algorithms. PhD thesis, Ghent University, Faculty of Engineering and Architecture.

    Google Scholar 

  • De Bock, J. 2020a. Archimedean choice functions. In Information Processing and management of uncertainty in knowledge-based systems (Proceedings of IPMU 2020), 195–209. Springer International Publishing.

    Google Scholar 

  • De Bock, J. 2020b. Archimedean choice functions: an axiomatic foundation for imprecise decision making. ArXiv e-print: 2002.05196.

    Google Scholar 

  • De Bock, J. 2020c. Choice functions based on sets of strict partial orders: an axiomatic characterisation. ArXiv e-print: 2003.11631.

    Google Scholar 

  • De Bock, J., and G. de Cooman. 2015. Credal networks under epistemic irrelevance: The sets of desirable gambles approach. International Journal of Approximate Reasoning 56(part A):178–207.

    Google Scholar 

  • De Bock, J., and G. de Cooman. 2018a. A desirability-based axiomatisation for coherent choice functions. In Uncertainty modelling in data science (Proceedings of SMPS 2018), 46–53.

    Google Scholar 

  • De Bock, J., and G. de Cooman. 2018b. A desirability-based axiomatisation for coherent choice functions. 2018. ArXiv e-print: 1806.01044.

    Google Scholar 

  • De Bock, J., and G. de Cooman. 2019a. Interpreting, axiomatising and representing coherent choice functions in terms of desirability. Proceedings of Machine Learning Research 103:125–134.

    Google Scholar 

  • De Bock, J., and G. de Cooman. 2019b. Interpreting, axiomatising and representing coherent choice functions in terms of desirability. ArXiv e-print: 1903.00336.

    Google Scholar 

  • De Cooman, G. 2020a. Coherent and Archimedean choice in general Banach spaces. In Information processing and management of uncertainty in knowledge-based systems (Proceedings of IPMU 2020), 180–194. Springer International Publishing.

    Google Scholar 

  • De Cooman, G. 2020b. Coherent and Archimedean choice in general Banach spaces. 2020. ArXiv e-print: 2002.05461.

    Google Scholar 

  • De Cooman, G., and E. Miranda. 2008. Weak and strong laws of large numbers for coherent lower previsions. Journal of Statistical Planning and Inference 138(8):2409–2432.

    Article  Google Scholar 

  • De Cooman, G., and E. Miranda. 2012. Irrelevance and independence for sets of desirable gambles. Journal of Artificial Intelligence Research 45:601–640.

    Article  Google Scholar 

  • De Cooman, G., and E. Quaeghebeur. 2012. Exchangeability and sets of desirable gambles. International Journal of Approximate Reasoning 53(3):363–395. Special issue in honour of Henry E. Kyburg, Jr.

    Google Scholar 

  • De Cooman, G., E. Miranda, and M. Zaffalon. 2011. Independent natural extension. Artificial Intelligence 175:1911–1950.

    Article  Google Scholar 

  • De Cooman, G., J. De Bock, and M. Alves Diniz. 2015. Coherent predictive inference under exchangeability with imprecise probabilities. Journal of Artificial Intelligence Research 52:1–95.

    Article  Google Scholar 

  • Levi, I. 1980. The enterprise of knowledge. London: MIT Press.

    Google Scholar 

  • Levi, I. 1999. Imprecise and indeterminate probabilities. In ISIPTA ’99: Proceedings of the first international symposium on imprecise probabilities and their applications, eds. G. de Cooman, F.G. Cozman, S. Moral, and P. Walley, 258–265.

    Google Scholar 

  • Quaeghebeur, E. 2014. Desirability. In Introduction to imprecise probabilities. John Wiley & Sons.

    Google Scholar 

  • Quaeghebeur, E., G. de Cooman, and F. Hermans. 2015. Accept & reject statement-based uncertainty models. International Journal of Approximate Reasoning 57:69–102.

    Article  Google Scholar 

  • Seidenfeld, T., M.J. Schervish, and J.B. Kadane. 1995. A representation of partially ordered preferences. The Annals of Statistics 23:2168–2217. Reprinted in Seidenfeld et al. (1999), pp. 69–129.

  • Seidenfeld, T., M.J. Schervish, and J.B. Kadane. 1999. Rethinking the foundations of statistics. Cambridge: Cambridge University Press.

    Google Scholar 

  • Seidenfeld, T., M.J. Schervish, and J.B. Kadane. 2010. Coherent choice functions under uncertainty. Synthese 172(1):157–176.

    Article  Google Scholar 

  • Troffaes, M.C.M. 2007. Decision making under uncertainty using imprecise probabilities. International Journal of Approximate Reasoning 45(1):17–29.

    Article  Google Scholar 

  • Troffaes, M.C.M., and De Cooman, G. 2014. Lower previsions. Wiley.

    Book  Google Scholar 

  • Van Camp, A. 2018. Choice functions as a tool to model uncertainty. PhD thesis, Ghent University, Faculty of Engineering and Architecture, January 2018.

    Google Scholar 

  • Van Camp, A., and G. de Cooman. 2018. Exchangeable choice functions. International Journal of Approximate Reasoning 100:85–104.

    Article  Google Scholar 

  • Van Camp, A., G. de Cooman, and E. Miranda. 2018a. Lexicographic choice functions. International Journal of Approximate Reasoning 92:97–119.

    Article  Google Scholar 

  • Van Camp, A., De Cooman, G., Miranda, E., and Quaeghebeur, E. 2018b. Coherent choice functions, desirability and indifference. Fuzzy Sets and Systems 341:1–36.

    Article  Google Scholar 

  • Walley, P. 1991. Statistical reasoning with imprecise probabilities. London: Chapman and Hall.

    Book  Google Scholar 

  • Walley, P. 2000. Towards a unified theory of imprecise probability. International Journal of Approximate Reasoning 24:125–148.

    Article  Google Scholar 

Download references

Acknowledgements

We would like to thank Teddy Seidenfeld for the many discussions, throughout the years, on so many issues related to imprecise probabilities and the foundations of decision-making. This paper, and our related earlier work on choice functions, would not have existed without his constructive and destructive criticism of our earlier work on binary choice.

We would also like to thank the editors of this Festschrift for giving us the opportunity to contribute to it, and two anonymous reviewers for their valuable and constructive feedback.

Jasper De Bock’s work was partially supported by his BOF Starting Grant “Rational decision making under uncertainty: a new paradigm based on choice functions”, number 01N04819.

As with most of our joint work, there is no telling, after a while, which of us two had what idea, or did what, exactly. An irrelevant coin flip may have determined the actual order we are listed in.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jasper De Bock .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

De Bock, J., de Cooman, G. (2022). On a Notion of Independence Proposed by Teddy Seidenfeld. In: Augustin, T., Cozman, F.G., Wheeler, G. (eds) Reflections on the Foundations of Probability and Statistics. Theory and Decision Library A:, vol 54. Springer, Cham. https://doi.org/10.1007/978-3-031-15436-2_11

Download citation

Publish with us

Policies and ethics