In this paper we examine the ranking of objects whose relative merits are given by a directed graph. We consider several measures and show their rationality through axiomatization as well as showing the relationship with the Shapley value of games whose characteristic function is derived from the directed graph. We also give some numerical examples and report the experience of the application to the best paper selection problem
AbstractA paired comparison digraph D is a weighted digraph in which the sum of the weights of arcs,...
We deal with the problem of how to extend a preference relation over a set X of “objects” to the se...
The Shapley value for directed graph (digraph) games, TU games with limited cooperation introduced b...
In this paper we examine the ranking for the case of many judges and manyobjects. We use a directed ...
It is assumed that relations between n players are represented by a directed graph or digraph. Such ...
It is assumed that relations between $n$ players are represented by a directed graph or digraph. Suc...
The Shapley value for directed graph (digraph) games, TU games with limited cooperation introduced b...
One of the most famous ranking methods for digraphs is the ranking by Copeland score. The Copeland s...
URL des Documents de travail : https://centredeconomiesorbonne.univ-paris1.fr/documents-de-travail-d...
AbstractA ranking method assigns to every directed graph a (weak) ordering of the nodes. In this pap...
Many economic and social situations can be represented by a digraph. Both local and global methods t...
The β-measure has been introduced and characterized by van den Brink and Gilles (2000) for measuring...
In this paper we provide an axiomatization of the Shapley value restricted to the class of apex game...
The ß-measure has been introduced and characterized by van den Brink and Gilles (2000) for measuring...
AbstractA paired comparison digraph D is a weighted digraph in which the sum of the weights of arcs,...
We deal with the problem of how to extend a preference relation over a set X of “objects” to the se...
The Shapley value for directed graph (digraph) games, TU games with limited cooperation introduced b...
In this paper we examine the ranking for the case of many judges and manyobjects. We use a directed ...
It is assumed that relations between n players are represented by a directed graph or digraph. Such ...
It is assumed that relations between $n$ players are represented by a directed graph or digraph. Suc...
The Shapley value for directed graph (digraph) games, TU games with limited cooperation introduced b...
One of the most famous ranking methods for digraphs is the ranking by Copeland score. The Copeland s...
URL des Documents de travail : https://centredeconomiesorbonne.univ-paris1.fr/documents-de-travail-d...
AbstractA ranking method assigns to every directed graph a (weak) ordering of the nodes. In this pap...
Many economic and social situations can be represented by a digraph. Both local and global methods t...
The β-measure has been introduced and characterized by van den Brink and Gilles (2000) for measuring...
In this paper we provide an axiomatization of the Shapley value restricted to the class of apex game...
The ß-measure has been introduced and characterized by van den Brink and Gilles (2000) for measuring...
AbstractA paired comparison digraph D is a weighted digraph in which the sum of the weights of arcs,...
We deal with the problem of how to extend a preference relation over a set X of “objects” to the se...
The Shapley value for directed graph (digraph) games, TU games with limited cooperation introduced b...