Internal slackening scoring methods

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 λ⁰ extends the invariant scoring method, while λ ^∞ extends the fair bets scoring method. Method λ¹ corresponds with the existing λ‐scoring method of Borm et al. (2002) and can be seen as a compromise between λ⁰ and λ ^∞ . In particular, an explicit proportionality relation between λ ^α and λ¹ 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.