Showing 1 - 3 of 3
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 payoff to the players of...
Persistent link: https://www.econbiz.de/10011386146
Persistent link: https://www.econbiz.de/10009680597
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 payoff to the players of...
Persistent link: https://www.econbiz.de/10014043850