We show that the Shapley–Shubik power index on the domain of simple (voting) games can be uniquely characterized without the efficiency axiom. In our axiomatization, the efficiency is replaced by the following weaker requirement that we term the gain-loss axiom: any gain in power by a player...

The study of coalition formation under uncertainty poses subtle questions regarding the appropriate definition of the core. In this paper a new core concept, the interim sequential core (ISC), is proposed as a solution concept to transferable utility games with uncertainty when binding...

Although simple games are very useful in modeling decision-making bodies, they allow each voter only two choices: to support or oppose a measure. This restriction ignores that voters often can abstain from voting, which is effectively different from the other two options. Following the approach...

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...

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...

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...

We explore in this paper the axiomatic approach to the problem of sharing the revenue from museum passes. We formalize two models for this problem on the grounds of two different informational bases. In both models, we provide axiomatic rationale for natural rules to solve the problem. We,...

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:

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.