An efficient and fair solution for communication graph games

René van den Brink, Anna Borisovna Khmelnitskaya, Gerard van der Laan

Research output: Contribution to journalArticleAcademicpeer-review

23 Citations (Scopus)


We introduce an efficient solution for games with communication graph structures and show that it is characterized by efficiency, fairness and a new axiom called fair distribution of the surplus.
Original languageUndefined
Pages (from-to)786-789
Number of pages4
JournalEconomics letters
Issue number3
Publication statusPublished - 2012


  • Myerson value
  • TU game
  • EWI-22438
  • Game Theory
  • IR-82126
  • Communication graph
  • METIS-289760

Cite this