Characterizations of Solutions in Digraph Competitions

M. Quant, P.E.M. Borm, J.H. Reijnierse, M. Voorneveld

Research output: Working paperDiscussion paperOther research output

347 Downloads (Pure)

Abstract

The T -measure is introduces as a method to rank the nodes in a digraph competition.It coincides with the T -value of an associated transferable utility game, the so-called digraph game.The T -measure is characterized in two ways.One of them is based on a characterization of the T -value in bankruptcy games and uses a decomposition axiom.This characterization also leads to a new characterization of the --measure, a solution method for digraph competitions based on the Shapley value of the digraph game.
Original languageEnglish
Place of PublicationTilburg
PublisherOperations research
Number of pages21
Volume2002-113
Publication statusPublished - 2002

Publication series

NameCentER Discussion Paper
Volume2002-113

Keywords

  • T-value
  • digraph competition
  • cooperative games

Fingerprint Dive into the research topics of 'Characterizations of Solutions in Digraph Competitions'. Together they form a unique fingerprint.

Cite this