Similar Search Results

Tree, web and average web values for cycle-free directed graph games

Khmelnitskaya, Anna; Talman, Dolf - In: European Journal of Operational Research 235 (2014) 1, pp. 233-246

algorithms to calculate them. Additionally the efficiency and stability of web values are studied. Web values may be considered …

Persistent link: https://www.econbiz.de/10010744229

Tree-Type Values for Cycle-Free Directed Graph Games

Talman, Dolf; Khmelnitskaya, A. - Tilburg University, Center for Economic Research - 2010

Mathematics Subject Classification 2000: 91A12, 91A43

Persistent link: https://www.econbiz.de/10011091131

Tree, Web and Average Web Value for Cycle-Free Directed Graph Games

Talman, Dolf; Khmelnitskaya, A. - Tilburg University, Center for Economic Research - 2011

explicit formula representation and simple recursive algorithms to calculate them. Additionally the effciency and stability of …

Persistent link: https://www.econbiz.de/10011091203

Equivalence and axiomatization of solutions for cooperative games with circular communication structure

Selçuk, Özer; Suzuki, Takamasa; Talman, Dolf - In: Economics Letters 121 (2013) 3, pp. 428-431

communication structures where the set of players forms a circle, so that the possibilities of cooperation are represented by the … using efficiency, linearity, some restricted dummy property, and some kind of symmetry. …

Persistent link: https://www.econbiz.de/10011041728

Closedness under Hart-Mas Colell reduction

Chang, Chih; Hwang, Yan-An - In: International Journal of Game Theory 30 (2002) 3, pp. 351-357

We will find 3 maximal subclasses with respect to essential, superadditive and convex games, respectively such that a game is in one subclass, so are its reduced games.

Persistent link: https://www.econbiz.de/10005375529

The Average Tree Permission Value for Games with a Permission Tree

Talman, Dolf; van den Brink, R.; Herings, P.J.J.; van … - Tilburg University, Center for Economic Research - 2013

games based on the idea of the Average Tree value for cycle-free communication graph games. We provide two axiomatizations …

Persistent link: https://www.econbiz.de/10011090663

Games With General Coalitional Structure

Talman, Dolf; Selcuk, O. - Tilburg University, Center for Economic Research - 2013

Abstract: This paper introduces a new solution concept for cooperative games with general coalitional structure in which only certain sets of players, including the set of all players, are able to form feasible coalitions. The solution concept takes into account the marginal contribution of...

Persistent link: https://www.econbiz.de/10011092822

The Shapley Value for Directed Graph Games

Talman, Dolf; Khmelnitskaya, A.; Selçuk, O. - Tilburg University, Center for Economic Research - 2014

convexity type condition is provided that guarantees its stability with respect to an appropriately defined core concept. An …

Persistent link: https://www.econbiz.de/10011144450

The Average Tree permission value for games with a permission tree

Brink, René; Herings, P.; Laan, Gerard; Talman, A. - In: Economic Theory 58 (2015) 1, pp. 99-123

games based on the idea of the Average Tree value for cycle-free communication graph games. We provide two axiomatizations …

Persistent link: https://www.econbiz.de/10011151153

Component efficient solutions in line-graph games with applications

Brink, René; Laan, Gerard; Valeri Vasil’ev - In: Economic Theory 33 (2007) 2, pp. 349-364

Persistent link: https://www.econbiz.de/10005155399