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

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

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

In this paper, we analyze the cost allocation problem when a group of agents or nodes have to be connected to a source, and where the cost matrix describing the cost of connecting each pair of agents is not necessarily symmetric, thus extending the well-studied problem of minimum cost spanning...

Network formation games capture two conflicting objectives of selfish nodes in a network: such nodes wish to form a well-connected network and, at the same time, to minimize their cost of participation. We consider three families of such models where nodes avoid forming edges beyond those...

We study a stochastic model of influence where agents have “yes” or “no” inclinations on some issue, and opinions may change due to mutual influence among the agents. Each agent independently aggregates the opinions of the other agents and possibly herself. We study influence processes...

In many economic situations, a player pursues coordination or anti-coordination with her neighbors on a network, but she also has intrinsic preferences among the available options. We here introduce a model which allows to analyze this issue by means of a simple framework in which players...

What explains the large variation in the number of contacts (degree) that different participants of social networks have: age, randomness, or some unobservable fitness measure? To answer this question, I extend the model presented in Jackson and Rogers (2007) to allow individuals to vary in...