Condorcet choice correspondences: A set-theoretical comparison
暂无分享,去创建一个
Jean-François Laslier | Michel Le Breton | Gilbert Laffond | M. Breton | Jean-François Laslier | Gilbert Laffond
[1] Bhaskar Dutta. Covering sets and a new condorcet choice correspondence , 1988 .
[2] T. Schwartz. Rationality and the Myth of the Maximum , 1972 .
[3] J. Banks. Sophisticated voting outcomes and agenda control , 1984 .
[4] L. Beineke,et al. Selected Topics in Graph Theory 2 , 1985 .
[5] J. Moon. Topics on tournaments , 1968 .
[6] M. Breton,et al. The Bipartisan Set of a Tournament Game , 1993 .
[7] Nicholas R. Miller. A New Solution Set for Tournaments and Majority Voting: Further Graph- Theoretical Approaches to the Theory of Voting , 1980 .
[8] Michel Breton,et al. Covering relations, closest orderings and hamiltonian bypaths in tournaments , 1991 .
[9] P. Fishburn. Condorcet Social Choice Functions , 1977 .
[10] David C. Mcgarvey. A THEOREMI ON THE CONSTRUCTION OF VOTING PARADOXES , 1953 .
[11] Jean-François Laslier,et al. The Copeland Measure of Condorcet Choice Functions , 1994, Discret. Appl. Math..
[12] J. Bermond. Ordres à distance minimum d'un tournoi et graphes partiels sans circuits maximaux , 1972 .
[13] Richard Edwin Stearns,et al. The Voting Problem , 1959 .
[14] P. Slater. Inconsistencies in a schedule of paired comparisons , 1961 .
[15] H. Moulin. Choosing from a tournament , 1986 .
[16] Thomas Schwartz. Cyclic tournaments and cooperative majority voting: A solution , 1990 .
[17] Jean-François Laslier,et al. More on the tournament equilibrium set , 1993 .