Minimum cost spanning tree (mcst) problems try to connect agents efficiently to a source when agents are located at different points in space and the cost of using an edge is fixed. We introduce a new cost sharing solution that always selects a point in the core and that is more responsive to...

We describe the construction and analysis of asymmetric Cost Sharing mechanisms, in which a variety of axioms are applied to subsets of the agents/goods. We show that the analysis can be quite subtle as apparently similar axiomatizations lead to significantly different results; in particular,...

This paper takes the idea of coalitional behavior – groups of people occasionally acting together to their mutual benefit – and incorporates it into the framework of evolutionary game theory that underpins the social learning literature. An equilibrium selection criterion is defined which we...

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

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

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.

In this paper, we provide three new characterizations of largeness of the core. The first characterization is based on minimal covers of the grand coalition and associated inequalities. The second characterization shows the relation between the bases that provide core elements of the game and...

This paper inspires from a real-life assignment problem faced by the Mexican Ministry of Public Education. We introduce a dynamic school choice problem that consists in assigning positions to overlapping generations of teachers. From one period to another, teachers can either retain their...

Sengupta and Sengupta (1996) study the accessibility of the core of a TU game and show that the core, if non-empty, can be reached from any non-core allocation via a finite sequence of successive blocks. This paper complements the result by showing that when the core is empty, a number of...

In 1985 Aumann axiomatized the Shapley NTU value by non-emptiness, efficiency, unanimity, scale covariance, conditional additivity, and independence of irrelevant alternatives. We show that, when replacing unanimity by “unanimity for the grand coalition” and translation covariance, these...