1. Approximating min–max (regret) versions of some polynomial problems;Aissi,2006
2. Ranking sets of objects;Barbera,2004
3. On cost allocation for a spanning tree: A game theoretic approach;Bird;Networks,1976
4. Bogomolnaia, A., Moulin, H., 2008. Sharing the cost of a minimal cost spanning tree: Beyond the folk solution (mimeo, Rice University)
5. Voting Procedures;Brams,2002