Lexicographic aggregation of semiorders
From MaRDI portal
Recommendations
Cites work
Cited in
(9)- Aggregation of semiorders: Intransitive indifference makes a difference
- Essentially lexicographic aggregation
- Any complete preference structure without circuit admits an interval representation
- Unit representation of semiorders. I: Countable sets
- A theoretical look at \textsc{Electre Tri}-nB and related sorting models
- Bipolar preference modeling and aggregation in decision support
- Lexicographic semigroupoids
- A bijection between a set of lexicographic semiorders and pairs of non-crossing Dyck paths
- Bi-semiorders with frontiers on finite sets
This page was built for publication: Lexicographic aggregation of semiorders
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4863872)