We propose a new farsighted solution concept for abstract games, the Subgame Perfect Consistent Set (SPCS), based on consistency in the spirit of the von Neumann Morgenstern solution and on subgame perfect equilibrium. Rather than follow constructs such as indirect dominance, farsighted players...

We study fundamental properties of monotone network enterprises which contain public vertices and have positive and negative costs on edges and vertices. Among the properties studied are the nonemptiness of the core, characterization of nonredundant core constraints, ease of computation of the...

We introduce the concept of a characterization set for the nucleolus of a cooperative game and develop sufficient conditions for a collection of coalitions to form a characterization set thereof. Further, we formalize Kopelowitz's method for computing the nucleolus through the notion of a...