1. Structure preserving reductions among convex optimization problems;Ausiello;J. Comput. System Sci.,1980
2. Y. Bleischwitz, B. Monien, F. Schoppmann, To be or not to be (served): cost sharing without indifferences, in: Preliminary version appeared in Proceedings of the 3rd International Workshop On Internet and Network Economics (WINE’07), 2010. Working paper.
3. The equal split-off set for cooperative games;Branzei,2006
4. Group-strategyproof cost sharing mechanisms for makespan and other scheduling problems;Brenner;Theoret. Comput. Sci.,2008
5. Cost allocation for a spanning tree;Claus;Networks,1973