We consider the division problems in which a resource must be distributed considering agents' references. We analize this problems in a multidimensional context, we consider that agents have multiple references. For division of the amount available in these situations, we design rules that take...

This paper provides a noncooperative understanding of the nucleolus and the egalitarian allocation for airport cost problems. We find that every Nash equilibrium of the noncooperative game has the nucleolus as outcome while the egalitarian allocation is just one of the Nash outcomes.

Minimum-cost spanning tree problems are well-known problems in the operations research literature. Some agents, located at different geographical places, want a service provided by a common supplier. Agents will be served through costly connections. Some part of the literature has focused,...

Decentralized matching markets on the internet allow large numbers of agents to interact anonymously at virtually no cost. Very little information is available to market participants and trade takes place at many different prices simultaneously. We propose a decentralized, completely uncoupled...

This paper is a survey of the work in the Nash program for coalitional games, a research agenda proposed by Nash (1953) to bridge the gap between the non-cooperative and cooperative approaches to game theory.

We consider a model of the 'world' with several regions that may create a unified entity or be partitioned into several unions (countries). The regions have distinct preferences over policies chosen in the country to which they belong and equally share the cost of public policies. It is known...

In this paper we consider the problem of the control of access to a firm's productive asset, embedding the relevant decisionmakers into a general structure of formal authority relations. Within such an authority structure, each decision maker acts as a principal to some decision makers, while...

In this paper we introduce and characterize two new values for transferable utility games with graph restricted communication and a priori unions. Both values are obtained by applying the Shapley value to an associated TU-game. The graph-partition restricted TU-game is obtained by taking the...

We introduce the prediction value (PV) as a measure of players' informational importance in probabilistic TU games. The latter combine a standard TU game and a probability distribution over the set of coalitions. Player i's prediction value equals the difference between the conditional...

We develop a model of assignment games with pairwise-identity-dependent externalities. A concept of conjectural equilibrium is proposed, and the universal conjecture is shown to be the necessary and sufficient condition for the general existence of equilibrium. We then apply the solution concept...