Author:
Darmann Andreas,Klamler Christian,Pferschy Ulrich
Subject
Statistics, Probability and Uncertainty,General Psychology,General Social Sciences,Sociology and Political Science
Reference14 articles.
1. Approximating min–max (regret) versions of some polynomial problems;Aissi,2006
2. On cost allocation for a spanning tree: a game theoretic approach;Bird;Networks,1976
3. Sharing the cost of a minimal cost spanning tree: beyond the folk solution;Bogomolnaia;Games and Economic Behavior,2009
4. Approval Voting;Brams,1983
5. Voting procedures;Brams,2002
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. How hard is it to tell which is a Condorcet committee?;Mathematical Social Sciences;2013-11
2. POPULAR SPANNING TREES;International Journal of Foundations of Computer Science;2013-08
3. Committee selection under weight constraints;Mathematical Social Sciences;2012-07
4. Fair solutions for some multiagent optimization problems;Autonomous Agents and Multi-Agent Systems;2012-01-11
5. Finding socially best spanning trees;Theory and Decision;2010-09-10