We prove that fixed-route traveling salesman games have non-empty cores if the fixed route is a solution of the classical traveling salesman problem.Expand

We give a survey of cost allocation methods based on nucleolus and the Shapley value, and introduce also a new one, the so-called cost gap allocation method which is based on the I-value.Expand

Minimum cost spanning extension problems are generalizations of minimum cost spanning tree problems in which an existing network has to be extended to connect users to a source. This paper… Expand

We start with giving an axiomatic characterization of the Nash equilibrium (NE) correspondence in terms of consistency, converse consistency, and one-person rationality. Then axiomatizations are… Expand

In this paper standard oligopolies are interpreted in two ways, namely as oligopolies without transferable technologies and as oligopolies with transferable technologies. From a cooperative point of… Expand

This paper introduces a new class of cooperative games arising from cooperative decision making problems in a stochastic environment where the preferences are of a specific type.Expand