Convex games with countable number of players and sequencing situations

In this paper we study convex games with an infinite countable set of agents and provide characterizations of this class of games. To do so, and in order to overcome some shortcomings related to the difficulty of dealing with infinite orderings, we need to use a continuity property. Infinite sequencing situations where the number of jobs is infinite countable can be related to convex cooperative TU games. It is shown that some allocations turn out to be extreme points of the core of an infinite sequencing game.