AVERAGE TREE SOLUTION AND SUBCORE FOR ACYCLIC GRAPH GAMES AVERAGE TREE SOLUTION AND SUBCORE FOR ACYCLIC GRAPH GAMES

Access this Article

Search this Article

Author(s)

Abstract

In this paper we consider cooperative transferable utility games with limited communication structure, called graph games. Agents are able to cooperate only if they can communicate directly or indirectly with each other. For the class of acyclic graph games the average tree solution has recently been proposed. It was proven that the average tree solution is a core element if the game exhibits super-additivity. We show that the condition of super-additivity can be relaxed to a weaker condition, which admits for a natural interpretation. Moreover, we introduce the concept of subcore, which is a subset of the core, always contains the average tree solution, and therefore is a non-empty refinement of the core.

Journal

  • Journal of the Operations Research Society of Japan

    Journal of the Operations Research Society of Japan 51(3), 203-212, 2008

    The Operations Research Society of Japan

References:  7

Codes

  • NII Article ID (NAID)
    110006884638
  • NII NACSIS-CAT ID (NCID)
    AA00703935
  • Text Lang
    ENG
  • Article Type
    ART
  • ISSN
    0453-4514
  • NDL Article ID
    9650120
  • NDL Source Classification
    ZM31(科学技術--数学) // ZD25(経済--企業・経営--経営管理)
  • NDL Call No.
    Z53-M226
  • Data Source
    CJP  NDL  NII-ELS  IR  J-STAGE 
Page Top