An Iterative Procedure for Evaluating Digraph Competitions
A competition which is based on the results of (partial) pairwise comparisons can be modelled by means of a directed graph. Given initial weights on the nodes in such digraph competitions, we view the measurement of the importance (i.e., the cardinal ranking) of the nodes as an allocation problem where we redistribute the initial weights on the basis of insights from cooperative game theory. After describing the resulting procedure of redistributing the initial weights, an iterative process is described that repeats this procedure: at each step the allocation obtained in the previous step determines the new input weights. Existence and uniqueness of the limit is established for arbitrary digraphs. Applications to the evaluation of, e.g., sport competitions and paired comparison experiments are discussed. Copyright Kluwer Academic Publishers 2002
Volume (Year): 109 (2002)
Issue (Month): 1 (January)
|Contact details of provider:|| Web page: http://www.springer.com|
|Order Information:||Web: http://www.springer.com/journal/10479|
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- René van den Brink & Peter Borm, 2002.
"Digraph Competitions and Cooperative Games,"
Theory and Decision,
Springer, vol. 53(4), pages 327-342, December.
- van den Brink, J.R. & Borm, P.E.M., 1994. "Digraph competitions and cooperative games," Discussion Paper 1994-24, Tilburg University, Center for Economic Research.
- van den Brink, J.R. & Borm, P.E.M., 2002. "Digraph competitions and cooperative games," Other publications TiSEM 262e8724-0bc0-49da-99c5-f, Tilburg University, School of Economics and Management.
- Laffond G. & Laslier J. F. & Le Breton M., 1993. "The Bipartisan Set of a Tournament Game," Games and Economic Behavior, Elsevier, vol. 5(1), pages 182-201, January.