Assignment problems where both sets of agents are countably infinite, the so-called infinite assignment problems, are studied as well as the related assignment games. Further, two solutions for these games are studied. The first one is the approximate f-core for games with a finite value. This particular solution takes into account that due to organisational limitations only finite groups of agents can protest against proposals of profit distributions. Second, we study the utopia payoff, the perfect proposal in which each agent receives the maximal amount he can get.
|Name||Memorandum faculteit TW|
|Publisher||Department of Applied Mathematics, University of Twente|