Ranking with Multiple Incommensurable Criteria

Raymond Bisdorff

Chapter Chapter 8 in Algorithmic Decision Making with Python Resources, 2022, pp 97-113 from Springer

Abstract: Abstract The Digraph3 python resources provide several algorithms for solving the multiple incommensurable criteria ranking problem via bipolar-valued outranking digraphs. The Copeland, NetFlows, Kemeny, Slater, Kohler, and the RankedPairs ranking rules are introduced and illustrated with a random outranking digraph.

Date: 2022
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:isochp:978-3-030-90928-4_8

Ordering information: This item can be ordered from
http://www.springer.com/9783030909284

DOI: 10.1007/978-3-030-90928-4_8

Access Statistics for this chapter

More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().