The NTU-value

Abstract

Let 〈N, V〉 be an NTU-game. A (comparison weight) vector λ ∈ Δ := {µ ∈ ℝ ⁿ₊ | Σ ⁿ_i=1 µi = 1} is called V-feasible if for all S ∈ 2^N\{φ}:

$${v_\lambda }\left( S \right): = \sup \left\{ {\sum\limits_{i \in S} {{\lambda _i}{x_i}\left| {x \in V\left( S \right)} \right.} } \right\} < \infty .$$