Similar Search Results

Cost allocation in shortest path games

Grahn, Sofia - In: Topics in cooperative game theory, (pp. 6-27). 2001

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

Core and bargaining set of shortest path games

Grahn, Sofia - In: Topics in cooperative game theory, (pp. 28-42). 2001

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

Maximality of population monotonic allocation rules

Grahn, Sofia - In: Topics in cooperative game theory, (pp. 43-60). 2001

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

A minimal test for convex games and the Shapley value

Grahn, Sofia - In: Topics in cooperative game theory, (pp. 61-68). 2001

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

Population-monotonic allocation schemes in bankruptcy games

Grahn, Sofia - In: Topics in cooperative game theory, (pp. 80-93). 2001

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

Monotonic allocation schemes in clan games

Grahn, Sofia - In: Topics in cooperative game theory, (pp. 94-106). 2001

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

Topics in cooperative game theory

Grahn, Sofia - 2001

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

Core and bargaining set of shortest path games

Grahn, Sofia - 2001

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

Core and bargaining set of shortest path games

Grahn, Sofia - 2001

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

A Minimal Test for Convex Games and the Shapley Value

Voorneveld, Mark; Grahn, Sofia - 2001

A set of necessary and sufficient conditions for convexity of a transferable utility game in terms of its decomposition into unanimity games is shown to be minimal: none of the conditions is redundant. The result is used to provide an axiomatization of the Shapley value on the set of convex games.

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