Are there any nicely structured preference profiles nearby?
暂无分享,去创建一个
Gerhard J. Woeginger | Robert Bredereck | Jiehua Chen | G. Woeginger | Robert Bredereck | Jiehua Chen
[1] Vicki Knoblauch,et al. Recognizing one-dimensional Euclidean preference profiles , 2010 .
[2] H. Young. Extending Condorcet's rule , 1977 .
[3] Edith Elkind,et al. On Detecting Nearly Structured Preference Profiles , 2014, AAAI.
[4] Hans Peters,et al. Strategy-proof division of a private good when preferences are single-dipped , 1997 .
[5] Piotr Faliszewski,et al. The shield that never was: Societies with single-peaked preferences are more open to manipulation and control , 2011, Inf. Comput..
[6] Ronald L. Rivest,et al. Introduction to Algorithms , 1990 .
[7] Piotr Faliszewski,et al. Recognizing 1-Euclidean Preferences: An Alternative Approach , 2014, SAGT.
[8] Arkadii M. Slinko,et al. Condorcet domains, median graphs and the single-crossing property , 2015, ArXiv.
[9] Michal Pilipczuk,et al. Parameterized Algorithms , 2015, Springer International Publishing.
[10] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[11] Arkadii M. Slinko,et al. Generalizing the Single-Crossing Property on Lines and Trees to Intermediate Preferences on Median Graphs , 2015, IJCAI.
[12] Piotr Faliszewski,et al. Clone structures in voters' preferences , 2011, EC '12.
[13] Hannu Nurmi,et al. Closeness Counts in Social Choice , 2008 .
[14] Bernard Monjardet,et al. Acyclic Domains of Linear Orders: A Survey , 2006, The Mathematics of Preference, Choice and Order.
[15] H. Moulin. On strategy-proofness and single peakedness , 1980 .
[16] K. Arrow. A Difficulty in the Concept of Social Welfare , 1950, Journal of Political Economy.
[17] Victor Reiner,et al. Acyclic sets of linear orders via the Bruhat orders , 2008, Soc. Choice Welf..
[18] T. Tideman,et al. Independence of clones as a criterion for voting rules , 1987 .
[19] Piotr Faliszewski,et al. Combinatorial voter control in elections , 2014, Theor. Comput. Sci..
[20] Piotr Faliszewski,et al. A characterization of the single-peaked single-crossing domain , 2014, AAAI.
[21] Piotr Faliszewski,et al. The complexity of manipulative attacks in nearly single-peaked electorates , 2014, Artif. Intell..
[22] C. Coombs. A theory of data. , 1965, Psychology Review.
[23] Gerhard J. Woeginger,et al. A characterization of the single-crossing domain , 2013, Soc. Choice Welf..
[24] Piotr Faliszewski,et al. The complexity of manipulative attacks in nearly single-peaked electorates , 2011, TARK XIII.
[25] Toby Walsh,et al. Uncertainty in Preference Elicitation and Aggregation , 2007, AAAI.
[26] Charles R. Johnson,et al. How Large are Transitive Simple Majority Domains , 1984 .
[27] Amartya Sen,et al. A Possibility Theorem on Majority Decisions , 1966 .
[28] Jörg Flum,et al. Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.
[29] Piotr Faliszewski,et al. Rationalizations of Condorcet-consistent rules via distances of hamming type , 2010, Soc. Choice Welf..
[30] P. Pattanaik,et al. Necessary and Sufficient Conditions for Rational Choice under Majority Decision , 1969 .
[31] Michael R. Fellows,et al. Fundamentals of Parameterized Complexity , 2013 .
[32] Gábor Erdélyi,et al. Computational Aspects of Nearly Single-Peaked Electorates , 2012, AAAI.
[33] Edith Hemaspaandra,et al. Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates , 2010, AAAI.
[34] Nadja Betzler,et al. On the Computation of Fully Proportional Representation , 2011, J. Artif. Intell. Res..
[35] Jérôme Lang,et al. Single-peaked consistency and its complexity , 2008, ECAI.
[36] J. Mirrlees. An Exploration in the Theory of Optimum Income Taxation an Exploration in the Theory of Optimum Income Taxation L Y 2 , 2022 .
[37] M. Trick,et al. Voting schemes for which it can be difficult to tell who won the election , 1989 .
[38] Faruk Gul,et al. Generalized Median Voter Schemes and Committees , 1993 .
[39] D. Black. On the Rationale of Group Decision-making , 1948, Journal of Political Economy.
[40] Piotr Faliszewski,et al. The complexity of fully proportional representation for single-crossing electorates , 2015, Theor. Comput. Sci..
[41] Craig Boutilier,et al. Multi-Dimensional Single-Peaked Consistency and Its Approximations , 2013, IJCAI.
[42] Nick Baigent. Metric rationalisation of social choice functions according to principles of social choice , 1987 .
[43] Michael R. Fellows,et al. Parameterized Complexity , 1998 .
[44] Rolf Niedermeier,et al. Invitation to Fixed-Parameter Algorithms , 2006 .
[45] Piotr Faliszewski,et al. Parameterized Algorithmics for Computational Social Choice: Nine Research Challenges , 2014, ArXiv.
[46] Olivier Spanjaard,et al. Kemeny Elections with Bounded Single-Peaked or Single-Crossing Width , 2013, IJCAI.
[47] Ken-ichi Inada. THE SIMPLE MAJORITY DECISION RULE , 1969 .
[48] Jörg Flum,et al. Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series) , 2006 .
[49] Kevin Roberts,et al. Voting over income tax schedules , 1977 .
[50] Ken-ichi Inada,et al. A Note on the Simple Majority Decision Rule , 1964 .
[51] Olivier Spanjaard,et al. Bounded Single-Peaked Width and Proportional Representation , 2012, ECAI.
[52] Guillaume Haeringer,et al. A characterization of the single-peaked domain , 2011, Soc. Choice Welf..
[53] Piotr Faliszewski,et al. The shield that never was: societies with single-peaked preferences are more open to manipulation and control , 2009, TARK '09.
[54] Jean-Claude Falmagne,et al. A Polynomial Time Algorithm for Unidimensional Unfolding Representations , 1994, J. Algorithms.
[55] Michael A. Trick,et al. Stable matching with preferences derived from a psychological model , 1986 .
[56] 室 章治郎. Michael R.Garey/David S.Johnson 著, "COMPUTERS AND INTRACTABILITY A guide to the Theory of NP-Completeness", FREEMAN, A5判変形判, 338+xii, \5,217, 1979 , 1980 .