4 papers
Nucleolus Computation by Non-Zero-Constrained Optimization
Daniel Ebert, Antonia Ellerbrock
We extend the list of games where the nucleolus is computable in polynomial time. Based on the classical MPS scheme, nucleolus computation can be reduced to the problem of finding…
Nucleolus, Happy Nucleolus, and Vehicle Routing
Daniel Ebert, Antonia Ellerbrock
We study the recently introduced fair division concept of the happy nucleolus for cost allocation among players in a cooperative game, with special focus on its computation. The ha…
An Efficient Algorithm for Minimizing Ordered Norms in Fractional Load Balancing
Daniel Blankenburg, Antonia Ellerbrock, Thomas Kesselheim +1
We study the problem of minimizing an ordered norm of a load vector (indexed by a set of resources), where a finite number of customers contribute to the load of each r…
Cost Allocation for Set Covering: the Happy Nucleolus
Jannis Blauth, Antonia Ellerbrock, Vera Traub +1
We consider cost allocation for set covering problems. We allocate as much cost to the elements (players) as possible without violating the group rationality condition (no subset o…