Abstract
We introduce probabilistic lexicographic preference trees (or PrLPTs for short). We show that they offer intuitive and often compact representations of non-deterministic qualitative preferences over alternatives in multi-attribute (or, combinatorial) binary domains. We specify how a PrLPT defines the probability that a given outcome has a given rank, and the probability that a given outcome is preferred to another one, and show how to compute these probabilities in polynomial time. We also show that computing outcomes that are optimal with the probability equal to or exceeding a given threshold for some classes of PrLP-trees is in P, but for some other classes the problem is NP-hard.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
Due to space restrictions, we provide a proof to the first of these results only.
- 2.
We refer to the work by Lang et al. [11] for the definitions of ranks and dominance for LP-trees.
References
Bigot, D., Zanuttini, B., Fargier, H., Mengin, J.: Probabilistic conditional preference networks. In: Proceedings of the Conference on Uncertainty in Artificial Intelligence (2013)
Booth, R., Chevaleyre, Y., Lang, J., Mengin, J., Sombattheera, C.: Learning conditionally lexicographic preference relations. In: ECAI, pp. 269–274 (2010)
Boutilier, C., Brafman, R., Domshlak, C., Hoos, H., Poole, D.: CP-nets: a tool for representing and reasoning with conditional ceteris paribus preference statements. J. Artif. Intell. Res. 21, 135–191 (2004)
Bouveret, S., Endriss, U., Lang, J.: Conditional importance networks: a graphical language for representing ordinal, monotonic preferences over sets of goods. In: IJCAI (2009)
Colman, A.M., Stirk, J.A.: Singleton bias and lexicographic preferences among equally valued alternatives. J. Econ. Behav. Org. 40(4), 337–351 (1999)
Cornelio, C., Grandi, U., Goldsmith, J., Mattei, N., Rossi, F., Venable, K.B.: Reasoning with PCP-nets in a multi-agent context. In: AAMAS, pp. 969–977 (2015)
De Saint-Cyr, F.D., Lang, J., Schiex, T.: Penalty logic and its link with Dempster-Shafer theory. In: Uncertainty Proceedings 1994, pp. 204–211. Elsevier (1994)
Dubois, D., Lang, J., Prade, H.: Possibilistic logic. In: Handbook of Logic in Artificial Intelligence and Logic Programming, vol. 3, pp. 439–513. Oxford University Press (1994)
Fishburn, P.C.: Utilities and decision rules: a survey’, lexicographic orders. Manag. Sci. 20, 1442–1471 (1974)
Ford, J.K., Schmitt, N., Schechtman, S.L., Hults, B.M., Doherty, M.L.: Process tracing methods: contributions, problems, and neglected research questions. Organ. Behav. Hum. Decis. Process. 43(1), 75–117 (1989)
Lang, J., Mengin, J., Xia, L.: Voting on multi-issue domains with conditionally lexicographic preferences. Artif. Intell. 265, 18–44 (2018)
Liu, X., Truszczynski, M.: Learning partial lexicographic preference trees over combinatorial domains. In: Proceedings of the 29th AAAI Conference on Artificial Intelligence (AAAI), pp. 1539–1545. AAAI Press (2015)
Liu, X., Truszczynski, M.: Reasoning with preference trees over combinatorial domains. In: Walsh, T. (ed.) ADT 2015. LNCS, vol. 9346, pp. 19–34. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-23114-3_2
Liu, X., Truszczynski, M.: Voting-based ensemble learning for partial lexicographic preference forests over combinatorial domains. Ann. Math. Artif. Intell. 87(1–2), 137–155 (2019)
Lukasiewicz, T., Martinez, M.V., Simari, G.I.: Probabilistic preference logic networks. In: ECAI, pp. 561–566 (2014)
Moshkovich, H., Mechitov, A., Olson, D.: Verbal decision analysis. In: Multiple Criteria Decision Analysis: State of the Art Surveys. ISOR, vol. 78, pp. 609–633. Springer, New York (2005). https://doi.org/10.1007/0-387-23081-5_15
Westenberg, M.R.M., Koele, P.: Multi-attribute evaluation processes: methodological and conceptual issues. Acta Psychol. 87(2–3), 65–84 (1994)
Acknowledgements
This work was partially supported by the NSF grant IIS-1618783.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Liu, X., Truszczynski, M. (2021). Probabilistic Lexicographic Preference Trees. In: Fotakis, D., Ríos Insua, D. (eds) Algorithmic Decision Theory. ADT 2021. Lecture Notes in Computer Science(), vol 13023. Springer, Cham. https://doi.org/10.1007/978-3-030-87756-9_6
Download citation
DOI: https://doi.org/10.1007/978-3-030-87756-9_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-87755-2
Online ISBN: 978-3-030-87756-9
eBook Packages: Computer ScienceComputer Science (R0)