Minimal extending sets in tournaments
暂无分享,去创建一个
[1] Thomas Schwartz. Cyclic tournaments and cooperative majority voting: A solution , 1990 .
[2] Felix Brandt,et al. Bounds on the disparity and separation of tournament solutions , 2015, Discret. Appl. Math..
[3] Erkut Y. Ozbay,et al. Revealed Attention , 2009 .
[4] M. Breton,et al. The Bipartisan Set of a Tournament Game , 1993 .
[5] Ayzerman,et al. Theory of choice , 1995 .
[6] Jean-François Laslier,et al. Tournament Solutions And Majority Voting , 1997 .
[7] Noga Alon,et al. Ranking Tournaments , 2006, SIAM J. Discret. Math..
[8] Felix Brandt,et al. A tournament of order 24 with two disjoint TEQ-retentive sets , 2013, ArXiv.
[9] Bernard Monjardet. Statement of precedence and a comment on IIA terminology , 2008, Games Econ. Behav..
[10] H. Moulin. Choosing from a tournament , 1986 .
[11] Paul D. Seymour,et al. A counterexample to a conjecture of Schwartz , 2013, Soc. Choice Welf..
[12] Felix Brandt,et al. Characterization of dominance relations in finite coalitional games , 2010 .
[13] J. Banks. Sophisticated voting outcomes and agenda control , 1984 .
[14] Jennifer Ryan,et al. Tournament games and positive tournaments , 1995, J. Graph Theory.
[15] Felix A. Fischer,et al. A computational analysis of the tournament equilibrium set , 2008, Soc. Choice Welf..
[16] Jeffrey Richelson. Some Further Results on Consistency, Rationality and Collective Choice , 1978 .
[17] Jörg Rothe,et al. The Complexity of Computing Minimal Unidirectional Covering Sets , 2009, Theory of Computing Systems.
[18] Bhaskar Dutta. Covering sets and a new condorcet choice correspondence , 1988 .
[19] Felix Brandt,et al. Minimal stable sets in tournaments , 2008, J. Econ. Theory.
[20] Paul E. Dunne,et al. Computational properties of argument systems satisfying graph-theoretic constraints , 2007, Artif. Intell..
[21] K. Arrow,et al. Social Choice and Multicriterion Decision-Making , 1986 .
[22] H. Chernoff. Rational Selection of Decision Functions , 1954 .
[23] Felix A. Fischer,et al. Computing the minimal covering set , 2008, Math. Soc. Sci..
[24] John Duggan,et al. Dutta's Minimal Covering Set and Shapley's Saddles , 1996 .
[25] Felix Brandt,et al. Group-Strategyproof Irresolute Social Choice Functions , 2010, IJCAI.
[26] Felix A. Fischer,et al. Possible and necessary winners of partial tournaments , 2012, AAMAS.
[27] Felix Brandt,et al. Set-monotonicity implies Kelly-strategyproofness , 2010, Soc. Choice Welf..
[28] Brendan D. McKay,et al. Practical graph isomorphism, II , 2013, J. Symb. Comput..
[29] F. Brandt,et al. Computational Social Choice: Prospects and Challenges , 2011, FET.
[30] Felix Brandt,et al. Tournament Solutions , 2016, Handbook of Computational Social Choice.
[31] Piotr Faliszewski,et al. Llull and Copeland Voting Computationally Resist Bribery and Constructive Control , 2009, J. Artif. Intell. Res..
[32] Felix Brandt,et al. Tournament Solutions Extensions of Maximality and their Applications to Decision-Making , 2009 .
[33] Felix Brandt,et al. On the Fixed-Parameter Tractability of Composition-Consistent Tournament Solutions , 2011, IJCAI.
[34] Felix Brandt,et al. Set-rationalizable choice and self-stability , 2009, J. Econ. Theory.
[35] Olivier Hudry. A note on “Banks winners in tournaments are difficult to recognize” by G. J. Woeginger , 2004, Soc. Choice Welf..
[36] Thierry Marchant,et al. AND DECISION MODELS : Stepping stones for the analyst , 2003 .
[37] Gerhard J. Woeginger,et al. Banks winners in tournaments are difficult to recognize , 2003, Soc. Choice Welf..
[38] Thierry Marchant,et al. Evaluation and Decision Models with Multiple Criteria: Stepping Stones for the Analyst , 2006 .
[39] Felix A. Fischer,et al. Minimal retentive sets in tournaments , 2010, AAMAS.