In this paper we look at semi-infinite assignment problems. These are situations where a finite set of agents of one type has to be assigned to an infinite set of agents of another type. This has to be done in such a way that the total profit arising from these assignments is as large as...

This paper studies information collecting (IC) situations with the help of cooperative game theory. Relations are established between IC situations and IC games on one hand and information sharing (IS) situations and IS games on the other hand. Further, it is shown that IC games are convex...

This paper studies information collecting (IC) situations with the help of cooperative game theory. Relations are established between IC situations and IC games on one hand and information sharing (IS) situations and IS games on the other hand. Further, it is shown that IC games are convex...

In this paper we look at semi-infinite assignment problems. These are situations where a finite set of agents of one type has to be assigned to an infinite set of agents of another type. This has to be done in such a way that the total profit arising from these assignments is as large as...

Three solution concepts for cooperative games with random payoffs are introduced. These are the marginal value, the dividend value and the selector value. Inspiration for their definitions comes from several equivalent formulations of the Shapley value for cooperative TU games. An example shows...