Similar Search Results

An algorithm for computing the nucleolus of disjunctive additive games with an acyclic permission structure

Brink, René van den; Katsev, Ilya; Laan, Gerard van der - 2008

A situation in which a finite set of players can obtain certain payoffs by cooperation can be described by a cooperative game with transferable utility, or simply a TU-game. A (single-valued) solution for TU-games assigns a payoff distribution to every TU-game. A well-known solution is the...

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

On Harsanyi payoff vectors and the Weber set

Derks, Jean J. M.; Laan, Gerard van der; Vasilʹev, … - 2002

, these results state already that the set of Harsanyi payoff vectors is given by the core of an associated convex game, a …

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

Null or zero players : the difference between the shapley value and the egalitarian solution

Brink, René van den - 2004

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

Polluted river problems and games with a permission structure

Brink, René van den; He, Simin; Huang, Jiaping - 2015

Polluted rivers are harmful to human, animals and plants living along it. To reduce the harm, cleaning costs are generated. However, when the river passes through several different countries or regions, a relevant question is how should the costs be shared among the agents. Ni and Wang (2007)...

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

Harsanyi power solutions for graph-restricted games

Brink, René van den; Laan, Gerard van der; Pruzhansky, … - 2004

A situation in which a finite set of players can obtain certain payoffs by cooperation can be described by a cooperative game with transferable utility, or simply a TU-game. A solution for TU-games assigns a set of payoff distributions (possibly empty or consisting of a unique element) to every...

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

Cooperative games in graph structure

Herings, Peter Jean-Jacques; Laan, Gerard van der; … - 2000

of ones. We then define the balanced-core as a refinement ofthe core. A payoff vector lies in the balanced-core if it … lies in the core andthe payoff vector is an element of payoff sets of all graphs in some balanced collection ofgraphs. We … prove that any balanced graph game has a nonempty balanced-core.We conclude by some examples showing the usefulness of the …

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