Skip to main content

Decision-Making with E-Admissibility Given a Finite Assessment of Choices

  • Conference paper
  • First Online:
Building Bridges between Soft and Statistical Methodologies for Data Science (SMPS 2022)

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 1433))

Included in the following conference series:

  • 411 Accesses

Abstract

Given information about which options a decision-maker definitely rejects from given finite sets of options, we study the implications for decision-making with E-admissibility. This means that from any finite set of options, we reject those options that no probability mass function compatible with the given information gives the highest expected utility. We use the mathematical framework of choice functions to specify choices and rejections, and specify the available information in the form of conditions on such functions. We characterise the most conservative extension of the given information to a choice function that makes choices based on E-admissibility, and provide an algorithm that computes this extension by solving linear feasibility problems.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 189.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 249.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

Similar content being viewed by others

Notes

  1. 1.

    Levi’s original definition considered credal sets that are convex, whereas we do not require this. In fact one of the strengths of our approach is that an assessment can lead to non-convex credal sets; see the example in Sect. 5 further on.

  2. 2.

    It can for instance be considered as a linear programming problem, by adding the trivial objective function that is zero everywhere. Feeding this into a linear programming software package, the software will announce whether the problem is feasible. For a deeper understanding of how software solves such feasibility problems, we refer to the explanation of initial feasible solutions in Matoušek and Gärtner (2006, Sect. 5.6).

References

  • De Bock, J.: Archimedean choice functions. In: Lesot, M.J., et al. (eds.) IPMU 2020. CCIS, vol. 1238, pp. 195–209. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-50143-3_15

    Chapter  Google Scholar 

  • De Bock, J., De Cooman, G.: Interpreting, axiomatising and representing coherent choice functions in terms of desirability. In: Proceedings of the 11th International Symposium on Imprecise Probabilities: Theories and Applications, ISIPTA 2019, vol. 103, pp. 125–134. Proceedings of Machine Learning Research (2019)

    Google Scholar 

  • De Cooman, G.: Coherent and Archimedean choice in general Banach spaces. Int. J. Approx. Reason. 140, 255–281 (2021)

    Article  MathSciNet  Google Scholar 

  • Decadt, A., De Bock, J., De Cooman, G.: Inference with choice functions made practical. In: Davis, J., Tabia, K. (eds.) SUM 2020. LNCS (LNAI), vol. 12322, pp. 113–127. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-58449-8_8

    Chapter  Google Scholar 

  • Kikuti, D., Cozman, F.G., de Campos, C.P.: Partially ordered preferences in decision trees: Computing strategies with imprecision in probabilities. In: Proceedings of the IJCAI Workshop about Advances on Preference Handling, pp. 118–123 (2005)

    Google Scholar 

  • Levi, I.: On indeterminate probabilities. In: Hooker, C.A., Leach, J.J., McClennen, E.F. (eds.) Foundations and Applications of Decision Theory. The University of Western Ontario Series in Philosophy of Science, vol. 13a, pp 233–261. Springer, Dordrecht (1978). https://doi.org/10.1007/978-94-009-9789-9_9

  • Matoušek, J., Gärtner, B.: Understanding and Using Linear Programming. Universitext (UTX). Springer, Heidelberg (2006). https://doi.org/10.1007/978-3-540-30717-4

  • Savage, L.J.: The Foundations of Statistics. Dover Publications Inc., New York (1972)

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  • Troffaes, M.C.: Decision making under uncertainty using imprecise probabilities. Int. J. Approx. Reason. 45(1), 17–29 (2007)

    Article  MathSciNet  Google Scholar 

  • Utkin, L., Augustin, T.: Powerful algorithms for decision making under partial prior information and general ambiguity attitudes. In: Proceedings of the 3th International Symposium on Imprecise Probability: Theories and Applications, ISIPTA 2005, pp 349–358 ((2005))

    Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Arne Decadt .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

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

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Decadt, A., Erreygers, A., De Bock, J., de Cooman, G. (2023). Decision-Making with E-Admissibility Given a Finite Assessment of Choices. In: García-Escudero, L.A., et al. Building Bridges between Soft and Statistical Methodologies for Data Science . SMPS 2022. Advances in Intelligent Systems and Computing, vol 1433. Springer, Cham. https://doi.org/10.1007/978-3-031-15509-3_13

Download citation

Publish with us

Policies and ethics