Assignment problems where both sets of agents that have to be matched are countably infinite, the so-called infinite assignment problems, are studied as well as the related cooperative assignment games. Further, several solution concepts for these assignment games are studied. The first one is the utopia payoff for games with an infinite value. In this solution each player receives the maximal amount he can think of with respect to the underlying assignment problem. This solution is contained in the core of the game. Second, we study two solutions for assignment games with a finite value. Our main result is the existence of core-elements of these games, although they are hard to calculate. Therefore another solution, the f-strong ε-core is studied. This particular solution takes into account that due to organisational limitations it seems reasonable that only finite groups of agents will eventually protest against unfair proposals of profit distributions. The f-strong ε-core is shown to be nonempty.
|Number of pages||20|
|Publication status||Published - Dec 2004|
- Assignment problems
- Infinite programs
- Cooperative games