In this paper we consider standard fixed tree games, for which each vertex unequal to the root is inhabited by exactly one player. We present two weighted allocation rules, the weighted down-home allocation and the weighted neighbour-home allocation, both inspired by the painting story in...

We consider a situation in which a group of banks consider connecting their Automated Teller Machines (ATMs) in a network, so that the banks’ customers may use ATMs of any bank in the network. The problem studied is that of allocating the total transaction costs arising in the network, among...

The directional serial rule is introduced as a natural serial extension, generalizing the Moulin–Shenker cost sharing rule to heterogeneous cost sharing models. It is the unique regular rule compatible with the radial serial principle. In particular, this shows the incompatibility of the...

A new concept of consistency for cost sharing solutions is discussed, analyzed, and related to the homonymous and natural property within the rationing context. Main result is that the isomorphism in Moulin and Shenker (J Econ Theory 64:178–201, <CitationRef CitationID="CR18">1994</CitationRef>) pairs each additive and consistent...</citationref>

Total clan games are characterized using monotonicity, veto power of the clan members, and a concavity condition reflecting the decreasing marginal contribution of non-clan members to growing coalitions. This decreasing marginal contribution is incorporated in the notion of a bi-monotonic...

This paper considers a refinement of equilibria for multicriteria games based on the perfectness concept of Selten (1975). Existence of perfect equilibrium points is shown and several characterizations are provided. Furthermore, contrary to the result for equilibria for multicriteria games, an...

We extend the consistency principle for strategic games (Peleg and Tijs (1996)) to apply to solutions which assign to each game a collection of product sets of strategies. Such solutions turn out to satisfy desirable properties that solutions assigning to each game a collection of strategy...

In this paper we look at semi-infinite assignment problems. These are situations where a finite set of agents of one type has to be assigned to an infinite set of agents of another type. This has to be done in such a way that the total profit arising from these assignments is as large as...

Finite potential games are determined, i.e have Nash equilibria in pure strategies. In this paper we investigate the determinateness of potential games, in which one or more players have infinitely many pure strategies. Copyright Springer-Verlag Berlin Heidelberg 1998

The class of Construct and Charge (CC-) rules for minimum cost spanning tree (mcst) situations is considered. CC-rules are defined starting from the notion of charge systems, which specify particular allocation protocols rooted on the Kruskal algorithm for computing an mcst. These protocols can...