This paper analyzes a single-machine scheduling problem with family setup times both from an optimization and a cost allocation perspective. In a family sequencing situation jobs are processed on a single machine, there is an initial processing order on the jobs, and every job within a family...

This paper focuses on two characterizations of convex interval games using the notions of superadditivity and exactness, respectively. We also relate big boss interval games with concave interval games and obtain characterizations of big boss interval games in terms of subadditivity and exactness.

Nash equilibria for strategic games were characterized by Peleg and Tijs (1996) as those solutions satisfying the properties of consistency, converse consistency and one-person rationality. <p> There are other solutions, like the -Nash equilibria, which enjoy nice properties and appear to be...</p>