On equitable approaches to resource allocation problems: the conditional minimax solutions

In this paper we introduce and analyze a solution concept of the conditional minimax as a generalization of the minimax solution concept extended to take into account the number of services (the portion of demand) related to the worst performances. Namely, for a specified portion of demand we take into account the corresponding portion of the maximum results and we consider their average as the worst conditional mean to be minimized. We show that, similar to the standard minimax approach, the minimization of the worst conditional mean can be defined by a linear objective and a number of auxiliary linear inequalities. We report some results of initial computational experience with the new solution concept.