Many cooperative games, especially ones stemming from resource pooling in queuing or inventory systems, are based on situations in which each player is associated with a single attribute (a real number representing, say, a demand) and in which the cost to optimally serve any sum of attributes is...

In a deposit game coalitions are formed by players combining their capital. The proceeds of their investments then have to be divided among those players. The current model extends earlier work on capital deposits by allowing reinvestment of returns. Two specific subclasses of deposit games are...

This paper provides an overview of the various shapes the bestreply multifunctions can take in 2x2x2 trimatrix games. It is shown that, unlike in 2x2 bimatrix games, the best replies to the opponents pure strategies do not completely determine the structure of the Nash equilibrium set

In this paper we introduce and analyze the procedural egalitarian solution for transferable utility games. This new concept is based on the result of a coalitional bargaining procedure in which egalitarian considerations play a central role. The procedural egalitarian solution is the first...

We analyze clearing mechanisms in financial networks in which agents may have both monetary individual assets and mutual liabilities. A clearing mechanism prescribes mutual payments between agents to settle their mutual liabilities. The corresponding payments, summarized in a payment matrix, are...

Supply chain collaboration has the potential to address issues of inefficiency and lack of coordination that often drives down the competitiveness of supply chains. However, collaboration in supply chains is difficult due to ever increasing complexity and conflicting objectives prevalent in...

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

This paper introduces a new class of interactive cooperative purchasing situations and provides an explicit alternative characterization of the nucleolus of cooperative games, which offers an alternative to Kohlberg (1971). In our cooperative purchasing situation, the unit price of a commodity...

In a resource allocation problem there is a common-pool resource, which has to be divided among agents. Each agent is characterized by a claim on this pool and an individual concave reward function on assigned resources. An assignment of resources is optimal if the total joint reward is...