A proposed voting scheme to reduce the sensitivity of the Markov method

Baback Vaziri, Yuehwern Yih and Tom Morin

International Journal of Operational Research, 2018, vol. 32, issue 1, 24-40

Abstract: The Markov method is one of many successful ranking methods that uses Markov chains to obtain its ratings and rankings of alternatives. It has been shown, however, that the method is sensitive to upsets, particularly in the tail of its ranking. The method also exhibits faulty behaviour when it has a periodic Markov chain. This study proposes a modification to the voting scheme of the Markov method that will alleviate the sensitivity to upsets and remove the issue of periodicity in the Markov chain. To examine the sensitivity, we first provide an example and see how both voting schemes react to an upset. Next, we generalise both voting schemes and examine a ratio of rating increments to understand why the tailing effect occurs, and how we can subside its effect.

Keywords: ranking methods; Markov method; sensitivity; ranking vectors. (search for similar items in EconPapers)
Date: 2018
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.inderscience.com/link.php?id=91200 (text/html)
Access to full text is restricted to subscribers.

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:ids:ijores:v:32:y:2018:i:1:p:24-40

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().