The concept of Berge equilibria is based on supportive behavior among the players: each player is supported by the group of all other players. In this paper, we extend this concept by maintaining the idea of supportive behavior among the players, but eliminating the underlying coordination...

This paper addresses interactive one-machine sequencing situations in which the costs of processing a job are given by an exponential function of its completion time. The main difference with the standard linear case is that the gain of switching two neighbors in a queue is time-dependent and...

This paper analyzes cooperative purchasing situations with two suppliers with limited supply capacity. In these capacity restricted cooperative purchasing (CRCP) situations we consider a group of cooperating purchasers for whom it turns out to be optimal as a group to or- der as much as possible...

This paper revisits the Alexia value, a recent solution concept for cooperative transferable utility games. We introduce the dual Alexia value and show that it coincides with the Alexia value for several classes of games. We demonstrate the importance of the notion of compromise stability for...

In this paper minimum coloring games are considered. We characterize the type of conflict graphs inducing simple or three-valued simple minimum coloring games. We provide an upper bound on the number of maximum cliques of conflict graphs inducing such games. Moreover, a characterization of the...

In this paper we introduce three-valued simple games as a natural extension of simple games. While simple games are used to evaluate single voting systems, three-valued simple games offer the opportunity for a simultaneous analysis of two different voting systems within the same parliamentary...

In this paper a new class of relaxed sequencing games is introduced: the class of Step out -- Step in sequencing games. In this relaxation any player within a coalition is allowed to step out from his position in the processing order and to step in at any position later in the processing order....

The core cover of a TU-game is a superset of the core and equals the convex hull of its larginal vectors. A larginal vector corresponds to an order of the players and describes the efficient payoff vector giving the first players in the order their utopia demand as long as it is still possible...

Proper equilibrium plays a prominent role in the literature on non-cooperative games. The underlying thought experiment is, however, unsatisfying, as it gives no justification for its fundamental idea that severe mistakes are made with a significantly smaller probability than innocuous ones. In...

This paper analyzes a single-machine scheduling problem with family setup times both from an optimization and a cost allocation perspective. In a so-called family sequencing situation jobs are processed on a single machine, there is an initial processing order on the jobs, and every job within a...