Democratic approximation of lexicographic preference models
From MaRDI portal
Recommendations
- Learning lexicographic preference models
- Learning conditionally lexicographic preference relations
- Lexicographic preferences for predictive modeling of human decision making: a new machine learning method with an application in accounting
- Preference learning and optimization for partial lexicographic preference forests over combinatorial domains
- Voting-based ensemble learning for partial lexicographic preference forests over combinatorial domains
Cites work
- scientific article; zbMATH DE number 5957322 (Why is no real title available?)
- scientific article; zbMATH DE number 1288298 (Why is no real title available?)
- scientific article; zbMATH DE number 2243357 (Why is no real title available?)
- Building Relational World Models for Reinforcement Learning
- Exceptional Paper—Lexicographic Orders, Utilities and Decision Rules: A Survey
- Learning lexicographic orders
- Pairwise preference learning and ranking.
- The generalized simplex method for minimizing a linear form under linear inequality restraints
Cited in
(7)- Learning conditionally lexicographic preference relations
- Preference learning and optimization for partial lexicographic preference forests over combinatorial domains
- Relational networks of conditional preferences
- Voting-based ensemble learning for partial lexicographic preference forests over combinatorial domains
- Learning lexicographic preference models
- Lexicographic preferences for predictive modeling of human decision making: a new machine learning method with an application in accounting
- Randomized algorithms for lexicographic inference
This page was built for publication: Democratic approximation of lexicographic preference models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q646538)
