An efficient and fair solution for communication graph games

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

    Research output: Contribution to journalArticleAcademicpeer-review

    32 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 languageEnglish
    Pages (from-to)786-789
    Number of pages4
    JournalEconomics letters
    Issue number3
    Publication statusPublished - 2012


    • Myerson value
    • TU game
    • Game theory
    • Communication graph

    Cite this