Information and preference in partial orders: A bimatrix representation (Q1090585): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf02293980 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2061311133 / rank | |||
Normal rank | |||
Latest revision as of 08:23, 30 July 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
