Internal slackening scoring methods

Theory and Decision 72 (4):445-462 (2012)
  Copy   BIBTEX

Abstract

We deal with the ranking problem of the nodes in a directed graph. The bilateral relationships specified by a directed graph may reflect the outcomes of a sport competition, the mutual reference structure between websites, or a group preference structure over alternatives. We introduce a class of scoring methods for directed graphs, indexed by a single nonnegative parameter α. This parameter reflects the internal slackening of a node within an underlying iterative process. The class of so-called internal slackening scoring methods, denoted by λα, consists of the limits of these processes. It is seen that λ0 extends the invariant scoring method, while λ∞ extends the fair bets scoring method. Method λ1 corresponds with the existing λ-scoring method of Borm et al. (Ann Oper Res 109(1):61–75, 2002) and can be seen as a compromise between λ0 and λ∞. In particular, an explicit proportionality relation between λα and λ1 is derived. Moreover, the internal slackening scoring methods are applied to the setting of social choice situations where they give rise to a class of social choice correspondences that refine both the Top cycle correspondence and the Uncovered set correspondence.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,745

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

The Value of ‘Measuring’ RRI Performance in Industry.Steven M. Flipse & Emad Yaghmaei - 2018 - In Fernando Ferri, Ned Dwyer, Saša Raicevich, Patrizia Grifoni, Husne Altiok, Hans Thor Andersen, Yiannis Laouris & Cecilia Silvestri (eds.), Governance and Sustainability of Responsible Research and Innovation Processes: Cases and Experiences. Cham: Springer Verlag. pp. 41-47.

Analytics

Added to PP
2013-10-31

Downloads
88 (#64,609)

6 months
13 (#1,035,185)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Digraph Competitions and Cooperative Games.René van Den Brink & Peter Borm - 2002 - Theory and Decision 53 (4):327-342.

Add more references