Learning the Parameters of a Non Compensatory Sorting Model

DOI10.1007/978-3-319-23114-3_10zbMath1405.90067OpenAlexW2211238471MaRDI QIDQ3449528

Marc Pirlot, Olivier Sobrie, Vincent Mousseau

Publication date: 4 November 2015

Published in: Algorithmic Decision Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-23114-3_10

zbMATH Keywords

majority rulemulticriteria sorting procedure

Mathematics Subject Classification ID

Decision theory (91B06) Mixed integer programming (90C11) Management decision making, including multiple objectives (90B50)

Related Items (7)

An efficient SAT formulation for learning multiple criteria non-compensatory sorting rules from examples ⋮ Incremental elicitation of Choquet capacities for multicriteria choice, ranking and sorting problems ⋮ Interactive portfolio selection involving multicriteria sorting models ⋮ Enumerating and categorizing positive Boolean functions separable by a \(k\)-additive capacity ⋮ Interactive elicitation of a majority rule sorting model with maximum margin optimization ⋮ Learning non-compensatory sorting models using efficient SAT/MaxSAT formulations ⋮ Ranking with multiple reference points: efficient SAT-based learning procedures

This page was built for publication: Learning the Parameters of a Non Compensatory Sorting Model