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

This note introduces a new monotonicity property for sequencing situations. A sequencing rule is called drop out monotonic if no player will be worse off whenever one of the players decides to drop out of the queue before processing starts. This intuitively appealing property turns out to be...

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

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

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

Curiel, Potters, Prasad, Tijs and Veltman (1993) introduced component additive games which are cooperative TU games that arise by imposing an order on the player set. Further, they introduced the β-rule which allocates a core element to each component additive game. In this paper we consider...

Neighbor games arise from certain matching or sequencing situations in which only some specific pairs of players can obtain a positive gain. As a consequence, the class of neighbor games is the intersection of the class of assignment games (Shapley and Shubik (1972)) and the class of component...