Ranking methods based on valued preference relations. A characterization of the net flow method (Q1198298): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Ranking methods for valued preference relations: A characterization of a method based on leaving and entering flows / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Note—A Preference Ranking Organisation Method / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5668657 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5514188 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5832742 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A proof technique for social choice with variable electorate / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Copeland choice function. An axiomatic characterization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Ranking the Participants in a Tournament / rank | |||
Normal rank |
Latest revision as of 16:00, 16 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Ranking methods based on valued preference relations. A characterization of the net flow method |
scientific article |
Statements
Ranking methods based on valued preference relations. A characterization of the net flow method (English)
0 references
16 January 1993
0 references
The paper studies the net flow method that builds a ranking on a set of alternatives based on a numerical comparison of alternatives. It is shown that this method is the only ranking method that is neutral, strongly monotonic and independent of circuits.
0 references
valued preference relations
0 references
ranking method
0 references
net flow method
0 references
0 references