An efficient and fair solution for communication graph games

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

Research output: Book/ReportReportProfessional

97 Downloads (Pure)


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 component balancedness. This latter axiom compares for every component in the communication graph the total payo to the players of this component in the game itself to the total payoff of these players when applying the solution to the subgame induced by this component.
Original languageUndefined
Place of PublicationEnschede
PublisherUniversity of Twente, Department of Applied Mathematics
Number of pages12
Publication statusPublished - Mar 2011

Publication series

NameMemorandum / Department of Applied Mathematics
PublisherUniversity of Twente, Department of Applied Mathematics
ISSN (Print)1874-4850
ISSN (Electronic)1874-4850


  • IR-76341
  • METIS-277574
  • Fairness
  • EWI-19775
  • TU game
  • Efficiency
  • Myerson value
  • Communication graph

Cite this