Previous allocation rules for network games, such as the Myerson Value, implicitly or explicitly take the network structure as fixed. In many situations, however, the network structure can be altered by players. This means that the value of alternative network structures (not just sub-networks)...

Previous allocation rules for network games, such as the Myerson Value, implicitly or explicitly take the network structure as fixed. In many situations, however, the network structure can be altered by players. This means that the value of alternative network structures (not just sub-networks)...

Many real-life applications of house allocation problems are dynamic. For example, inthe case of on-campus housing for college students, each year freshmen apply to move inand graduating seniors leave. Each student stays on campus for a few years only. A studentis a \newcomer" in the beginning...

Using an experimental approach, this paper examines how scarcity of natural resources affects people's readiness to cooperate and to engage in antisocial behaviour. The experiments were carried out with pastoralists from southern Namibia whose livelihoods are highly dependent on grazing...

Many real-life applications of house allocation problems are dynamic. For example, in the case of on-campus housing for college students, each year freshmen apply to move in and graduating seniors leave. Each student stays on campus for a few years only. A student is a newcomer in the beginning...

While most of the literature starting with Shapley and Scarf (1974) have considered a static exchange economy with indivisibilities, this paper studies the dynamics of such an economy. We find that both the dynamics generated by competitive equilibrium and the one generated by weakly dominance...

This paper deals with cost allocation problems arising from connection situations where edge costs are closed intervals of real numbers. To solve such problems, we extend classical solutions from the theory of minimum cost spanning tree games. We study the properties of such solutions and...

The analysis of single-valued solution concepts for coalitional games with transferable utilities has a long tradition. Opposed to most of this literature we will not deal with solution concepts that provide payoffs to the players for the grand coalition only, but we will analyze allocation...

Mechanisms that rely on course bidding are widely used at Business Schools in order to allocate seats at oversubscribed courses. Bids play two key roles under these mechanisms to infer student preferences and to determine who have bigger claims on course seats. We show that these two roles may...

This paper focuses on new characterizations of convex multi-choice games using the notions of exactness and superadditivity. Further- more, (level-increase) monotonic allocation schemes (limas) on the class of convex multi-choice games are introduced and studied. It turns out that each element...