Information and preference in partial orders: A bimatrix representation (Q1090585): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3266133 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Preference structures I: Distances between transitive preference relations† / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Preference Structures. II: Distances Between Asymmetric Relations / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Social Preference Orderings and Majority Rule / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Distances between trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Relational Systems of Preference with One or More Pseudo-Criteria: Some New Concepts and Results / rank | |||
Normal rank | |||
Revision as of 19:17, 17 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Information and preference in partial orders: A bimatrix representation |
scientific article |
Statements
Information and preference in partial orders: A bimatrix representation (English)
0 references
1986
0 references
The authors axiomatically characterize a distance on a set of orders which can have both indifference and incomparability extending the work of \textit{J. G. Kemeny} and \textit{J. L. Snell} (1962) and of \textit{K. P. Bogart} [Discrete Math. 5, 21-31 (1973; Zbl 0262.06001)]. This gives a consensus method by minimizing total distance.
0 references
information and preference in partial orders
0 references
bimatrix representation
0 references
ordinal partial rankings
0 references
ranking
0 references
consensus method
0 references
