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

We study the relation between the fuzzy core and balancedness for fuzzy games. For regular games, this relation has been studied by Bondareva (Problemy Kibernet 10:119–139, <CitationRef CitationID="CR4">1963</CitationRef>) and Shapley (Naval Res Logist Q 14: 453–460, <CitationRef CitationID="CR11">1967</CitationRef>). First, we gain insight in this relation when we analyse...</citationref></citationref>

Pareto equilibria in multicriteria games can be computed as the Nash equilibria of scalarized games, obtained by assigning weights to the separate criteria of a player. To analysts, these weights are usually unknown. This paper therefore proposes ideal equilibria, strategy profiles that are...

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

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

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