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

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

20 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 languageUndefined
Title of host publicationProceedings of the 4th International Conference on Game Theory and Management
EditorsL.A. Petrosyan, N.A. Zenkevich
Place of PublicationSt. Petersburg
PublisherGraduate School of Management, St. Petersburg University
Pages241-265
Number of pages25
ISBN (Print)978-5-9924-0069-4
Publication statusPublished - 2011
Event4th International Conference on Game Theory and Management - St. Petersburg, Russia
Duration: 28 Jun 201030 Jun 2010

Publication series

NameContributions to Game Theory and Management
PublisherGraduate School of Management, St. Petersburg University
VolumeIV

Conference

Conference4th International Conference on Game Theory and Management
Period28/06/1030/06/10
Other28-30 June 2010

Keywords

  • MSC-91A12
  • MSC-91A43
  • EWI-22437
  • Deletion link property
  • Cooperation structure
  • METIS-289759
  • Efficiency
  • Stability
  • TU game
  • IR-83393
  • Myerson value

Cite this