Similar Search Results

The Shapley value for directed graph games

Chmelnitskaja, Anna B.; Selçuk, Özer; Talman, Dolf - 2014

Persistent link: https://ebvufind01.dmz1.zbw.eu/10011284534

The Shapley value for directed graph games

Chmelnitskaja, Anna B.; Selçuk, Özer; Talman, Dolf - In: Operations research letters 44 (2016) 1, pp. 143-147

Persistent link: https://ebvufind01.dmz1.zbw.eu/10011455594

The two-step average tree value fro graph and hypergraph game

Kangy, Liying; Chmelnitskaja, Anna B.; Shan, Erfang; … - 2020

Persistent link: https://ebvufind01.dmz1.zbw.eu/10012242297

The average tree value for hypergraph games

Kang, Liying; Chmelnitskaja, Anna B.; Shan, Erfang; … - 2020

Persistent link: https://ebvufind01.dmz1.zbw.eu/10012161559

The average tree value for hypergraph games

Kang, Liying; Chmelnitskaja, Anna B.; Shan, Erfang; … - In: Mathematical methods of operations research : ZOR 94 (2021) 3, pp. 437-460

Persistent link: https://ebvufind01.dmz1.zbw.eu/10012793588

The average tree permission value for games with a permission tree

Brink, René van den; Herings, Peter Jean-Jacques; … - 2013

Persistent link: https://ebvufind01.dmz1.zbw.eu/10010191429

The Average Tree permission value for games with a permission tree

Brink, René van den; Herings, Peter Jean-Jacques; … - In: Economic theory : official journal of the Society for … 58 (2015) 1, pp. 99-123

Persistent link: https://ebvufind01.dmz1.zbw.eu/10011376090

An owen-type value for games with two-level communication structures

Brink, René van den; Chmelnitskaja, Anna B.; Laan, … - 2011

Persistent link: https://ebvufind01.dmz1.zbw.eu/10010190658

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://ebvufind01.dmz1.zbw.eu/10010205313

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://ebvufind01.dmz1.zbw.eu/10011386146