Computing version spaces in the qualitative approach to multicriteria decision aid
From MaRDI portal
(Redirected from Publication:5384467)
Recommendations
- A generic multi-attribute analysis system
- ZAPROS-LM -- a method and system for ordering multiattribute alternatives
- Interactive Approaches for Discrete Alternative Multiple Criteria Decision Making with Monotone Utility Functions
- scientific article; zbMATH DE number 1017504
- scientific article; zbMATH DE number 3894850
Cites work
- A probabilistic framework for the design of instance-based supervised ranking algorithms in an ordinal setting
- Aggregation functions.
- Axiomatic characterization of a general utility function and its particular cases in terms of conjoint measurement and rough-set decision rules
- Axiomatizations and factorizations of Sugeno utility functions
- Axiomatizations of quasi-polynomial functions on bounded chains
- Characterizations of discrete Sugeno integrals as polynomial functions over distributive lattices
- Decision-making with Sugeno integrals. Bridging the gap between multicriteria evaluation and decision under uncertainty
- Elicitating Sugeno Integrals: Methodology and a Case Study
- General interpolation by polynomial functions of distributive lattices
- scientific article; zbMATH DE number 5556707 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1179314 (Why is no real title available?)
- scientific article; zbMATH DE number 1748069 (Why is no real title available?)
- scientific article; zbMATH DE number 3246292 (Why is no real title available?)
- Interpolation by polynomial functions of distributive lattices: a generalization of a theorem of R. L. Goodstein
- On Sugeno integral as an aggregation function
- Preference learning: An introduction
- Preference modeling on totally ordered sets by the Sugeno integral
- Pseudo-polynomial functions over finite distributive lattices
- Quasi-polynomial functions over bounded distributive lattices
- The complexity of satisfiability problems
- Weighted lattice polynomials
Cited in
(2)
This page was built for publication: Computing version spaces in the qualitative approach to multicriteria decision aid
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5384467)