.png){kind=icon}
.png){kind=icon}
Return
An iterative procedure for evaluating digraph competitions
.png){kind=icon}
PRE
AI
DOI：10.1023/A:1016339832755.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
cooperative games
digraph competitions
limit measure
relational power measure
Shapley value
stochastic processes
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.5
Papers:
8.0K
Citations:
2.1W
Organization
No organization information available