Using a bi-choice graph technique (Klaus and Klijn, 2009), we show that a matching for a roommate market indirectly dominates another matching if and only if no blocking pair of the former is matched in the latter (Proposition 1). Using this characterization of indirect dominance, we investigate...

In this note we study uncertainty sequencing situations, i.e., 1-machine sequencing situations in which no initial order is specified. We associate cooperative games with these sequencing situations, study their core, and provide links with the classic sequencing games introduced by Curiel et...

Using a bi-choice graph technique (Klaus and Klijn, 2009), we show that a matching for a roommate market indirectly dominates another matching if and only if no blocking pair of the former is matched in the latter (Proposition 1). Using this characterization of indirect dominance, we investigate...

We show that for any roommate market the set of stochastically stable matchings coincides with the set of absorbing matchings. This implies that whenever the core is non-empty (e.g., for marriage markets), a matching is in the core if and only if it is stochastically stable, i.e., stochastic...

Using a bi-choice graph technique (Klaus and Klijn, 2009), we show that a matching for a roommate market indirectly dominates another matching if and only if no blocking pair of the former is matched in the latter (Proposition 1). Using this characterization of indirect dominance, we investigate...

Neighbour games arise from certain matching or sequencing situations in which only some specific pairs of players can obtain a positive gain. As a consequence, neighbour games are as well assignment games as line graph restricted games. We will show that the intersection of the class of...

In this paper we study a class of cooperative sequencing games that arise from one-machine sequencing situations in which chain precedence relations are imposed on the jobs. It is shown that these sequencing games are convex.

We consider the allocation of a finite number of indivisible objects to the same number of agents according to an exogenously given queue. We assume that the agents collaborate in order to achieve an efficient outcome for society. We allow for side-payments and provide a method for obtaining...

We study the location-inventory model as introduced by Teo et al. (2001) to analyze the impact of consolidation of distribution centers on facility and inventory costs. We extend their result on profitability of consolidation. We associate a cooperative game with each location-inventory...

We consider the allocation of a finite number of indivisible objects to the same number of agents according to an exogenously given queue. We assume that the agents collaborate in order to achieve an efficient outcome for society. We allow for side-payments and provide a method for obtaining...