This work deals with the weighted excesses of players in cooperative games which are obtained by summing up all the weighted excesses of all coalitions to which they belong. We first show that lexicographically minimizing the individual weighted excesses of players gives the same minimal...

This paper analyzes the allocation of the total toll collected in a highway among its segments. Based on different toll charging rules, we propose the Segments Equal Sharing method, the Exits Equal Sharing method, and the Entrances Equal Sharing method. We provide axioms and characterize these...

Cooperative games with a permission structure are useful tools for analyzing the impact of hierarchical structures on allocation problems in Economics and Operations Research. In this paper, we propose a generalization of the local disjunctive and the local conjunctive permission approaches...

In this paper, we analyze cost sharing problems arising from a general service by explicitly taking into account the generated revenues. To this cost-revenue sharing problem, we associate a cooperative game with transferable utility, called cost-revenue game. By considering cooperation among the...

In this paper, we introduce a new approach to measure the dissatisfaction for coalitions of players in cooperative transferable utility games. This is done by considering affine (and convex) combinations of the classical excess and the proportional excess. Based on this so-called alpha-excess,...

This paper considers one machine job scheduling situations or sequencing problems, where clients can have more than a single job to be processed in order to get a final output. Moreover, a job can be of interest for different players. This means that one of the main assumptions in classic...