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

In this paper we introduce a new class of OR games: economic lot-sizing (ELS) games. There are a number of retailers that have a known demand for a fixed number of periods. To satisfy demand the retailers order products at the same manufacturer. By placing joint orders instead of individual...

This paper considers one machine job scheduling situations or sequencing problems, where clients can have more than a single job to be processed in order to get a final output. Moreover, a job can be of interest for different players. This means that one of the main assumptions in classic...

This paper introduces cooperative games arising from multi-depot Chinese postman problems and explores the properties of these games. A multi-depot Chinese postman problem (MDCP) is represented by a connected (di)graph G, a set of k depots that is a subset of the vertices of G, and a...

This paper considers situations characterized by a common-pool resource, which needs to be divided among agents. Each of the agents has some claim on this pool and an individual reward function for assigned resources. This paper analyzes not only the problem of maximizing the total joint reward,...

This paper analyses Chinese postman games with repeated players, which generalize Chinese postman games by dropping the one-to-one relation between edges and players. In our model, we allow players to own more than one edge, but each edge belongs to at most one player. The one-to-one relation...

We present a simple proof of the balancedness of permutation games. In the proof we use the existence of envy-free allocations in economies with indivisible objects, quasi-linear utility functions, and an amount of money

For the class of minimum coloring games (introduced by Deng et al. (1999)) we investigate the existence of population monotonic allocation schemes (introduced by Sprumont (1990)). We show that a minimum coloring game on a graph G has a population monotonic allocation scheme if and only if G is...