An efficient and fair solution for communication graph games

Share/Save/Bookmark

Brink, Rene van den and Khmelnitskaya, Anna and Laan, Gerard van der (2011) An efficient and fair solution for communication graph games. [Report]

[img]
Preview
PDF
140Kb
Abstract: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.
Item Type:Report
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/76341
Publisher URL:http://www.math.utwente.nl/publications
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 277574