The average tree value for hypergraph games

Liying Kang, Anna Borisovna Khmelnitskaya, Erfang Shan, Dolf Talman, Guang Zhang

Research output: Book/ReportReportProfessional

137 Downloads (Pure)


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 PublicationEnschede
PublisherUniversity of Twente
Number of pages23
Publication statusPublished - 20 Feb 2020

Publication series

PublisherUniversity of Twente, Department of Applied Mathematics
ISSN (Print)1874-4850


  • TU game
  • Hypergraph communication structure
  • Average tree value
  • Component fairness


Dive into the research topics of 'The average tree value for hypergraph games'. Together they form a unique fingerprint.

Cite this