Two solution concepts for TU games with cycle-free directed cooperation structures

A. Khmelnitskaya, A.J.J. Talman

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

247 Downloads (Pure)

Abstract

For arbitrary cycle-free directed graph games tree-type values are introduced axiomatically and their explicit formula representation is provided. These values may be considered as natural extensions of the tree and sink values as has been defined correspondingly for rooted and sink forest graph games. The main property for the tree value is that every player in the game receives the worth of this player together with his successors minus what these successors receive. It implies that every coalition of players consisting of one of the players with all his successors receives precisely its worth. Additionally their efficiency and stability are studied. Simple recursive algorithms to calculate the values are also provided. The application to the water distribution problem of a river with multiple sources, a delta and possibly islands is considered.
Original languageEnglish
Title of host publicationProceedings of the 4th International Conference Game Theory and Management
EditorsL.A. Petrosyan, N.A. Zenkevich
Place of PublicationSt Petersburg
PublisherGraduate School of Management, SPbU
Pages241-265
VolumeIV
ISBN (Print)9785992400694
Publication statusPublished - 2011

Publication series

Name
VolumeIV

Fingerprint Dive into the research topics of 'Two solution concepts for TU games with cycle-free directed cooperation structures'. Together they form a unique fingerprint.

  • Cite this

    Khmelnitskaya, A., & Talman, A. J. J. (2011). Two solution concepts for TU games with cycle-free directed cooperation structures. In L. A. Petrosyan, & N. A. Zenkevich (Eds.), Proceedings of the 4th International Conference Game Theory and Management (Vol. IV, pp. 241-265). Graduate School of Management, SPbU.