Games With Limited Communication Structure

A.J.J. Talman, Y. Yamamoto

Research output: Working paperDiscussion paperOther research output

204 Downloads (Pure)

Abstract

In this paper we consider cooperative transferable utility games with limited communication structure, called graph games. Agents are able to cooperate with each other only if they can communicate directly or indirectly with each other. For the class of acyclic graph games recently the average tree solution has been proposed. It was proven that the average tree solution is a core element if the game exhibits superadditivity. It will be shown that the condition of super-additivity can be relaxed to a weaker condition, which admits for a natural interpretation. Moreover, the concept of subcore is introduced. Under the same condition it is proven that the subcore is a subset of the core and always contains the average tree solution and therefore is a non-empty refinement of the core.
Original languageEnglish
Place of PublicationTilburg
PublisherOperations research
Number of pages12
Volume2007-19
Publication statusPublished - 2007

Publication series

NameCentER Discussion Paper
Volume2007-19

Fingerprint Dive into the research topics of 'Games With Limited Communication Structure'. Together they form a unique fingerprint.

  • Cite this

    Talman, A. J. J., & Yamamoto, Y. (2007). Games With Limited Communication Structure. (CentER Discussion Paper; Vol. 2007-19). Operations research.