An Iterative Procedure for Evaluating Digraph Competitions

P.E.M. Borm, J.R. van den Brink, M. Slikker

Research output: Book/ReportReportProfessional

236 Downloads (Pure)

Abstract

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, we describe an iterative process is described which 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.
Original languageEnglish
Place of PublicationTilburg
PublisherMicroeconomics
Number of pages17
Volume788
Publication statusPublished - 2000

Publication series

NameFEW Research Memorandum
Volume788

Keywords

  • cooperative games
  • stochastic processes
  • iterative methods
  • digraph competitions

Fingerprint Dive into the research topics of 'An Iterative Procedure for Evaluating Digraph Competitions'. Together they form a unique fingerprint.

  • Cite this

    Borm, P. E. M., van den Brink, J. R., & Slikker, M. (2000). An Iterative Procedure for Evaluating Digraph Competitions. (FEW Research Memorandum; Vol. 788). Microeconomics.