Characterizations of Solutions in Digraph Competitions

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

Research output: Working paperDiscussion paperOther research output

297 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

Fingerprint

Digraph
Game
Bankruptcy
Shapley Value
Axiom
Decompose
Vertex of a graph

Keywords

  • T-value
  • digraph competition
  • cooperative games

Cite this

Quant, M., Borm, P. E. M., Reijnierse, J. H., & Voorneveld, M. (2002). Characterizations of Solutions in Digraph Competitions. (CentER Discussion Paper; Vol. 2002-113). Tilburg: Operations research.
Quant, M. ; Borm, P.E.M. ; Reijnierse, J.H. ; Voorneveld, M. / Characterizations of Solutions in Digraph Competitions. Tilburg : Operations research, 2002. (CentER Discussion Paper).
@techreport{f8406395a31f47b0ab62d0e26dd846d1,
title = "Characterizations of Solutions in Digraph Competitions",
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.",
keywords = "T-value, digraph competition, cooperative games",
author = "M. Quant and P.E.M. Borm and J.H. Reijnierse and M. Voorneveld",
note = "Pagination: 21",
year = "2002",
language = "English",
volume = "2002-113",
series = "CentER Discussion Paper",
publisher = "Operations research",
type = "WorkingPaper",
institution = "Operations research",

}

Quant, M, Borm, PEM, Reijnierse, JH & Voorneveld, M 2002 'Characterizations of Solutions in Digraph Competitions' CentER Discussion Paper, vol. 2002-113, Operations research, Tilburg.

Characterizations of Solutions in Digraph Competitions. / Quant, M.; Borm, P.E.M.; Reijnierse, J.H.; Voorneveld, M.

Tilburg : Operations research, 2002. (CentER Discussion Paper; Vol. 2002-113).

Research output: Working paperDiscussion paperOther research output

TY - UNPB

T1 - Characterizations of Solutions in Digraph Competitions

AU - Quant, M.

AU - Borm, P.E.M.

AU - Reijnierse, J.H.

AU - Voorneveld, M.

N1 - Pagination: 21

PY - 2002

Y1 - 2002

N2 - 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.

AB - 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.

KW - T-value

KW - digraph competition

KW - cooperative games

M3 - Discussion paper

VL - 2002-113

T3 - CentER Discussion Paper

BT - Characterizations of Solutions in Digraph Competitions

PB - Operations research

CY - Tilburg

ER -

Quant M, Borm PEM, Reijnierse JH, Voorneveld M. Characterizations of Solutions in Digraph Competitions. Tilburg: Operations research. 2002. (CentER Discussion Paper).