This paper proposes axiomatic foundations of expectation formation rules, by which deviating players anticipate the reaction of external players in a partition function game. The projection rule is the only rule satisfying subset consistency and responsiveness to the original partition of...

It is shown that the Harsanyi NTU solution is consistent according to the Hart and Mas-Colell reduced game for NTU games, when we consider payoff configurations as solution outcomes. Moreover, we characterize this solution on a wide class of NTU games where this solution is single-valued:...

Recently, Hermandez-Lamoneda et al. (2008) and independently Chameni and Andjiga (2008) gave an analytic formulation for all valued solutions to the n-person TU-games that satisfy linearity, efficiency and symmetry axioms. Our main purpose in this paper is to recast the proposed formulation to a...

Assuming a ‘spectrum’ or ordering of the players of a coalitional game, as in a political spectrum in a parliamentary situation, we consider a variation of the Shapley value in which coalitions may only be formed if they are connected with respect to the spectrum. This results in a naturally...

A longstanding criticism of the core is that it is too sensitive to small changes in player numbers, as in a well known example where one extra seller (resp. buyer) causes the entire surplus to go to the buyer's (seller's) side. We test this example in the lab, using several different trading...

First via a counter example it is shown that Proposition 3 of Anbarci and Sun (2013) is false. Then a gap and a mistake in their proof are identified. Finally, a modified version of their Proposition 3 is stated and proved.

An apex game consists of one apex player and a set of minor players. We identify two key properties of apex games and use them to introduce the class of general apex games. We derive players' preferences over winning coalitions by applying strongly monotonic power indices on such a game and all...

We ask how to share the cost of finitely many public goods (items) among users with different needs: some smaller subsets of items are enough to serve the needs of each user, yet the cost of all items must be covered, even if this entails inefficiently paying for redundant items. Typical...

We consider an extension of minimum cost spanning tree (mcst) problems in which some agents do not need to be connected to the source, but might reduce the cost of others to do so. Even if the cost usually cannot be computed in polynomial time, we extend the characterization of the Kar solution...

Users need to connect a pair of target nodes in the network. They share the fixed connection costs of the edge. The system manager elicits target pairs from users, builds the cheapest forest meeting all demands, and choose a cost sharing rule satisfying: