Skip to main content

Extreme Lower Previsions and Minkowski Indecomposability

  • Conference paper
Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU 2013)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 7958))

Abstract

Coherent lower previsions constitute a convex set that is closed and compact under the topology of point-wise convergence, and Maaß [2] has shown that any coherent lower prevision can be written as a ‘countably additive convex combination’ of the extreme points of this set. We show that when the possibility space has a finite number n of elements, these extreme points are either degenerate precise probabilities, or in a one-to-one correspondence with the (Minkowski) indecomposable compact convex subsets of ℝn − 1.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Grünbaum, B.: Convex polytopes, 2nd edn. Springer (2003); prepared by Kaibel, V., Klee, V., Ziegler, G.M. (eds.)

    Google Scholar 

  2. Maaß, S.: Exact functionals, functionals preserving linear inequalities, Lévy’s metric. Ph.D. thesis, Universität Bremen (2003)

    Google Scholar 

  3. Meyer, W.: Indecomposable polytopes. Transactions of the American Mathematical Society 190, 77–86 (1974)

    Article  MathSciNet  MATH  Google Scholar 

  4. Miranda, E.: A survey of the theory of coherent lower previsions. International Journal of Approximate Reasoning 48(2), 628–658 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  5. Quaeghebeur, E.: Characterizing the set of coherent lower previsions with a finite number of constraints or vertices. In: Proceedings of the Twenty-Sixth Conference on Uncertainty in Artificial Intelligence, pp. 466–473 (2010)

    Google Scholar 

  6. Quaeghebeur, E., De Cooman, G.: Extreme lower probabilities. Fuzzy Sets and Systems 159, 2163–2175 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  7. Sallee, G.T.: Minkowski decomposition of convex sets. Israel Journal of Mathematics 12, 266–276 (1972)

    Article  MathSciNet  MATH  Google Scholar 

  8. Silverman, R.: Decomposition of plane convex sets, part I. Pacific Journal of Mathematics 47, 521–530 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  9. Walley, P.: Statistical Reasoning with Imprecise Probabilities. Chapman and Hall, London (1991)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

De Bock, J., de Cooman, G. (2013). Extreme Lower Previsions and Minkowski Indecomposability. In: van der Gaag, L.C. (eds) Symbolic and Quantitative Approaches to Reasoning with Uncertainty. ECSQARU 2013. Lecture Notes in Computer Science(), vol 7958. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39091-3_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-39091-3_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-39090-6

  • Online ISBN: 978-3-642-39091-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics