Skip to main content

Incremental Elicitation of Preferences: Optimist or Pessimist?

  • Conference paper
  • First Online:
Algorithmic Decision Theory (ADT 2021)

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

Included in the following conference series:

  • 671 Accesses

Abstract

In robust incremental elicitation, it is quite common to make recommendations and to select queries by using a minimax regret criterion, which corresponds to a pessimistic attitude. In this paper, we explore its optimistic counterpart, showing this new approach enjoys the same convergence properties. While this optimistic approach does not offer the same kind of guarantees than minimax approaches, it still offers some other interesting properties. Finally, we illustrate with some experiments that the best approach amongst the two approaches heavily depends on the underlying setting.

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

    The user is an oracle, and the chosen family of preference model includes the right model.

  2. 2.

    It does not, however, offer the same robust guarantees.

References

  1. Benabbou, N., Gonzales, C., Perny, P., Viappiani, P.: Minimax regret approaches for preference elicitation with rank-dependent aggregators. EURO J. Decis. Processes, 29–64 (2015). https://doi.org/10.1007/s40070-015-0040-6

  2. Benabbou, N., Perny, P., Viappiani, P.: Incremental elicitation of choquet capacities for multicriteria choice, ranking and sorting problems. Artif. Intell. 246, 152–180 (2017)

    Google Scholar 

  3. Bourdache, N., Perny, P.: Anytime algorithms for adaptive robust optimization with OWA and WOWA. In: Rothe, J. (ed.) ADT 2017. LNCS, vol. 10576, pp. 93–107. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-67504-6_7

  4. Boutilier, C.: Computational decision support: regret-based models for optimization and preference elicitation. In: Comparative Decision Making: Analysis and Support Across Disciplines and Applications, pp. 423–453 (2013)

    Google Scholar 

  5. Boutilier, C., Patrascu, R., Poupart, P., Schuurmans, D.: Constraint-based optimization and utility elicitation using the minimax decision criterion. Artif. Intell. 170(8–9), 686–713 (2006)

    Google Scholar 

  6. Cabannnes, V., Rudi, A., Bach, F.: Structured prediction with partial labelling through the infimum loss. In: International Conference on Machine Learning, pp. 1230–1239. PMLR (2020)

    Google Scholar 

  7. Choquet, G.: Theory of capacities. In: Annales de l’institut Fourier, vol. 5, pp. 131–295 (1954)

    Google Scholar 

  8. Ciomek, K., Kadziński, M., Tervonen, T.: Heuristics for prioritizing pair-wise elicitation questions with additive multi-attribute value models. Omega 71, 27–45 (2017)

    Google Scholar 

  9. Grabisch, M.: The application of fuzzy integrals in multicriteria decision making. Eur. J. Oper. Res. 89(3), 445–456 (1996)

    Google Scholar 

  10. Guillot, P.L., Destercke, S.: Preference elicitation with uncertainty: extending regret based methods with belief functions. In: Ben Amor, N., Quost, B., Theobald, M. (eds.) SUM 2019. LNCS, vol. 11940, pp. 289–309. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-35514-2_22

  11. Holloway, H.A., White Iii, C.C.: Question selection for multi-attribute decision-aiding. Eur. J. Oper. Res. 148(3), 525–533 (2003)

    Google Scholar 

  12. Hüllermeier, E., Destercke, S., Couso, I.: Learning from imprecise data: adjustments of optimistic and pessimistic variants. In: Ben Amor, N., , B., Theobald, M. (eds.) SUM 2019. LNCS, vol. 11940, pp. 266–279. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-35514-2_20

  13. Maron, O., Moore, A.W.: The racing algorithm: model selection for lazy learners. Artif. Intell. Rev. 11(1), 193–225 (1997)

    Google Scholar 

  14. Savage, L.J.: The theory of statistical decision. J. Am. Stat. Assoc. 46(253), 55–67 (1951)

    Google Scholar 

  15. Tornede, A., Wever, M., Hüllermeier, E.: Extreme algorithm selection with dyadic feature representation. In: Appice, A., Tsoumakas, G., Manolopoulos, Y., Matwin, S. (eds.) DS 2020. LNCS, vol. 12323, pp. 309–324. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-61527-7_21

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

    Google Scholar 

  17. Yager, R.R.: On ordered weighted averaging aggregation operators in multicriteria decisionmaking. IEEE Trans. Syst. Man Cybern. 18(1), 183–190 (1988)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Sébastien Destercke .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Adam, L., Destercke, S. (2021). Incremental Elicitation of Preferences: Optimist or Pessimist?. 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_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-87756-9_5

  • 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)

Publish with us

Policies and ethics