The Average Tree value for Hypergraph Games

Liying Kang, Anna Khmelnitskaya, Erfang Shan, A.J.J. Talman, Guang Zhang

Research output: Working paperDiscussion paperOther research output

5 Downloads (Pure)

Abstract

We consider transferable utility cooperative games (TU games) with limited cooperation introduced by hypergraph communication structure, the so-called hypergraph games. A hypergraph communication structure is given by a collection of coalitions, the hyperlinks of the hypergraph, for which it is assumed that only coalitions that are hyperlinks or connected unions of hyperlinks are able to cooperate and realize their worth. We introduce the average tree value for hypergraph games, which assigns to each player the average of the player's marginal contributions with respect to a particular collection of rooted spanning trees of the hypergraph. We also provide axiomatization of the average tree value for hypergraph games on the subclasses of cycle-free hypergraph games, hypertree games and cycle hypergraph games.
Original languageEnglish
Place of PublicationTilburg
PublisherCentER, Center for Economic Research
Number of pages24
Volume2020-005
Publication statusPublished - 5 Feb 2020

Publication series

NameCentER Discussion Paper
Volume2020-005

Fingerprint

Communication

Keywords

  • TU game
  • hypergraph communication structure
  • average tree value
  • component fairness

Cite this

Kang, L., Khmelnitskaya, A., Shan, E., Talman, A. J. J., & Zhang, G. (2020). The Average Tree value for Hypergraph Games. (CentER Discussion Paper; Vol. 2020-005). Tilburg: CentER, Center for Economic Research.
Kang, Liying ; Khmelnitskaya, Anna ; Shan, Erfang ; Talman, A.J.J. ; Zhang, Guang. / The Average Tree value for Hypergraph Games. Tilburg : CentER, Center for Economic Research, 2020. (CentER Discussion Paper).
@techreport{331f101b09ee47d6afdfeccae8767583,
title = "The Average Tree value for Hypergraph Games",
abstract = "We consider transferable utility cooperative games (TU games) with limited cooperation introduced by hypergraph communication structure, the so-called hypergraph games. A hypergraph communication structure is given by a collection of coalitions, the hyperlinks of the hypergraph, for which it is assumed that only coalitions that are hyperlinks or connected unions of hyperlinks are able to cooperate and realize their worth. We introduce the average tree value for hypergraph games, which assigns to each player the average of the player's marginal contributions with respect to a particular collection of rooted spanning trees of the hypergraph. We also provide axiomatization of the average tree value for hypergraph games on the subclasses of cycle-free hypergraph games, hypertree games and cycle hypergraph games.",
keywords = "TU game, hypergraph communication structure, average tree value, component fairness",
author = "Liying Kang and Anna Khmelnitskaya and Erfang Shan and A.J.J. Talman and Guang Zhang",
note = "CentER Discussion Paper Nr. 2020-005",
year = "2020",
month = "2",
day = "5",
language = "English",
volume = "2020-005",
series = "CentER Discussion Paper",
publisher = "CentER, Center for Economic Research",
type = "WorkingPaper",
institution = "CentER, Center for Economic Research",

}

Kang, L, Khmelnitskaya, A, Shan, E, Talman, AJJ & Zhang, G 2020 'The Average Tree value for Hypergraph Games' CentER Discussion Paper, vol. 2020-005, CentER, Center for Economic Research, Tilburg.

The Average Tree value for Hypergraph Games. / Kang, Liying; Khmelnitskaya, Anna; Shan, Erfang; Talman, A.J.J.; Zhang, Guang.

Tilburg : CentER, Center for Economic Research, 2020. (CentER Discussion Paper; Vol. 2020-005).

Research output: Working paperDiscussion paperOther research output

TY - UNPB

T1 - The Average Tree value for Hypergraph Games

AU - Kang, Liying

AU - Khmelnitskaya, Anna

AU - Shan, Erfang

AU - Talman, A.J.J.

AU - Zhang, Guang

N1 - CentER Discussion Paper Nr. 2020-005

PY - 2020/2/5

Y1 - 2020/2/5

N2 - We consider transferable utility cooperative games (TU games) with limited cooperation introduced by hypergraph communication structure, the so-called hypergraph games. A hypergraph communication structure is given by a collection of coalitions, the hyperlinks of the hypergraph, for which it is assumed that only coalitions that are hyperlinks or connected unions of hyperlinks are able to cooperate and realize their worth. We introduce the average tree value for hypergraph games, which assigns to each player the average of the player's marginal contributions with respect to a particular collection of rooted spanning trees of the hypergraph. We also provide axiomatization of the average tree value for hypergraph games on the subclasses of cycle-free hypergraph games, hypertree games and cycle hypergraph games.

AB - We consider transferable utility cooperative games (TU games) with limited cooperation introduced by hypergraph communication structure, the so-called hypergraph games. A hypergraph communication structure is given by a collection of coalitions, the hyperlinks of the hypergraph, for which it is assumed that only coalitions that are hyperlinks or connected unions of hyperlinks are able to cooperate and realize their worth. We introduce the average tree value for hypergraph games, which assigns to each player the average of the player's marginal contributions with respect to a particular collection of rooted spanning trees of the hypergraph. We also provide axiomatization of the average tree value for hypergraph games on the subclasses of cycle-free hypergraph games, hypertree games and cycle hypergraph games.

KW - TU game

KW - hypergraph communication structure

KW - average tree value

KW - component fairness

M3 - Discussion paper

VL - 2020-005

T3 - CentER Discussion Paper

BT - The Average Tree value for Hypergraph Games

PB - CentER, Center for Economic Research

CY - Tilburg

ER -

Kang L, Khmelnitskaya A, Shan E, Talman AJJ, Zhang G. The Average Tree value for Hypergraph Games. Tilburg: CentER, Center for Economic Research. 2020 Feb 5. (CentER Discussion Paper).