Narrow search
Showing 1 - 6 of 6
Cover Image
An efficient and fair solution for communication graph games
Brink, René van den; Chmelnitskaja, Anna B.; Laan, … - 2011
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
Cover Image
The prenucleolus and the prekernel for games with communication structures
Chmelnitskaja, Anna B.; Sudhölter, Peter - In: Mathematical methods of operations research 78 (2013) 2, pp. 285-299
Persistent link: https://www.econbiz.de/10010205313
Cover Image
An owen-type value for games with two-level communication structures
Brink, René van den; Chmelnitskaja, Anna B.; Laan, … - 2011
Persistent link: https://www.econbiz.de/10010190658
Cover Image
Tree, web and average web values for cycle-free directed graph games
Chmelnitskaja, Anna B.; Talman, Dolf - In: European journal of operational research : EJOR 235 (2014) 1, pp. 233-246
Persistent link: https://www.econbiz.de/10010361351
Cover Image
An efficient and fair solution for communication graph games
Brink, René van den; Chmelnitskaja, Anna B.; Laan, … - In: Economics letters 117 (2012) 3, pp. 786-789
Persistent link: https://www.econbiz.de/10009680597
Cover Image
An Efficient and Fair Solution for Communication Graph Games
van den Brink, René; Khmelnitskaya, Anna; van der … - 2011
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