A proposed voting scheme to reduce the sensitivity of the Markov method
by Baback Vaziri; Yuehwern Yih; Tom Morin
International Journal of Operational Research (IJOR), Vol. 32, No. 1, 2018

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.

Online publication date: Mon, 16-Apr-2018

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com