Monotonicity of the core and value in dynamic cooperative games (Q2641231): Difference between revisions

Let N be a finite player-set, \(k\not\in N\), and let \(N':=N\cup \{k\}\). First, two super-additive side-payment games, v defined on the coalitions in N and w defined on the coalitions in \(N'\) satisfying \(v(S)=w(S)\) for all \(S\subset N\), are compared in terms of solution concepts: (1) The Shapley value is monotone if w is convex. (2) The Shapley value is monotone and there is a monotone selection of the core, if w is a flow game such that k is a player in the minimum cut of the new network. Second, two non-side-payment games, V defined on \(2^ N\) and W defined on \(2^{N'}\) satisfying \(V(S)=W(S)\) for all \(S\subset N\), are compared: (1) The (generalized) Shapley value defined by applying the greedy algorithm is monotone if W is a convex hyperplane game.