For games with a non-empty core the Alexia value is introduced, a value which averages the lexicographic maxima of the core. It is seen that the Alexia value coincides with the Shapley value for convex games, and with the nucleolus for strongly compromise admissible games and big boss games. For...

<Para ID="Par1">In this paper sequencing situations with Just-in-Time (JiT) arrival are introduced. This new type of one-machine sequencing situations assumes that a job is available to be handled by the machine as soon as its predecessor is finished. A basic predecessor dependent set-up time is incorporated in...</para>

In this paper we present an axiomatic analysis of several ranking methods for general tournaments. We find that the ranking method obtained by applying maximum likelihood to the (Zermelo-)Bradley-Terry model, the most common method in statistics and psychology, is one of the ranking methods that...