Skip to main content Accessibility help
×
Home
  • Print publication year: 2016
  • Online publication date: May 2016

References

Abdulkadiroğlu, A. 2013. School Choice. In Oxford Handbook of Market Design, 138-169. New York: Oxford University Press.
Abdulkadiroğlu, A. and Sönmez, T. 1998. Random Serial Dictatorship and the Core from Random Endowments in House Allocation Problems. Econometrica, 66(3), 689-701.
Abdulkadiroğlu, A. and Sönmez, T. 1999. House Allocation with Existing Tenants. Journal of Economic Theory, 88, 233-260.
Abdulkadiroğlu, A. and Sönmez, T. 2003. School Choice: A Mechanism Design Approach. American Economic Review, 93(3), 729-747.
Abdulkadiroğlu, A.Pathak, P. A., Roth, A. E., and Sönmez, T. 2005a. The Boston Public School Match. American Economic Review, 95(2), 368-371.
Abdulkadiroğlu, A., Pathak, P. A., and Roth, A. E. 2005b. The New York City High School Match. American Economic Review, 95(2), 364-367.
Abraham, D. J., Cechlárová, K., Manlove, D. R, and Mehlhorn, K. 2004. Pareto Optimality in House Allocation Problems. In Proceedings of the 15th Annual International Symposium on Algorithms and Computation (ISAAC), 3-15. New York: Springer.
Abraham, D. J., Blum, A., and Sandholm, T. 2007a. Clearing Algorithms for Barter Exchange Markets: Enabling Nationwide Kidney Exchanges. In Proceedings of the 8th ACM Conference on Electronic Commerce (EC), 295-304. New York: ACM.
Abraham, D. J., Irving, R. W., Kavitha, T., and Mehlhorn, K. 2007b. Popular Matchings. SIAM Journal on Computing, 37, 1030-1045.
Ackermann, H., Goldberg, P. W., Mirrokni, V. S., Roglin, H., and Vocking, B. 2011. Uncoordinated Two-Sided Matching Markets. SIAM Journal on Computing, 40(1), 92-106.
Aharoni, R. and Fleiner, T. 2003. On a Lemma of Scarf. Journal of Combinatorial Theory, Series B, 87, 72-80.
Ahn, D. S. and Oliveros, S. 2012. Combinatorial Voting. Econometrica, 80(1), 89-141.
Ailon, N., Charikar, M., and Newman, A. 2005. Aggregating Inconsistent Information: Ranking and Clustering. In Proceedings of the 37th ACM Symposium on Theory of Computing (STOC), 684-693. New York: ACM.
Ailon, N., Charikar, M., and Newman, A. 2008. Aggregating Inconsistent Information: Ranking and Clustering. Journal of the ACM, 55(5), 1-27.
Airiau, S. and Endriss, U. 2009. Iterated Majority Voting. In Proceedings of the 1st International Conference on Algorithmic Decision Theory (ADT), 38-49. New York: Springer.
Airiau, S., Endriss, U., Grandi, U., Porello, D., and Uckelman, J. 2011. Aggregating Dependency Graphs into Voting Agendas in Multi-issue Elections. In Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI), 18-23. Palo Alto, CA: AAAI.
Aizerman, M. and Aleskerov, F. 1995. Theory of Choice.Amsterdam: North-Holland.
Alcalde, J. and Barberà, S. 1994. Top Dominance and the Possibility of Strategy-Proof Stable Solutions to Matching Problems. Economic Theory, 4(3), 417-35.
Alcalde, J. and Revilla, P. 2004. Researching with Whom? Stability and Manipulation. Journal of Mathematical Economics, 40(8), 869-887.
Aleskerov, F. and Kurbanov, E. 1999. Degree of Manipulability of Social Choice Procedures. In Current Trends in Economics: Studies in Economic Theory Volume 8, 13-27. New York: Springer.
Ali, A. and Meilă, M. 2012. Experiments with Kemeny Ranking: What Works When?Mathematical Social Sciences, 64(1), 28-40.
Alkan, A., Demange, G., and Gale, D. 1991. Fair Allocation of Indivisible Goods and Criteria of Justice. Econometrica, 59(4), 1023-1039.
Alon, N. 1987. Splitting Necklaces. Advances in Mathematics, 63, 241-253.
Alon, N. 2006. Ranking Tournaments. SIAM Journal on Discrete Mathematics, 20(1), 137-142.
Alon, N. and Spencer, J. 2008. The Probabilistic Method. 3rd ed. New York: John Wiley.
Alon, N., Fischer, F. A., Procaccia, A. D., and Tennenholtz, M. 2011. Sum of Us: Strategyproof Selection from the Selectors. In Proceedings of the Conference on Theoretical Aspects of Rationality and Knowledge (TARK), 101-110. New York: ACM.
Alon, N., Falik, D., Meir, R., and Tennenholtz, M. 2013. Bundling Attacks in Judgment Aggregation. In Proceedings of the 27th AAAI Conference on Artificial Intelligence, 39-45. Palo Alto, CA: AAAI.
Alonso-Meijide, J. M., Freixas, J., and Molinero, X. 2012. Computation of Several Power Indices by Generating Functions. Applied Mathematics and Computation, 219(8), 3395-3402.
Altman, A. and Tennenholtz, M. 2005. Ranking Systems: The Pagerank Axioms. In Proceedings of the 6th ACM Conference on Electronic Commerce (EC), 1-8. New York: ACM.
Altman, A. and Tennenholtz, M. 2006. Quantifying Incentive Compatibility of Ranking Systems. In Proceedings of the 21st National Conference on Artificial Intelligence (AAAI), 586-591. Palo Alto, CA: AAAI.
Altman, A. and Tennenholtz, M. 2007. Incentive Compatible Ranking Systems. In Proceedings of the 6th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 546-553. IFAAMAS.
Altman, A. and Tennenholtz, M. 2008. Axiomatic Foundations for Ranking Systems. Journal of Artificial Intelligence Research (JAIR), 31, 473-495.
Altman, A. and Tennenholtz, M. 2010. An Axiomatic Approach to Personalized Ranking Systems. Journal of the ACM, 57(4), 1-35.
Altman, A., Procaccia, A. D., and Tennenholtz, M. 2009. Nonmanipulable Selections from a Tournament. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), 27-32. Palo Alto: AAAI.
Ambos-Spies, K. 1986. Randomness, Relativization, and Polynomial Reducibilities. Proceedings of the 1st Structure in Complexity Theory Conference, 23-34. New York: Springer.
Amer-Yahia, S., Roy, S. B., Chawlat, A., Das, G., and Yu, C. 2009. Group Recommendation: Semantics and Efficiency. Proceedings of the VLDB Endowment, 2(1), 754-765.
Andersen, R., Borgs, C, Chayes, J., Feige, U., Flaxman, A., Kalai, A., Mirrokni, V., and Tennenholtz, M. 2008. Trust-Based Recommendation Systems: An Axiomatic Approach. In Proceedings of the 17th International Conference on the World Wide Web, 199-208. New York: ACM.
Ángel Ballester, M. and Rey-Biel, P. 2009. Does Uncertainty Lead to Sincerity? Simple and Complex Voting Mechanisms. Social Choice and Welfare, 33(3), 477-494.
Anshelevich, E., Dasgupta, A., Kleinberg, J. M., Tardos, É., Wexler, T., and Roughgarden, T. 2004. The Price of Stability for Network Design with Fair Cost Allocation. In Proceedings of the 45th Annual Symposium on Foundations of Computer Science (FOCS), 295-304. New York: IEEE.
Apesteguia, J., Ballester, M. A., and Masatlioglu, Y. 2014. A Foundation for Strategic Agenda Voting. Games and Economic Behavior, 87, 91-99.
Arora, S. and Barak, B. 2009. Computational Complexity: A Modern Approach.Cambridge: Cambridge University Press.
Arrow, K. J. 1950. A Difficulty in the Concept of Social Welfare. Journal of Political Economy, 58, 328-346.
Arrow, K. J. 1951. Social Choice and Individual Values, lsted.New Haven, CT: Cowles Foundation.
Arrow, K. J. 1963. Social Choice and Individual Values. 2nd ed. New York: John Wiley.
Arrow, K. J. and Raynaud, H. 1986. Social Choice and Multicriterion Decision-Making. Cambridge, MA: MIT Press.
Arrow, K. J., Sen, A. K., and Suzumura, K., eds. 2002. Handbook of Social Choice and Welfare. Vol. 1. Amsterdam: North-Holland.
Arrow, K. J., Sen, A. K., and Suzumura, K., eds. 2010. Handbook of Social Choice and Welfare. Vol. 2. Amsterdam: North-Holland.
Arzi, O., Aumann, Y, and Dombb, Y 2011. Throw One's Cake—and Eatlt Too.In Proceedings of the 4th International Symposium on Algorithmic Game Theory (SAGT), 69-80. New York: Springer.
Asadpour, A. and Saberi, A. 2010. An Approximation Algorithm for Max-min Fair Allocation of Indivisible Goods. SI AM Journal on Computing, 39(7), 2970-2989.
Ashlagi, I. and Roth, A. E. 2012. New Challenges in Multihospital Kidney Exchange. American Economic Review, 102(3), 354-359.
Ashlagi, I., Braverman, M., and Hassidim, A. 2014. Stability in Large Matching Markets with Complementarities. Operations Research, 62(4), 713-732.
Aumann, Y and Dombb, Y 2010. The Efficiency of Fair Division with Connected Pieces. In Proceedings of the 6th International Conference on Web and Internet Economics (WINE), 26-37. New York: Springer.
Aumann, R. J. and Maschler, M. 1985. Game Theoretic Analysis of a Bankruptcy Problem from the Talmud. Journal of Economic Theory, 36(2), 195-213.
Aumann, Y, Dombb, Y, and Hassidim, A. 2013. Computing Socially-Efficient Cake Divisions. In Proceedings of the 12th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 343-350. Richland, SC: IFAAMAS.
Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V, Marchetti-Spaccamela, A., and Protasi, M. 1999. Complexity and Approximation: Combinatorial Optimization Problems and their Approximability Properties.New York: Springer.
Austen-Banks, D. and Smith, J. S. 1994. Information Aggregation, Rationality, and the Condorcet Jury Theorem. American Political Science Review, 90(1), 34-45.
Austen-Smith, D. and Banks, J. S. 2000. Positive Political Theory I: Collective Preference.Ann Arbor: University of Michigan Press.
Austen-Smith, D. and Banks, J. S. 2005. Positive Political Theory II: Strategy and Structure.Ann Arbor: University of Michigan Press.
Aziz, H. 2013. Stable Marriage and Roommate Problems with Individual-Based stability. In Proceedings of the 12th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 287-294. Richland, SC: IFAAMAS.
Aziz, H. 2014. A Note on the Undercut Procedure. In Proceedings of the 13th International Con-ference on Autonomous Agents and Multiagent Systems (AAMAS), 1361-1362. Richland, SC: IFAAMAS.
Aziz, H. and Brandl, R 2012. Existence of Stability in Hedonic Coalition Formation Games. In Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 763-770. Richland, SC: IFAAMAS.
Aziz, H. and de Keijzer, B. 2011. Complexity of Coalition Structure Generation. In Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 191-198. Richland, SC: IFAAMAS.
Aziz, H. and Mestre, J. 2014. Parametrized Algorithms for Random Serial Dictatorship. Mathematical Social Sciences, 72, 1-6.
Aziz, H. and Stursberg, P. 2014. A Generalization of Probabilistic Serial to Randomized Social Choice. In Proceedings of the 28th AAAI Conference on Artificial Intelligence, 559-565. Palo Alto, CA: AAAI.
Aziz, H. and Ye, C. 2014. Cake Cutting Algorithms for Piecewise Constant and Piecewise Uniform Valuations. In Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 1-14. New York: Springer.
Aziz, H., Bachrach, Y, Elkind, E., and Paterson, M. S. 2011. False-Name Manipulations in Weighted Voting Games. Journal of Artificial Intelligence Research (JAIR), 40, 57-93.
Aziz, H., Harrenstein, P., and Pyrga, E. 2012a. Individual-Based Stability in Hedonic Games Depending on the Best or Worst Players. In Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 1311-1312. Richland, SC: IFAAMAS.
Aziz, H., Brill, M., Fischer, E, Harrenstein, P., Lang, J., and Seedig, H. G. 2012b. Possible and Necessary Winners of Partial Tournaments. In Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 585-592. Richland, SC: IFAAMAS.
Aziz, H., Brandt, E, and Brill, M. 2013a. The Computational Complexity of Random Serial Dictatorship. Economics Letters, 121(3), 341-345.
Aziz, H., Brandt, E, and Seedig, H. G. 2013b. Computing Desirable Partitions in Additively Separable Hedonic Games. Artificial Intelligence, 195, 316-334.
Aziz, H., Brandt, E, and Stursberg, P. 2013c. On Popular Random Assignments. In Proceedings of the 6th International Symposium on Algorithmic Game Theory (SAGT), 183-194. New York: Springer.
Aziz, H., Brandt, E, and Brill, M. 2013d. On the Tradeoff between Economic Efficiency and Strategyproofness in Randomized Social Choice. In Proceedings of the 12th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 455-462. Richland, SC: IFAAMAS.
Aziz, H., Brandt, E, and Harrenstein, P. 2013e. Pareto Optimality in Coalition Formation.Games and Economic Behavior, 82, 562-581.
Aziz, H., Gaspers, S., Mattei, N., Narodytska, N., and Walsh, T. 2013f. Ties Matter: Complexity of Manipulation when Tie-breaking with a Random Vote. In Proceedings of the 27th AAAI Conference on Artificial Intelligence, 74-80. New York: AAAI.
Aziz, H., Harrenstein, P., Lang, J., and Wooldridge, M. 2014a. Boolean Hedonic Games. In Proceedings of the 11th Conference of Logic and the Foundations of Game and Decision Theory (LOFT).
Aziz, H., Brandt, E, and Harrenstein, P. 2014b. Fractional Hedonic Games. In Proceedings of the 13th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 5-12. Richland, SC: IFAAMAS.
Aziz, H., Brandl, E, and Brandt, E 2014c. On the Incompatibility of Efficiency and Strategyproofness in Randomized Social Choice. In Proceedings of the 28th AAAI Conference on Artificial Intelligence, 545-551. New York: AAAI.
Aziz, H., Gaspers, S., Mackenzie, S., and Walsh, T. 2014d. Fair Assignment of Indivisible Objects Under Ordinal Preferences. In Proceedings of the 13 th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 1305-1312. Richland, SC: IFAAMAS.
Aziz, H., Gaspers, S., Mackenzie, S., and Mattei, N. 2014e. Fixing a Balanced Knockout Tournament. In Proceedings of the 28th AAAI Conference on Artificial Intelligence (AAAI), 552-558. Palo Alto, CA: AAAI.
Babaioff, M., Dobzinski, S., Oren, S., and Zohar, A. 2012. On Bitcoin and Red Balloons. In Proceedings of the 13th ACM Conference on Electronic Commerce (EC), 56-73. New York: ACM.
Bacchus, R and Grove, A. 1995. Graphical Models for Preference and Utility. In Proceedings of the Conference on Uncertainty in Artificial Intelligence (UAI), 3-10. New York: Morgan Kaufmann.
Bachmeier, G., Brandt, R, Geist, C, Harrenstein, P., Kardel, K., and Seedig, H. G. 2014. k-Majority Digraphs and the Hardness of Voting with a Constant Number of Voters. Working paper.
Bachrach, Y and Shah, N. 2013. Reliability Weighted Voting Games. In Proceedings of the 6th International Symposium on Algorithmic Game Theory (SAGT), 38-49. New York: Springer.
Bachrach, Y, Markakis, E., Resnick, E., Procaccia, A. D., Rosenschein, J. S., and Saberi, A. 2010a. Approximating Power Indices: Theoretical and Empirical Analysis. Autonomous Agents and Multi-Agent Systems, 20(2), 105-122.
Bachrach, Y, Betzler, N., and Paliszewski, P. 2010b. Probabilistic Possible Winner Determination. In Proceedings of the AAAI Conference on Artificial Intelligence, 697-702. Palo Alto, CA: AAAI.
Bachrach, Y, Elkind, E., and Paliszewski, P. 2011. Coalitional Voting Manipulation: A Game-Theoretic Perspective. In Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI), 49-54. Palo Alto, CA: AAAI.
Baharad, E., Koppel, M., Goldberger, J., and Nitzan, S. 2011. Distilling the Wisdom of Crowds: Weighted Aggregation of Decisions on Multiple Issues. Journal of Autonomous Agents and Multi-Agent Systems, 22, 31-42.
Baharad, E., Koppel, M., Goldberger, J., and Nitzan, S. 2012. Beyond Condorcet: Optimal Judgment Aggregation Using Voting Records. Theory and Decision, 72, 113-130.
Baigent, N. 1987. Metric Rationalisation of Social Choice Punctions According to Principles of Social Choice. Mathematical Social Sciences, 13(1), 59-65.
Baïou, M. and Balinski, M. 2000. Many-To-Many Matching: Stable Polyandrous Polygamy (or Polygamous Polyandry). Discrete Applied Mathematics, 101, 1-12.
Bakos, Y and Dellarocas, C. N. 2003. Cooperation without Enforcement? A Comparative Analysis of Litigation and Online Reputation as Quality Assurance Mechanisms. MIT Sloan School of Management Working Paper No. 4295-03.
Baldiga, K. A. and Green, J. R. 2013. Assent-Maximizing Social Choice. Social Choice and Welfare, 40(2), 439-460.
Baldwin, J. M. 1926. The Technique of the Nanson Preferential Majority System of Election. Transactions and Proceedings of the Royal Society of Victoria, 39, 42-52.
Balinski, M. L. and Demange, G. 1989. Algorithms for Proportional Matrices in Reals and Integers. Mathematical Programming, 45(1-3), 193-210.
Balinski, M. L. and Laraki, R. 2010. Majority Judgment: Measuring, Ranking, and Electing. Cambridge, MA: MIT Press.
Balinski, M. L. and Sönmez, T. 1999. A Tale of Two Mechanisms: Student Placement. Journal of Economic Theory, 84(1), 73-94.
Balkanski, E., Brânzei, S., Kurokawa, D., and Procaccia, A. D. 2014. Simultaneous Cake Cutting. In Proceedings of the 28th AAAI Conference on Artificial Intelligence, 566-572. Palo Alto, CA: AAAI.
Ballester, C. 2004. NP-Completeness in Hedonic Games. Games and Economic Behavior, 49(1), 1-30.
Banerjee, S., Konishi, PL, and Sönmez, T. 2001. Core in a Simple Coalition Pormation Game. Social Choice and Welfare, 18, 135-153.
Banks, J. S. 1985. Sophisticated Voting Outcomes and Agenda Control. Social Choice and Welfare, 1(4), 295-306.
Banks, J. S. and Bordes, G. A. 1988. Voting Games, Indifference, and Consistent Sequential Choice Rules. Social Choice and Welfare, 5, 31-44.
Banks, J. S., Duggan, J., and Le Breton, M. 2006. Social Choice and Electoral Competition in the General Spatial Model. Journal of Economic Theory, 126, 194—234.
Bansal, N. and Sviridenko, M. 2006. The Santa Claus problem. In Proceedings of the 38th ACM Symposium on Theory of Computing (STOC), 31-40. New York: ACM.
Bansal, V., Agrawal, A., and Malhotra, V. S. 2007. Polynomial Time Algorithm for an Optimal Stable Assignment with Multiple Partners. Theoretical Computer Science, 379(3), 317-328.
Banzhaf, J. R 1965. Weighted Voting Doesn't Work: A Mathematical Analysis. Rutgers Law Review, 19,317-343.
Baral, C, Kraus, S., Minker, J., and Subrahmanian, V S. 1992. Combining Knowledge Bases Consisting of First-Order Theories. Computational Intelligence, 8(1), 45-71.
Barbanel, J. B. 2005. The Geometry of Efficient Fair Division. New York: Cambridge University Press.
Barberà, S. 1979. Majority and Positional Voting in a Probabilistic Framework. Review of Economic Studies, 46(2), 379-389.
Barberà, S. 2011. Strategyproof Social Choice. Handbook of Social Choice and Welfare, 2, 731-831.
Barberà, S. and Gerber, A. 2007. A Note on the Impossibility of a Satisfactory Concept of Stability for Coalition Formation Games. Economic Letters, 95, 85-90.
Barberà, S. and Peleg, B. 1990. Strategy-Proof Voting Schemes with Continuous Preferences. Social Choice and Welfare, 7, 31-38.
Barberà, S., Sonnenschein, H., and Zhou, L. 1991. Voting by Committees. Econometrica, 59(3), 595-609.
Barberà, S., Gul, R, and Stacchetti, E. 1993. Generalized Median Voter Schemes and Committees. Journal of Economic Theory, 61(2), 262-289.
Barberà, S., Dutta, B., and Sen, A. 2001. Strategy-Proof Social Choice Correspondences. Journal of Economic Theory, 101(2), 374-394.
Barberà, S., Bossert, W., and Pattanaik, P. K. 2004. Ranking Sets of Objects. In Handbook of Utility Theory, Vol. II: Extensions, 893-977. New York: Kluwer Academic.
Barthelemy, J. P. and Monjardet, B. 1981. The Median Procedure in Cluster Analysis and Social Choice Theory. Mathematical Social Sciences, 1, 235-267.
Bartholdi, J. and Orlin, J. B. 1991. Single Transferable Vote Resists Strategic Voting. Social Choice and Welfare, 8(4), 341-354.
Bartholdi, J., Tovey, C, and Trick, M. 1989a. The Computational Difficulty of Manipulating an Election. Social Choice Welfare, 6, 227-241.
Bartholdi, J., Tovey, C, and Trick, M. 1989b. Voting Schemes for Which it Can Be Difficult to Tell Who Won the Election. Social Choice and Welfare, 6(2), 157-165.
Bartholdi, J., Tovey, C, and Trick, M. 1992. How Hard Is It to Control an Election? Mathematical and Computer Modeling, 16(8/9), 27-40.
Bauer, E. and Kohavi, R. 1999. An Empirical Comparison of Voting Classification Algorithms: Bagging, Boosting, and Variants. Machine Learning, 36(1-2), 105-139.
Baumeister, D. and Rothe, J. 2010. Taking the Final Step to a Full Dichotomy of the Possible Winner Problem in Pure Scoring Rules. In Proceedings of the 19th European Conference on Artificial Intelligence (ECAI), 1019-1020. Amsterdam: IOS.
Baumeister, D. and Rothe, J. 2012. Taking the Final Step to a Full Dichotomy of the Possible Winner Problem in Pure Scoring Rules. Information Processing Letters, 112(5), 186-190.
Baumeister, D. and Rothe, J. 2015. Preference Aggregation by Voting. In Economics and Computation: An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division, ed. Rothe, J., Chapter 4, 197-325. New York: Springer.
Baumeister, D., Erdélyi, G., Hemaspaandra, E., Hemaspaandra, L., and Rothe, J. 2010. Computational Aspects of Approval Voting. In Handbook on Approval Voting, ed. Laslier, J.-E, and Sanver, M. R., 199-251. New York: Springer.
Baumeister, D., Erdélyi, G., and Rothe, J. 2011. How Hard Is It to Bribe the Judges? A Study of the Complexity of Bribery in Judgment Aggregation. In Proceedings of the 2nd International Conference on Algorithmic Decision Theory (ADT), 1-15. New York: Springer.
Baumeister, D., Faliszewski, P., Lang, J., and Rothe, J. 2012a. Campaigns for Lazy Voters: Truncated B allots. In Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 577-584. Richland, SC: IFAAMAS.
Baumeister, D., Erdélyi, G., Erdélyi, O., and Rothe, J. 2012b. Control in Judgment Aggregation. In Proceedings of the 6th European Starting AI Researcher Symposium (STAIRS), 23-34. Amsterdam: IOS Press.
Baumeister, D., Roos, M., Rothe, J., Schend, L., and Xia, L. 2012c. The Possible Winner Problem with Uncertain Weights. In Proceedings of the 20th European Conference on Artificial Intelligence (ECAI), 133-138. Amsterdam: IOS Press.
Baumeister, D., Brandt, E, Fischer, E, Hoffmann, J., and Rothe, J. 2013a. The Complexity of Computing Minimal Unidirectional Covering Sets. Theory of Computing Systems, 53(3), 467-502.
Baumeister, D., Erdélyi, G., Erdélyi, O., and Rothe, J. 2013b. Computational Aspects of Manipulation and Control in Judgment Aggregation. In Proceedings of the 3rd International Conference on Algorithmic Decision Theory (ADT), 71-85. New York: Springer.
Baumeister, D., Erdélyi, G., and Rothe, J. 2015. Judgment Aggregation. In Economics and Computation: An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division, ed. Rothe, J., Chapter 6, 361-391. New York: Springer.
Beaujard, A., Igersheim, H., Lebon, I., Gavrel, E, and Laslier, J.-E 2014. Evaluative Voting: An Experiment During the 2012 French Presidential Election. Electoral Studies, 34, 131-145.
Bei, X., Chen, N., Hua, X., Tao, B., and Yang, E. 2012. Optimal Proportional Cake Cutting with Connected Pieces. In Proceedings of the 26th AAAI Conference on Artificial Intelligence, 1263—1269. Palo Alto, CA: AAAI.
Ben-Yashar, R. C. and Nitzan, S. 1997. The Optimal Decision Rule for Fixed-Size Committees in Dichotomous Choice Situations: The General Result. International Economic Review, 38(1), 175-186.
Ben-Yashar, R. C. and Paroush, J. 2001. Optimal Decision Rules for Fixed-Size Committees in Polychotomous Choice Situations. Social Choice and Welfare, 18(4), 737-746.
Benoît, J.-P. and Kornhauser, L. A. 1991. Voting Simply in the Election of Assemblies. Technical report 91-32. C.V Starr Center for Applied Economics.
Benoît, J.-P. and Kornhauser, L. A. 2010. Only a Dictatorship is Efficient. Games and Economic Behavior, 70(2), 261-270.
Berg, S. 1985. Paradox of Voting Under an Urn Model: The Effect of Homogeneity. Public Choice, 47, 377-387.
Berg, S. 1993a. Condorcet's Jury Theorem, Dependency Among Jurors. Social Choice and Welfare, 10(1), 87-95.
Berg, S. 1993b. Condorcet's Jury Theorem Revisited. European Journal of Political Economy, 9(3), 437-446.
Berghammer, R. 2014. Computing Minimal Extending Sets by Relation-algebraic Modeling and Development. Journal on Logic and Algebraic Programming, 83(2), 103-119.
Berghammer, R., Rusinowska, A., and de Swart, H. 2013. Computing Tournament Solutions Using Relation Algebra and RelView. European Journal of Operational Research, 226(3), 636-645.
Bertsimas, D., Farias, V E, and Trichakis, N. 2011. The Price of Fairness. Operations Research, 59(1), 17-31.
Bervoets, S., Merlin, V., and Woeginger, G. J. 2015. Vote Trading and Subset Sums. Operations Research Letters, 43(1), 99-102.
Betzler, N. and Dorn, B. 2010. Towards a Dichotomy for the Possible Winner Problem in Elections Based on Scoring Rules. Journal of Computer and System Sciences, 76(8), 812-836.
Betzler, N. and Uhlmann, J. 2009. Parameterized Complexity of Candidate Control in Elections and Related Digraph Problems. Theoretical Computer Science, 410(52), 5425-5442.
Betzler, N., Fellows, M. R., Guo, J., Niedermeier, R., and Rosamond, F. A. 2009. Fixed-Parameter Algorithms for Kemeny Rankings. Theoretical Computer Science, 410(45), 4554—4570.
Betzler, N., Guo, J., and Niedermeier, R. 2010. Parameterized Computational Complexity of Dodgson and Young Elections. Information and Computation, 208(2), 165-177.
Betzler, N., Niedermeier, R., and Woeginger, G. J. 2011. Unweighted Coalitional Manipulation Under the Borda Rule Is NP-Hard. In Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI), 55-60. Palo Alto, CA: AAAI.
Betzler, N., Bredereck, R., Chen, J., and Niedermeier, R. 2012. Studies in Computational Aspects of Voting—A Parameterized Complexity Perspective. In The Multivariate Algorithmic Revolution and Beyond, 318-363. New York: Springer.
Betzler, N., Slinko, A., and Uhlmann, J. 2013. On the Computation of Fully Proportional Representation. Journal of Artificial Intelligence Research (JAIR), 47, 475-519.
Betzler, N., Bredereck, R., and Niedermeier, R. 2014. Theoretical and Empirical Evaluation of Data Reduction for Exact Kemeny Rank Aggregation. Autonomous Agents and Multi-Agent Systems, 28(5), 721-748.
Beviá, C. 1998. Fair Allocation in a General Model with Indivisible Goods. Review of Economic Design, 3, 195-213.
Bezáková, I. and Dani, V 2005. Allocating Indivisible Goods. SIGecom Exchanges, 5(3), 11-18.
Bhalgat, A., Chakraborty, T., and Khanna, S. 2010. Approximating Pure Nash Equilibrium in Cut, Party Affiliation, and Satisfiability Games. In Proceedings of the 11th ACM Conference on Electronic Commerce (EC), 73-82. New York: ACM.
Biedl, T., Brandenburg, F. J., and Deng, X. 2009. On the Complexity of Crossings in Permutations. Discrete Mathematics, 309(7), 1813-1823.
Bilbao, J. M., Fernández, J. R., Jiminéz, N., and Lopez, J. J. 2002. Voting Power in the European Union Enlargement. European Journal of Operational Research, 143, 181-196.
Bilò, V, Fanelli, A., Flammini, M., Monaco, G., and Moscardelli, L. 2014. Nash Stability in Fractional Hedonic Games. In Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 486-191. New York: Springer.
Binkele-Raible, D., Erdélyi, G., Fernau, H., Goldsmith, J., Mattei, N., and Rothe, J. 2014. The Complexity of Probabilistic Lobbying. Discrete Optimization, 11(1), 1-21.
Biró, P. and Klijn, F. 2013. Matching with Couples: A Multidisciplinary Survey. International Game Theory Review, 15, 1-18.
Biró, P., Irving, R. W., and Schlotter, I. 2011. Stable Matching with Couples: An Empirical Study. ACM Journal of Experimental Algorithmics, 16, 1-27.
Birrell, E. and Pass, R. 2011. Approximately Strategy-Proof Voting. In Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI), 67-72. Palo Alto, CA: AAAI.
Bistarelli, S., Fargier, H., Montanari, U., Rossi, E, Schiex, T., and Verfaillie, G. 1999. Semiring-Based CSPs and Valued CSPs: Frameworks, Properties and Comparison. Constraints, 4(3), 199-240.
Björklund, A., Husfeldt, T., Kaski, P., and Koivisto, M. 2007. Fourier Meets Möbius: Fast Subset Convolution. In Proceedings of the ACM Symposium on Theory of Computing (STOC), 67-74. New York: ACM.
Black, D. 1948. On the Rationale of Group Decision-Making. Journal of Political Economy, 56(1), 23-34.
Black, D. 1958. The Theory of Committees and Elections.New York: Cambridge University Press.
Blais, A., Massicotte, L., and Dobrzynska, A. 1997. Direct Presidential Elections: A World Summary. Electoral Studies, 16, 441-455.
Bogomolnaia, A. and Jackson, M. O. 2002. The Stability of Hedonic Coalition Structures. Games and Economic Behavior, 38(2), 201-230.
Bogomolnaia, A. and Moulin, H. 2001. A New Solution to the Random Assignment Problem. Journal of Economic Theory, 100, 295-328.
Bogomolnaia, A., Moulin, H., and Stong, R. 2005. Collective Choice Under Dichotomous Preferences. Journal of Economic Theory, 122(2), 165-184.
Booth, R., Chevaleyre, Y., Lang, J., Mengin, J., and Sombattheera, C. 2010. Learning Conditionally Lexicographic Preference Relations. In Proceedings of the European Conference on Artificial Intelligence (ECAI), 269-274. Amsterdam: IOS Press.
Borda, J.-C. Chevalier de. 1781. Memoire sur les Elections au Scrutin. Paris: Histoire de l'Academie Royale des Sciences.
Bordes, G. 1976. Consistency, Rationality and Collective Choice. Review of Economic Studies, 43(3), 451-457.
Bordes, G. 1979. Some More Results on Consistency, Rationality and Collective Choice. In Aggregation and Revelation of Preferences, ed. Laffont, J. J., 175-197. Amsterdam: North-Holland.
Bossert, W. and Suzumura, K. 2010. Consistency, Choice, and Rationality. Cambridge, MA: Harvard University Press.
Boutilier, C. 2013. Computational Decision Support: Regret-based Models for Optimization and Preference Elicitation. In Comparative Decision Making: Analysis and Support across Disciplines and Applications, ed. Crowley, P. H., and Zentall, T. R., 423-453. Oxford: Oxford University Press.
Boutilier, C. and Procaccia, A. D. 2012. A Dynamic Rationalization of Distance Rationalizability. In Proceedings of the 26th AAAI Conference on Artificial Intelligence, 1278-1284. Palo Alto, CA: AAAI.
Boutilier, C, Brafman, R. I., Hoos, H. H., and Poole, D. 1999. Reasoning with Conditional Ceteris Paribus Preference Statements. In Proceedings of the 15th Conference on Uncertainty in Artificial Intelligence (UAI), 71-80. New York: Morgan Kaufmann.
Boutilier, C, Bacchus, E, and Brafman, R. I. 2001. UCP-Networks: A Directed Graphical Represen-tation of Conditional Utilities. In Proceedings of the 17th Conference on Uncertainty in Artificial Intelligence (UAI), 56-64. New York: Morgan Kaufmann.
Boutilier, C, Brafman, R., Domshlak, C, Hoos, H., and Poole, D. 2004. CP-Nets: A Tool for Representing and Reasoning with Conditional Ceteris Paribus Statements. Journal of Artificial Intelligence Research (JAIR), 21, 135-191.
Boutilier, C, Caragiannis, I., Haber, S., Lu, T., Procaccia, A. D., and Sheffet, Or. 2012. Optimal Social Choice Functions: A Utilitarian View. In Proceedings of the ACM Conference on Electronic Commerce (EC), 194-214. New York: ACM.
Boutilier, C, Lang, J., Oren, J., and Palacios, H. 2014. Robust Winners and Winner Determination Policies Under Candidate Uncertainty. In Proceedings of the 28th AAAI Conference on Artificial Intelligence, 1391-1397. Palo Alto, CA: AAAI.
Bouveret, S. and Lang, J. 2008. Efficiency and Envy-Freeness in Fair Division of Indivisible Goods: Logical Representation and Complexity. Journal of Artificial Intelligence Research (JAIR), 32, 525-564.
Bouveret, S. and Lang, J. 2011. A General Elicitation-Free Protocol for Allocating Indivisible Goods. In Proceedings of ‘the 22nd International Joint Conference on Artificial Intelligence (IJCAI)’, 73-78. Palo Alto, CA: AAAI.
Bouveret, S. and Lemaître, M. 2014. Characterizing Conflicts in Fair Division of Indivisible Goods Using a Scale of Criteria. In Proceedings of the 13th International Conference on Autonomous Agents andMultiagent Systems (AAMAS), 1321-1328. Richland, SC: IFAAMAS.
Bouveret, S., Fargier, H., Lang, J., and Lemaître, M. 2005. Allocation of Indivisible Goods: A General Model and some Complexity Results. In Proceedings of the 4th International Con-ference on Autonomous Agents and Multiagent Systems (AAMAS), 1309-1310. Richland, SC: IFAAMAS.
Bouveret, S., Endriss, U., and Lang, J. 2009. Conditional Importance Networks: A Graphical Language for Representing Ordinal, Monotonic Preferences over Sets of Goods. In Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI), 67-72. Palo Alto, CA: AAAI.
Bouveret, S., Endriss, U., and Lang, J. 2010. Fair Division Under Ordinal Preferences: Computing Envy-Free Allocations of Indivisible Goods. In Proceedings of the 19th European Conference on Artificial Intelligence (ECAI), 387-392. Amsterdam: IOS Press.
Bouyssou, D. 2004. Monotonicity of “ranking by choosing”: A progress report. Social Choice and Welfare, 23(2), 249-273.
Bouyssou, D., Marchant, T., Pirlot, M., Tsoukias, A., and Vincke, P. 2006. Evaluation and Decision Models: Stepping Stones for the Analyst.New York: Springer.
Bovet, D. and Crescenzi, P. 1993. Introduction to the Theory of Complexity.Mahwah, NJ: Prentice
Hall. Bowman, C, Hodge, J., and Yu, A. 2014. The Potential of Iterative Voting to Solve the Separability Problem in Referendum Elections. Theory and Decision, 77(1), 111-124.
Bradley, W. J., Hodge, J. K., and Kilgour, D. 2005. Separable Discrete Preferences. Mathematical Social Science, 49(3), 335-353.
Brafman, R. I., Domshlak, C, and Shimony, S. E. 2006. On Graphical Modeling of Preference and Importance. Journal of Artificial Intelligence Research (JAIR), 25, 389—424.
Brams, S. J. 2008. Mathematics and Democracy.Princeton, NJ: Princeton University Press.
Brams, S. J. and Fishburn, P. C. 1978. Approval Voting.American Political Science Review, 72(3), 831-847.
Brams, S. J. and Fishburn, P. C. 2002. Voting Procedures. In Handbook of Social Choice and Welfare, vol. 1, ed. Arrow, K., Sen, A., and Suzumura, K., 173-236. New York: Elsevier.
Brams, S. J. and Fishburn, P. C. 2007. Approval Voting. Rev. ed. New York: Springer.
Brams, S. J. and King, D. 2005. Efficient Fair Division—Help the Worst off or Avoid Envy? Rationality and Society, 17(4), 387-21.
Brams, S. J. and Potthoff, R. F. 1998. Proportional Representation: Broadening the Options. Journal of Theoretical Politics, 10, 147-178.
Brams, S. J. and Sanver, M. R. 2006. Critical Strategies Under Approval Voting: Who Gets Ruled in and Ruled Out. Electoral Studies, 25(2), 287-305.
Brams, S. J. and Sanver, M. R. 2009. Voting Systems That Combine Approval and Preference. In The Mathematics of Preference, Choice, and Order: Essays in Honor of Peter C. Fishburn, ed. Brams, S. J., Gehrlein, W. V, and Roberts, E, 215-237. New York: Springer.
Brams, S. J. and Taylor, A. D. 1995. An Envy-Free Cake Division Protocol. American Mathematical Monthly, 102(1), 9-18.
Brams, S. J. and Taylor, A. D. 1996. Fair Division: From Cake-Cutting to Dispute Resolution. New York: Cambridge University Press.
Brams, S. J. and Taylor, A. D. 2000. The Win-Win Solution: Guaranteeing Fair Shares to Everybody.New York: W. W. Norton.
Brams, S. J., Kilgour, D., and Zwicker, W. S. 1997a. Voting on Referenda: The Separability Problem and Possible Solutions. Electoral Studies, 16(3), 359-377.
Brams, S. J., Taylor, A. D., and Zwicker, W. S. 1997b. A Moving-Knife Solution to the Four-Person Envy-Free Cake-Division problem. Proceedings of the American Mathematical Society, 125(2), 547-554.
Brams, S. J., Kilgour, D., and Zwicker, W. S. 1998. The Paradox of Multiple Elections. Social Choice and Welfare, 15(2), 211-236.
Brams, S. J., Edelman, P. H., and Fishburn, P. C. 2004. Fair Division of Indivisible Items. Theory and Decision, 5(2), 147-180.
Brams, S. J., Jones, M. A., and Klamler, C. 2006. Better Ways to Cut a Cake. Notices of the AMS, 53(11), 1314-1321.
Brams, S. J., Kilgour, D., and Sanver, M. R. 2007. A Minimax Procedure for Electing Committees. Public Choice, 3-4(132), 401-420.
Brams, S. J., Feldman, M., Morgenstern, J., Lai, J. K., and Procaccia, A. D. 2012a. On Maxsum Fair Cake Divisions. In Proceedings of ‘the 26th AAAI Conference on Artificial Intelligence, 1285-1291. Palo Alto, CA: AAAI.
Brams, S. J, Kilgour, D. M., and Klamler, C. 2012b. The Undercut Procedure: An Algorithm for the Envy-Free Division of Indivisible Items. Social Choice and Welfare, 39(2-3), 615-631.
Brams, S. J., Jones, M. A., and Klamler, C. 2013. N-Person Cake-Cutting: There May Be No Perfect Division. American Mathematical Monthly, 120(1), 35-47.
Brams, S. J., Kilgour, M., and Klamler, C. 2014. Two-Person Fair Division of Indivisible Items: An Efficient, Envy-Free Algorithm. Notices of the AMS, 61(2), 130-141.
Brandl, E, Brandt, E, and Hofbauer, J. 2015a. Incentives for Participation and Abstention in Probabilistic Social Choice. In Proceedings of the 14th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 1411-1419. Richland, SC: IFAAMAS.
Brandl, E, Brandt, E, Geist, C, and Hofbauer, J. 2015b. Strategic Abstention based on Prefer-ence Extensions: Positive Results and Computer-Generated Impossibilities. In Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI), 18-24. Palo Alto, CA: AAAI.
Brandt, E 2009a. Some Remarks on Dodgson's Voting Rule. Mathematical Logic Quarterly, 55(4), 460-463.
Brandt, E 2009b. Tournament Solutions—Extensions of Maximality and Their Applications to Decision-Making. Habilitation Thesis, Faculty for Mathematics, Computer Science, and Statistics, University of Munich.
Brandt, E 2009c. Some Remarks on Dodgson's Voting Rule. Mathematical Logic Quarterly, 55(4), 460-463.
Brandt, E 2011a. Minimal Stable Sets in Tournaments. Journal of Economic Theory, 146(4), 1481—1499.
Brandt, E 201 lb. Group-Strategyproof Irresolute Social Choice Functions. In Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI), 79-84. Palo Alto, CA: AAAI.
Brandt, E 2015. Set-monotonicity implies Kelly-Strategyproofness. Social Choice and Welfare, 45(4), 793-804.
Brandt, E and Brill, M. 2011. Necessary and Sufficient Conditions for the Strategyproofness of Irresolute Social Choice Functions. In Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge (TARK), 136-142. New York: ACM.
Brandt, E and Brill, M. 2012. Computing Dominance-Based Solution Concepts. In Proceedings of the 13th ACM Conference on Electronic Commerce (EC), 233. New York: ACM.
Brandt, E and Fischer, E 2007. PageRank as a Weak Tournament Solution. In Proceedings of the 3rd International Conference on Web and Internet Economics (WINE), 300-305. New York: Springer.
Brandt, E and Fischer, E 2008a. Computing the Minimal Covering Set. Mathematical Social Sciences, 56(2), 254-268.
Brandt, R and Fischer, R 2008b. On the Hardness and Existence of Quasi-Strict Equilibria. In Proceedings of the 1st International Symposium on Algorithmic Game Theory (SAGT), 291-302. New York: Springer.
Brandt, R and Geist, C. 2014. Finding Strategyproof Social Choice Functions via SAT Solving. In Proceedings of the 13th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 1193-1200. Richland, SC: IFAAMAS.
Brandt, F. and Harrenstein, P. 2010. Characterization of Dominance Relations in Finite Coalitional Games. Theory and Decision, 69(2), 233-256.
Brandt, F. and Harrenstein, P. 2011. Set-Rationalizable Choice and Self-Stability. Journal of Economic Theory, 146(4), 1721-1731.
Brandt, F. and Seedig, H. G. 2013. A Tournament of Order 24 With Two Disjoint TEQ-Retentive Sets. Technical report.
Brandt, F. and Seedig, H. G. 2015. On the Discriminative Power of Tournament Solutions. In Selected Papers of the International Conference on Operations Research (OR2014). New York: Springer.
Brandt, E, Fischer, E, and Harrenstein, P. 2009. The Computational Complexity of Choice Sets. Mathematical Logic Quarterly, 55(4), 444-459.
Brandt, E, Brill, M., Hemaspaandra, E., and Hemaspaandra, L. 2010a. Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates. In Proceedings of the 24th AAAI Conference on Artificial Intelligence, 715-722. Palo Alto, CA: AAAI.
Brandt, E, Brill, M., Hemaspaandra, E., and Hemaspaandra, L. 2010b. Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates. Technical report TR- 955, Department of Computer Science, University of Rochester, Rochester, NY. Revised September 2013.
Brandt, E, Fischer, E, Harrenstein, P., and Mair, M. 2010c. A Computational Analysis of the Tour-nament Equilibrium Set. Social Choice and Welfare, 34(4), 597-609.
Brandt, E, Brill, M., and Seedig, H. G. 2011. On the Fixed-Parameter Tractability of Composition-Consistent Tournament Solutions. In Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI), 85-90. Palo Alto, CA: AAAI.
Brandt, E, Conitzer, V., and Endriss, U. 2013a. Computational Social Choice. In Multiagent Systems, 2nd ed. Weiss, G., 213-283. Cambridge, MA: MIT Press.
Brandt, E, Chudnovsky, M., Kim, I., Liu, G., Norin, S., Scott, A., Seymour, P., and Thomasse, S. 2013b. A Counterexample to a Conjecture of Schwartz. Social Choice and Welfare, 40, 739-743.
Brandt, E, Brill, M., and Harrenstein, P. 2014a. Extending Tournament Solutions. In Proceedings of the 28th AAAI Conference on Artificial Intelligence, 580-586. Palo Alto, CA: AAAI.
Brandt, E, Geist, C, and Seedig, H. G. 2014b. Identifying £-Majority Digraphs via SAT Solving. In Proceedings of the 1st AAMAS Workshop on Exploring Beyond the Worst Case in Computational Social Choice (EXPLORE).
Brandt, E, Harrenstein, P., and Seedig, H. G. 2014c. Minimal Extending Sets in Tournaments. In Proceedings of the 13th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 1539-1540. Richland, SC: IFAAMAS.
Brandt, E, Brill, M., Fischer, E, and Harrenstein, P. 2014d. Minimal Retentive Sets in Tournaments. Social Choice and Welfare, 42(3), 551-574.
Brandt, E, Brill, M., Seedig, H. G., and Suksompong, W 2014e. On the Structure of Stable Tournament Solutions. Working paper.
Brandt, E, Geist, C, Harrenstein, P. 2015a. A Note on the McKelvey Uncovered Set and Pareto Optimality. Social Choice and Welfare, Online First.
Brandt, R, Dau, A., and Seedig, H. G. 2015b. Bounds on the Disparity and Separation of Tournament Solutions. Discrete Applied Mathematics, 187, 41-49.
Brandt, R, Brill, M., Hemaspaandra, R., and Hemaspaandra, L. 2015c. Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Rlectorates. Journal of Artificial Intelligence Research (JAIR), 53, 439-496.
Brânzei, S. and Larson, K. 2011. Social Distance Games. In Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI), 273-279. Palo Alto, CA: AAAI.
Brânzei, s. and Miltersen, P. B. 2013. equilibrium analysis in cake cutting. in proceedings of the 12th international conference on autonomous agents and multiagent systems (aamas), 327-334. richland, SC: IFAAMAS.
Brânzei, R., Dimitrov, D., and Tijs, S. 2005. Models in Cooperative Game Theory. Springer.
Brânzei, S., Procaccia, A. D., and Zhang, J. 2013a. Rxternalities in Cake Cutting. In Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI), 55-61. Palo Alto, CA: AAAI.
Brânzei, S., Caragiannis, I., Morgenstern, J., and Procaccia, A. D. 2013b. How Bad Is Selfish Voting? In Proceedings of the 27th AAAI Conference on Artificial Intelligence, 138-144. Palo Alto, CA: AAAI.
Bredereck, R., Chen, J., and Woeginger, G. J. 2013a. Are There Any Nicely Structured Preference Profiles Nearby? In Proceedings of'the 23rd International Joint Conference on Artificial Intelligence (IJCAI), 62-68. Palo Alto, CA: AAAI.
Bredereck, R., Chen, J., and Woeginger, G. J. 2013b. A Characterization of the Single-Crossing Domain. Social Choice and Welfare, 41(4), 989-998.
Bredereck, R., Chen, J., Hartung, S., Kratsch, S., Niedermeier, R., Suchy, O., and Woeginger, G. J. 2014a. A Multivariate Complexity Analysis of Lobbying in Multiple Referenda. Journal of Artificial Intelligence Research (JAIR), 50, 409-446.
Bredereck, R., Chen, J., Faliszewski, P., Nichterlein, A., and Niedermeier, R. 2014b. Prices Matter for the Parameterized Complexity of Shift Bribery. In Proceedings of the 28th AAAI Conference on Artificial Intelligence, 1398-1404. Palo Alto, CA: AAAI.
Brelsford, R., Faliszewski, P., Hemaspaandra, R., Schnoor, H., and Schnoor, I. 2008. Approximability of Manipulating Rlections. In Proceedings of the 23rd AAAI Conference on Artificial Intelligence, AA-A9.Palo Alto, CA: AAAI.
Brightwell, G. and Winkler, P. 1991. Counting Linear Rxtensions is #P-Complete. In Proceedings of the ACM Symposium on Theory of Computing (STOC), 175-181. New York: ACM.
Brill, M. and Conitzer, V. 2015. Strategic Voting and Strategic Candidacy. In Proceedings of the 29th AAAI Conference on Artificial Intelligence, 819-826. Palo Alto, CA: AAAI.
Brill, M. and Fischer, R 2012. The Price of Neutrality for the Ranked Pairs Method. In Proceedings of the 26th AAAI Conference on Artificial Intelligence, 1299-1305. Palo Alto, CA: AAAI.
Brin, S. and Page, L. 1998. The Anatomy of a Large-Scale Hypertextual Web Search Rngine. Computer Networks and ISDN Systems, 30(1-7), 107-117.
Buchanan, J. M. 1954. Social Choice, Democracy, and Free Markets. Journal of Political Economy, 62,114-123.
Budish, R. 2011. The Combinatorial Assignment Problem: Approximate Competitive Rquilibrium from Rqual Incomes. Journal of Political Economy, 119(6), 1061-1103.
Caminada, M. and Pigozzi, G. 2011. On Judgment Aggregation in Abstract Argumentation. Autonomous Agents and Multiagent Systems, 22(1), 64—102.
Campbell, D. R. and Kelly, J. S. 2003. Strategy-Proofness Characterization of Majority Rule. Economic Theory, 22(3), 557-568.
Campbell, D. and Nitzan, S. 1986. Social Compromise and Social Metrics. Social Choice and Welfare, 3(1), 1-16.
Camps, R., Mora, X., and Saumell, L. 2014. Social Choice Rules Driven by Prepositional Logic. Annals of Mathematics and Artificial Intelligence, 70(3), 279-312.
Caragiannis, I. and Procaccia, A. D. 2011. Voting Almost Maximizes Social Welfare Despite Limited Communication. Artificial Intelligence, 175(9-10), 1655-1671.
Caragiannis, I., Kaklamanis, C, Kanellopoulos, P., and Kyropoulou, M. 2009. The Efficiency of Fair Division. In Proceedings of the 5 th International Conference on Web and Internet Economics (WINE), 475-482. New York: Springer.
Caragiannis, I., Kalaitzis, D., and Markakis, E. 2010. Approximation Algorithms and Mechanism Design for Minimax Approval Voting. In Proceedings of the AAAI Conference on Artificial Intelligence, 737-742. Palo Alto, CA: AAAI.
Caragiannis, I., Lai, J. K., and Procaccia, A. D. 2011. Towards More Expressive Cake Cutting. In Proceedings of'the 22nd International Joint Conference on Artificial Intelligence (IJCAI), 127-132. Palo Alto, CA: AAAI.
Caragiannis, I., Kaklamanis, C, Kanellopoulos, P., and Kyropoulou, M. 2012a. The Efficiency of Fair Division. Theory of Computing Systems, 50(4), 589-610.
Caragiannis, I., Covey, J., Feldman, M., Homan, C, Kaklamanis, C, Karanikolas, N., Procaccia, A. D., and Rosenschein, J. S. 2012b. On the Approximability of Dodgson and Young Elections. Artificial Intelligence, 187-188, 31-51.
Caragiannis, I., Procaccia, A. D., and Shah, N. 2013. When Do Noisy Votes Reveal the Truth? In Proceedings of the 13th ACM Conference on Electronic Commerce (EC), 143-160. New York: ACM.
Caragiannis, I., Procaccia, A. D., and Shah, N. 2014a. Modal Ranking: A Uniquely Robust Voting Rule. In Proceedings of the 28th AAAI Conference on Artificial Intelligence, 616-622. Palo Alto, CA: AAAI.
Caragiannis, I., Kaklamanis, C, Karanikolas, N., and Procaccia, A. D. 2014b. Socially Desirable Approximations for Dodgson's Voting Rule. ACM Transactions on Algorithms, 10(2), Article 6.
Cary, D. 2011. Estimating the Margin of Victory for Instant-Runoff Voting. In Proceedings of the Electronic Voting Technology Workshop and the Workshop on Trustworthy Elections (E VT/WOTE). Berkeley, CA: USENIX.
Caspard, N., Leclerc, B., and Monjardet, B. 2012. Finite Ordered Sets: Concepts, Results and Uses.New York: Cambridge University Press.
Cavallo, R. 2012. Fairness and Welfare through Redistribution When Utility Is Transferable. In Proceedings of the 26th AAAI Conference on Artificial Intelligence, 1306-1312. Palo Alto, CA: AAAI.
Cechlárová, K. 2008. Stable Partition Problem. In Encyclopedia of Algorithms, 885-888. New York: Springer.
Cechlárová, K. and Hajduková, J. 2002. Computational Complexity of Stable Partitions With B-Preferences. International Journal of Game Theory, 31(3), 353-354.
Cechlárová, K. and Hajduková, J. 2004a. Stability of Partitions Under SW-Preferences and Y\>B- Preferences. International Journal of Information Technology and Decision Making, 3(4), 605-618.
Cechlárová, K. and Hajduková, J. 2004b. Stable Partitions with W-Preferences. Discrete Applied Mathematics, 138(3), 333-347.
Cechlárová, K. and Romero-Medina, A. 2001. Stability in Coalition Formation games. International Journal of Game Theory, 29, 487-494.
Cervone, D., Gehrlein, W. V, and Zwicker, W. S. 2005. Which Scoring Rule Maximizes Condorcet Efficiency Under IAC?Theory and Decision, 58, 145-185.
Chalkiadakis, G., Elkind, E., Markakis, E., and Jennings, N. R. 2010. Cooperative Games with Overlapping Coalitions. Journal of Artificial Intelligence Research (JAIR), 39, 179-216.
Chalkiadakis, G., Elkind, E., and Wooldridge, M. 2011. Computational Aspects of Cooperative Game Theory. San Rafael, CA: Morgan and Claypool.
Chamberlin, J. R. and Courant, P. N. 1983. Representative Deliberations and Representative Decisions: Proportional Representation and the Borda Rule. American Political Science Review, 77(3), 718-733.
Chambers, C. P. and Thomson, W. 2002. Group Order Preservation and the Proportional Rule for the Adjudication of Conflicting Claims. Mathematical Social Sciences, 44(3), 235-252.
Charbit, P., Thomasse, S., and Yeo, A. 2007. The Minimum Feedback Arc Set Problem Is NP-Hard for Tournaments. Combinatorics, Probability and Computing, 16(1), 1-4.
Charon, I. and Hudry, O. 2006. A Branch-And-Bound Algorithm to Solve the Linear Ordering Problem for Weighted Tournaments. Discrete Applied Mathematics, 154(15), 2097-2116.
Charon, I. and Hudry, O. 2007. A Survey on the Linear Ordering Problem for Weighted or Unweighted Tournaments. 4OR, 5(1), 5-60.
Charon, I. and Hudry, O. 2010. An Updated Survey on the Linear Ordering Problem for Weighted or Unweighted Tournaments. Annals of Operations Research, 175(1), 107-158.
Chebotarev, P. Yu. and Shamis, E. 1998. Characterizations of Scoring Methods for Preference Aggregation. Annals of Operations Research, 80, 299-332.
Chen, J.,Faliszewski, P., Niedermeier, R., and Talmon, N. 2014. Combinatorial Voter Control in Elections. In Proceedings of the 39th International Symposium on Mathematical Foundations of Computer Science, 153-164. New York: Springer.
Chen, J.,Faliszewski, P., Niedermeier, R., and Talmon, N. 2015. Elections with Few Voters: Candidate Control Can Be Easy. In Proceedings of the 29th AAAI Conference on Artificial Intelligence, 2045-2051. Palo Alto, CA: AAAI.
Chen, Y.-L., Cheng, L.-C, and Chuang, C.-N. 2008. A Group Recommendation System with Consideration of Interactions among Group Members. Expert Systems with Applications, 34(3), 2082-2090.
Chen, Y, Lai, J. K., Parkes, D. C, and Procaccia, A. D. 2013. Truth, Justice, and Cake Cutting. Games and Economic Behavior, 11, 284-297.
Chernoff, H. 1954. Rational Selection of Decision Functions. Econometrica, 22, 422-443.
Chevaleyre, Y, Dunne, P. E., Endriss, U., Lang, J., Lemaître, M., Maudet, N., Padget, J., Phelps, S., Rodriguez-Aguilar, J. A., and Sousa, P. 2006. Issues in Multiagent Resource Allocation. Informatica, 30, 3-31.
Chevaleyre, Y, Lang, J., Maudet, N., and Ravilly-Abadie, G. 2009. Compiling the votes of a subelectorate. In Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI), 97-102. Palo Alto, CA: AAAI.
Chevaleyre, Y, Endriss, U., and Maudet, N. 2010. Simple Negotiation Schemes for Agents with Simple Preferences: Sufficiency, Necessity and Maximality. Journal of Autonomous Agents and Multi-Agent Systems, 20(2), 234-259.
Chevaleyre, Y, Lang, J., Maudet, N., and Monnot, J. 2011. Compilation/Communication Protocols for Voting Rules with a Dynamic Set of Candidates. In Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge (TARK), 153-160. New York: ACM.
Chevaleyre, Y, Lang, J., Maudet, N., Monnot, J., and Xia, L. 2012. New Candidates Welcome! Possible Winners with Respect to the Addition of New Candidates. Mathematical Social Sciences, 64(1), 74-88.
Chichilnisky, G. and Thomson, W. 1987. The Walrasian Mechanism from Equal Division is Not Monotonic with Respect to Variations in the Number of Consumers. Journal of Public Economics, 32(1), 119-124.
Chopra, S., Pacuit, E., and Parikh, R. 2004. Knowledge-Theoretic Properties of Strategic Voting. In Proceedings of the 9th European Conference onLogics in Artificial Intelligence (JELIA), 18-30. New York: Springer.
Chou, J.-H. and Lu, C.-J. 2010. Communication Requirements for Stable Marriages. In Proceedings of the 7th International Conference on Algorithms and Complexity (CIAC), 371-382. New YorkSpringer.
Christian, R., Fellows, M. R., Rosamond, E, and Slinko, A. 2007. On Complexity of Lobbying in Multiple Referenda. Review of Economic Design, 11(3), 217-224.
Chun, Y and Thomson, W. 1988. Monotonicity Properties of Bargaining Solutions when Applied to Economics. Mathematical Social Sciences, 15(1), 11-27.
CNN. 2012. Olympic Badminton Players Disqualified for Trying to Lose, August 22.
Cohen, S. and Zohar, A. 2015. An Axiomatic Approach to Link Prediction. In Proceedings of the AAAI Conference on Artificial Intelligence, 58-64. Palo Alto, CA: AAAI.
Cohen, W. W., Schapire, R. E., and Singer, Y 1999. Learning to Order Things. Journal of Artificial Intelligence Research (JAIR), 10, 243-270.
Cohler, Y J, Lai, J. K., Parkes, D. C, and Procaccia, A. D. 2011. Optimal Envy-Free Cake Cutting. In Proceedings of the 25th AAAI Conference on Artificial Intelligence, 626-631. Palo Alto, CA: AAAI.
Coleman, J. S. 1971. Control of Collectivities and the Power of a Collectivity to Act. In Social Choice, ed. Lieberman, B., 269-298. New York Gordon and Breach.
Coleman, T. and Teague, V. 2007. On the Complexity of Manipulating Elections. In Proceedings of the 13th Australasian Symposium on Theory of Computing (CATS), 25-33. Darlinghurst: Australian Computer Society.
Condorcet, J.-A.-N. de Caritat, Marquis de. 1785. Essai sur I'Application del!Analyse a la Probability des Decisions Rendues a la Pluralite des Voix. Facsimile reprint of original published in Paris, 1972, by the Imprimerie Roy ale.
Conitzer, V. 2006. Computing Slater Rankings Using Similarities among Candidates. In Proceedings of the 21st AAAI Conference on Artificial Intelligence, 613-619. Palo Alto, CA: AAAI.
Conitzer, V. 2008. Anonymity-Proof Voting Rules. In Proceedings of the 4th International Conference on Web and Internet Economics (WINE), 295-306. New York: Springer.
Conitzer, V 2009. Eliciting Single-Peaked Preferences Using Comparison Queries. Journal of Artificial Intelligence Research (JAIR), 35, 161-191.
Conitzer, V and Sandholm, T. 2002. Vote Elicitation: Complexity and Strategy-Proofness. In Proceedings of the AAAI Conference on Artificial Intelligence, 392-397. Palo Alto, CA: AAAI.
Conitzer, V and Sandholm, T. 2003. Universal Voting Protocol Tweaks to Make Manipulation Hard. In Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI), 781-788. Palo Alto, CA: AAAI.
Conitzer, V and Sandholm, T. 2004. Computational Criticisms of the Revelation Principle. In Proceedings of the ACM Conference on Electronic Commerce (EC), 262-263. New York ACM.
Conitzer, V and Sandholm, T. 2005a. Common Voting Rules as Maximum Likelihood Estimators. In Proceedings of the Conference on Uncertainty in Artificial Intelligence (UAI), 145-152. New York: Morgan Kaufmann.
Conitzer, V and Sandholm, T. 2005b. Communication Complexity of Common Voting Rules. In Proceedings of the ACM Conference on Electronic Commerce (EC), 78-87. New York: ACM.
Conitzer, V and Sandholm, T. 2006. Nonexistence of Voting Rules That Are Usually Hard to Manipulate. In Proceedings of the AAAI Conference on Artificial Intelligence, 627-634. Palo Alto, CA: AAAI.
Conitzer, V. and Xia, L. 2012. Paradoxes of Multiple Elections: An Approximation Approach. In Proceedings of the International Conference on Principles of Knowledge Representation and Reasoning (KR), 179-187. Palo Alto: AAAI.
Conitzer, V., Davenport, A., and Kalagnanam, J. 2006. Improved Bounds for Computing Kemeny Rankings. In Proceedings of the 21st AAAI Conference on Artificial Intelligence, 620-627. Palo Alto, CA: AAAI.
Conitzer, V., Sandholm, T., and Lang, J. 2007. When Are Elections with Few Candidates Hard to Manipulate?Journal of the Association for Computing Machinery, 54(3), 1-33.
Conitzer, V., Lang, J., and Xia, L. 2009a. How Hard Is It to Control Sequential Elections via the Agenda? In Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI), 103-108. Palo Alto, CA: AAAI.
Conitzer, V., Rognlie, M., and Xia, L. 2009b. Preference Functions that Score Rankings and Maximum Likelihood Estimation. In Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI), 109-115. Palo Alto, CA: AAAI.
Conitzer, V., Walsh, T., and Xia, L. 2011a. Dominating Manipulations in Voting with Partial Information. In Proceedings of the 25th AAAI Conference on Artificial Intelligence, 638-643. Palo Alto, CA: AAAI.
Conitzer, V., Lang, J., and Xia, L. 2011b. Hypercubewise Preference Aggregation in Multi-issue Domains. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), 158-163. Palo Alto, CA: AAAI.
Connolly, R. A. and Rendleman, R. J. 2011. Tournament Qualification, Seeding and Selection Effciency: An Analysis of the PGA TOUR's FedExCup. Working paper, Tuck School of Business.
Copeland, A. H. 1951. A “Reasonable” Social Welfare Function. Mimeo, University of Michigan Seminar on Applications of Mathematics to the Social Sciences.
Coppersmith, D., Fleischer, L., and Rudra, A. 2006. Ordering by Weighted Number of Wins Gives a Good Ranking for Weighted Tournaments. In Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, 776-782. New York: ACM.
Coppersmith, D., Fleischer, L., and Rudra, A. 2010. Ordering by Weighted Number of Wins Gives a Good Ranking for Weighted Tournaments. ACM Transactions on Algorithms, 6(3), 1-13.
Cornaz, D., Galand, L., and Spanjaard, O. 2012. Bounded Single-Peaked Width and Proportional Representation. In Proceedings of the 20th European Conference on Artificial Intelligence (ECAI), 270-275. Amsterdam: IOS Press.
Cornaz, D., Galand, L., and Spanjaard, O. 2013. Kemeny Elections with Bounded Single-Peaked or Single-Crossing Width. In Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI), 76-82. Palo Alto, CA: AAAI.
Coste-Marquis, S., Lang, J., Liberatore, P., and Marquis, P. 2004. Expressive Power and Succinctness of Propositional Languages for Preference Representation. In Proceedings of the 9th International Conference on Principles of Knowledge Representation and Reasoning (KR), 203-212. New York AAAI.
Coughlan, P. J. and Le Breton, M. 1999. A Social Choice Function Implementable via Backward Induction with Values in the Ultimate Uncovered Set. Review of Economic Design, 4(2), 153-160.
Cox, G. 1997. Making Votes Count: Strategic Coordination in the World's Electoral Systems. New York: Cambridge University Press.
Cramton, P., Shoham, Y, and Steinberg, R, eds. 2006. Combinatorial Auctions.Cambridge, MA: MIT Press.
Cuhadaroglu, T. and Laine, J. 2012. Pareto efficiency in Multiple Referendum. Theory and Decision, 72(4), 525-536.
Curiel, I. 1997. Cooperative Game Theory and Applications.Dordrecht: Kluwer Academic.
Dagan, N. 1996. A Note on Thomson's Characterizations of the Uniform Rule. Journal of Economic Theory, 69(1), 255-261.
van Dalen, D. 2013. Logic and Structure. 5th ed. New York: Springer.
DallaPozza, G., Pini, M. S., Rossi, R, and Venable, K. B. 2011. Multi-Agent Soft Constraint Aggregation via Sequential Voting. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), 172-177. Palo Alto, CA: AAAI.
Dall'Aglio, M. and Hill, T. P. 2003. Maxmin Share and Minimax Envy in Fair Division Problems. Journal of Mathematical Analysis and Applications, 281(1), 346-361.
Dall'Aglio, M. and Mosca, R. 2007. How to Allocate Hard Candies Fairly. Mathematical Social Sciences, 54, 218-237.
Daniels, H. E. 1969. Round-Robin Tournament Scores. Biometrika, 56(2), 295-299.
Darmann, A. 2013. Popular Spanning Trees. International Journal of Foundations of Computer Science, 24(5), 655-678.
Darmann, A., Klamler, C, and Pferschy, U. 2009. Maximizing the Minimum Voter Satisfaction on Spanning Trees. Mathematical Social Sciences, 58(2), 238-250.
Darmann, A., Kurz, E., Lang, J., Schauer, J., and Woeginger, G. J. 2012. Group Activity Selection Problem. In Proceedings of the 8th International Conference on Web and Internet Economics (WINE), 156-169. New York: Springer.
Dash, R., Ramchurn, S., and Jennings, N. R. 2004. Trust-Based Mechanism Design. In Proceedings of the 3rd International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 748-755. Richland, SC: IFAAMAS.
Davenport, A. and Kalagnanam, J. 2004. A Computational Study of the Kemeny Rule for Preference Aggregation. In Proceedings of the 19th AAAI Conference on Artificial Intelligence, 697-702. Palo Alto, CA: AAAI.
Davey, B. A. and Priestley, H. A. 2002. Introduction to Lattices and Order. 2nd ed. New York Cambridge University Press.
Davies, J., Katsirelos, G., Narodytska, N., and Walsh, T. 2011. Complexity of and Algorithms for Borda Manipulation. In Proceedings of the 25th AAAI Conference on Artificial Intelligence, 657-662. Palo Alto, CA: AAAI.
Davies, J., Narodytska, N., and Walsh, T. 2012. Eliminating the Weakest Link: Making Manipulation Intractable?In Proceedings of the 26th AAAI Conference on Artificial Intelligence, 1333-1339. Palo Alto, CA: AAAI.
Davies, J., Katsirelos, G., Narodytska, N., Walsh, T., and Xia, L. 2014. Complexity of and Algorithms for the Manipulation of Borda, Nanson's and Baldwin's voting rules. Artificial Intelligence, 217, 20-42.
De Donder, P., Le Breton, M., and Truchon, M. 2000. Choosing from a Weighted Tournament. Mathematical Social Sciences, 40, 85-109.
de Keijzer, B., Bouveret, S., Klos, T., and Zhang, Y 2009. On the Complexity of Efficiency and Envy-Freeness in Fair Division of Indivisible Goods with Additive Preferences. In Proceedings of the 1st International Conference on Algorithmic Decision Theory (ADT), 98-110. New York Springer.
Debord, B. 1987. Caractérisation des matrices des préferénces nettes et méthodes d'agrégation associeés. Mathématiques et sciences humaines, 97, 5-17.
Debreu, G. 1954. Representation of a Preference Ordering by a Numerical Function. Decision Processes, 3, 159-165.
Deegan, J. and Packel, E. W. 1978. A New Index of Power for Simple N-Person Games. International Journal of Game Theory, 7, 113-123.
Deineko, V G. and Woeginger, G. J. 2013. Two Hardness Results for Core Stability in Hedonic Coalition formation games. Discrete Applied Mathematics, 161, 1837-1842.
Deineko, V. G. and Woeginger, G. J. 2014. Two Hardness Results for Gamson's Game. Social Choice and Welfare, 43, 963-972.
Dekel, O., Fischer, R A., and Procaccia, A. D. 2010. Incentive Compatible Regression Learning. Journal of Computer and System Sciences, 76(8), 759-777.
Demange, G. 2009. The Strategy Structure of Some Coalition Formation Games. Games and Economic Behavior, 65, 83-104.
Demko, S. and Hill, T. P. 1988. Equitable Distribution of Indivisible Items. Mathematical Social Sciences, 16, 145-158.
Deng, X. and Fang, Z. 2008. Algorithmic Cooperative Game Theory. In Pareto Optimality, Game Theory and Equilibria, ed. Chinchuluun, A., Pardalos, P. M., Migdalas, A., and Pitsoulis, L.158-185. New York: Springer.
Deng, X. and Papadimitriou, C. H. 1994. On the Complexity of Cooperative Solution Concepts. Mathematics of Operations Research, 19(2), 257-266.
Deng, X., Papadimitriou, C. H., and Safra, S. 2003. On the Complexity of Equilibria. Journal of Computer and System Sciences, 67(2), 311-324.
Deng, X., Qi, Q., and Saberi, A. 2012. Algorithmic Solutions for Envy-Free Cake Cutting. Operations Research, 60(6), 1461-1476.
Dery, L. N., Kalech, M., Rokach, L., and Shapira, B. 2010. Iterative Voting Under Uncertainty for Group Recommender Systems. In Proceedings of the 4th ACM Conference on Recommender Systems, 265-268. New York: ACM.
Desmedt, Y and Elkind, E. 2010. Equilibria of Plurality Voting with Abstentions. In Proceedings of the ACM Conference on Electronic Commerce (EC), 347-356. New York: ACM.
Diaconis, P. and Graham, R. L. 1977. Spearman's Footrule as a Measure of Disarray. Journal of the Royal Statistical Society, 39(2), 262-268.
Dickerson, J. P., Procaccia, A. D., and Sandholm, T. 2013. Failure-Aware Kidney Exchange. In Proceedings of the 14th ACM Conference on Electronic Commerce (EC), 323-340. New York ACM.
Dickerson, J. P., Goldman, J., Karp, J., Procaccia, A. D., and Sandholm, T. 2014. The Computational Rise and Fall of Fairness. In Proceedings of the 28th AAAI Conference on Artificial Intelligence, 1405-1411. Palo Alto, CA: AAAI.
Dietrich, F. 2007. A Generalised Model of Judgment Aggregation. Social Choice and Welfare, 28(4), 529-565.
Dietrich, F. 2014. Scoring Rules for Judgment Aggregation. Social Choice and Welfare, 42, 873-911.
Dietrich, F. and List, C. 2004. A Model of Jury Decision Where All the Jurors Have the Same Evidence. Synthese, 142, 175-202.
Dietrich, F. and List, C. 2007a. Judgment Aggregation by Quota Rules: Majority Voting Generalized. Journal of Theoretical Politics, 19(4), 391-424.
Dietrich, F. and List, C. 2007b. Arrow's Theorem in Judgment Aggregation. Social Choice and Welfare, 29(1), 19-33.
Dietrich, F. and List, C. 2007c. Strategy-Proof Judgment Aggregation. Economics and Philosophy, 23(3), 269-300.
Dietrich, F. and List, C. 2010. Majority Voting on Restricted Domains. Journal of Economic Theory, 145(2), 512-543.
Dimitrov, D. and Sung, S. C. 2006. Top Responsiveness and Nash Stability in Coalition Formation Games. Kybernetika, 42(4), 453-460.
Dimitrov, D. and Sung, S. C. 2007. On Top Responsiveness and Strict Core Stability. Journal of Mathematical Economics, 43(2), 130-134.
Dimitrov, D., Borm, P., Hendrickx, R., and Sung, S. C. 2006. Simple Priorities and Core Stability in Hedonic Games. Social Choice and Welfare, 26(2), 421—433.
Dimopoulos, Y., Michael, L., and Athienitou, R 2009. Ceteris Paribus Preference Elicitation with Predictive Guarantees. In Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI), 1890-1895. Palo Alto, CA: AAAI.
Ding, N. and Lin, R 2014. On Computing Optimal Strategies in Open List Proportional Representation: The Two Parties Case. In Proceedings of the 28th AAAI Conference on Artificial Intelligence, 1419-1425. Palo Alto, CA: AAAI.
Dobzinski, S. and Procaccia, A. D. 2008. Frequent Manipulability of Elections: The Case of Two Voters. In Proceedings ofthe4thlnternational Conference on Web and Internet Economics (WINE), 653-664. New York: Springer.
Dodgson, C. 1876. A Method of Taking Votes on More Than Two Issues. Reprinted in McLean and Urken (1995).
Dogan, O. 2015. Monotonicity Properties Fulfilled by Resolute Refinements of Social Choice Functions. Mimeo.
Doignon, J.-P. and Falmagne, J.-C. 1994. A Polynomial Time Algorithm for Unidimensional Unfolding Representations. Journal of Algorithms, 16(2), 218-233.
Dokow, E. and Holzman, R. 2010. Aggregation of Binary Evaluations. Journal of Economic Theory, 145(2), 495-511.
Dolev, D., Feitelson, D. G., Halpern, J. Y, Kupferman, R., and Linial, N. 2012. No Justified Com-plaints: On Fair Sharing of Multiple Resources. In Proceedings of the 3rd Innovations in Theoretical Computer Science Conference (ITCS), 68-75. New York: ACM.
Dorn, B. and Schlotter, I. 2012. Multivariate Complexity Analysis of Swap Bribery. Algorithmica, 64(1), 126-151.
Douceur, J. R. and Moscibroda, T. 2007. Lottery Trees: Motivational Deployment of Networked Systems. ACM SIGCOMM Computer Communication Review, 37(4), 121-132.
Dowding, K. and Hees, M. Van. 2008. In Praise of Manipulation. British Journal of Political Science, 38(1), 1-15.
Downey, R. G. and Fellows, M. R. 1999. Parameterized Complexity.New York: Springer.
Downey, R. G. and Fellows, M. R. 2013. Fundamentals of Parameterized Complexity.New YorkSpringer.
Drèze, J. H. and Greenberg, J. 1980. Hedonic Coalitions: Optimality and Stability. Econometrica, 48(4), 987-1003.
Driessen, T. S. H. 1988. Cooperative Games, Solutions and Applications.New YorkKluwer.
Drissi-Bakhkhat, M. and Truchon, M. 2004. Maximum Likelihood Approach to Vote Aggregation with Variable probabilities. Social Choice and Welfare, 23(2), 161-185.
Drucker, R A. and Fleischer, L. K. 2012. Simpler Sybil-Proof Mechanisms for Multi-Level Marketing. In Proceedings of the 13th ACM Conference on Electronic Commerce (EC), 441-458. New York: ACM.
Drummond, J. and Boutilier, C. 2013. Elicitation and Approximately Stable Matching with Partial Preferences. In Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI), 97-105. Palo Alto, CA: AAAI.
Dubey, P. and Shapley, L. S. 1979. Mathematical Properties of the Banzhaf Power Index. Mathematics of Operations Research, 4(2), 99-131.
Dubins, L. E. and Freedman, D. A. 1981. Machiavelli and the Gale-Shapley Algorithm. American Mathematical Monthly, 88(7), 485-494.
Dubins, L. E. and Spanier, E. H. 1961. How To Cut a Cake Fairly. American Mathematical Monthly, 68(1), 1-17.
Duddy, C., Piggins, A. and Zwicker, W. S. 2013. Social Dichotomy Functions. Preprint.
Duggan, J. 2013. Uncovered Sets. Social Choice and Welfare, 41, 489–535.
Duggan, J. and Le Breton, M. 1996. Dutta's Minimal Covering Set and Shapley's Saddles. Journal of Economic Theory, 70, 257–265.
Duggan, J. and Le Breton, M. 2001. Mixed Refinements of Shapley's Saddles and Weak Tournaments. Social Choice and Welfare, 18(1), 65–78.
Duggan, J. and Schwartz, T. 2000. Strategic Manipulability Without Resoluteness or Shared Beliefs: Gibbard-Satterthwaite Generalized. Social Choice and Welfare, 17, 85–93.
Dunne, P. E. 2005. Extremal Behaviour in Multiagent Contract Negotiation. Journal of Artificial Intelligence Research (JAIR), 23, 41–78.
Durán, E. A., Bilbao, J. M., García, J. R. F., and López, J. J. 2003. Computing Power Indices in Weighted Multiple Majority Games. Mathematical Social Sciences, 46(1), 63–80.
Durant, E. 2010. Hearing Aids and Methods and Apparatus for Audio Fitting Thereof. U.S. patent 20100172524A1.
Dutta, B. 1988. Covering Sets and a New Condorcet Choice Correspondence. Journal of Economic Theory, 44, 63–80.
Dutta, B. and Laslier, J.-F. 1999. Comparison Functions and Choice Correspondences. Social Choice and Welfare, 16(4), 513–532.
Dutta, B. and Pattanaik, P. K. 1978. On Nicely Consistent Voting Systems. Econometrica, 46(1), 163–170.
Dutta, B., Jackson, M., and Le Breton, M. 2001. Strategic Candidacy and Voting Procedures. Econometrica, 69(4), 1013–1037.
Dwork, C., Kumar, R., Naor, M., and Sivakumar, D. 2001. Rank Aggregation Methods for the Web. In Proceedings of the 10th International Conference on the World Wide Web, 613–622. New York: ACM.
Echenique, F. and Oviedo, J. 2006. A Theory of Stability in Many-To-Many Matching Markets. Theoretical Economics, 1(2), 233–273.
Eckert, D. and Klamler, C. 2011. Distance-Based Aggregation Theory. In Consensual Processes, 3–22. New York: Springer.
Eckert, D. and Monjardet, B. 2010. Guilbaud's 1952 Theorem on the Logical Problem of Aggregation. Mathematiques et Sciences Humaines, 48(189), 19–35.
Edmonds, J. and Pruhs, K. 2006a. Balanced Allocations of Cake. In Proceedings of the 47th Annual Symposium on Foundations of Computer Science (FOCS), 623–634. New York: IEEE.
Edmonds, J. and Pruhs, K. 2006b. Cake Cutting Really is Not a Piece of Cake. In Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, 271–278. New York: ACM.
Eğeciouğlu, Ö. and Giritligil, A. E. 2013. The Impartial, Anonymous, and Neutral Culture Model: A Probability Model for Sampling Public Preference Structures. Journal of Mathematical Sociology, 37(4), 203–222.
Eğeciouğlu, Ö. and Giritligil, A. E. 2014. Anonymous and Neutral Social Choice: Existence Results on Resoluteness. Working paper 201401, Murat Sertel Center for Advanced Economic Studies.
Ehlers, L. and Klaus, B. 2004. Resource-MonotonicHouseAllocation. International Journal of Game Theory, 32, 545–560.
Ehlers, L. and Klaus, B. 2007. Consistent House Allocation. Economic Theory, 30, 561–574.
Ehlers, L. and Klaus, B. 2011. Corrigendum to “Resource-Monotonicity for House Allocation Problems.” International Journal of Game Theory, 40, 281–287.
Ehlers, L. and Klaus, B. 2014. Strategy-Proofness Makes the Difference: Deferred-Acceptance with Responsive Priorities. Mathematics of Operations Research, 39, 949–966.
Ehlers, L., Klaus, B., and Pápai, S. 2002. Strategy-Proofness and Population-Monotonicity for House Allocation Problems. Journal of Mathematical Economics, 38(3), 329–339.
Eirinakis, P., Magos, D., Mourtos, I., and Miliotis, P. 2012. Finding All Stable Pairs and Solutions to the Many-To-Many Stable Matching Problem. INFORMS Journal on Computing, 24(2), 245–259.
Eirinakis, P., Magos, D., Mourtos, I., and Miliotis, P. 2013. Finding a Minimum-Regret Many-To- Many Stable Matching. Optimization, 62(8), 1007–1018.
Elkind, E. and Erdélyi, G. 2012. Manipulation Under Voting Rule Uncertainty. In Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 627–634. Richland, SC: IFAAMAS.
Elkind, E. and Faliszewski, P. 2010. Approximation Algorithms for Campaign Management. In Proceedings of the 6th International Conference on Web and Internet Economics (WINE), 473– 482. New York: Springer.
Elkind, E. and Faliszewski, P. 2014. Recognizing 1-Euclidean Preferences: An Alternative Approach. In Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT), 146– 157. New York: Springer.
Elkind, E. and Lackner, M. 2014. On Detecting Nearly Structured Preference Profiles. In Proceedings of the 28th AAAI Conference on Artificial Intelligence, 661–667. Palo Alto, CA: AAAI.
Elkind, E. and Lipmaa, H. 2005. Hybrid Voting Protocols and Hardness of Manipulation. In Proceedings of the 16th International Symposium on Algorithms and Computation (ISAAC), 206–215. New York: Springer.
Elkind, E. and Shah, N. 2014. Electing the Most Probable without Eliminating the Irrational: Voting over Intransitive Domains. In Proceedings of the Conference on Uncertainty in Artificial Intelligence (UAI), 182–191. New York: Morgan Kaufmann.
Elkind, E. and Wooldridge, M. 2009. Hedonic Coalition Nets. In Proceedings of the 8th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 417–424. Richland, SC: IFAAMAS.
Elkind, E., Faliszewski, P., and Slinko, A. 2009a. On Distance Rationalizability of Some Voting Rules. In Proceedings of the Conference on Theoretical Aspects of Rationality and Knowledge (TARK), 201–214. New York: ACM.
Elkind, E., Goldberg, L., Goldberg, P., and Wooldridge, M. 2009b. On the Computational Complexity of Weighted Voting Games. Annals of Mathematics and Artificial Intelligence, 56(2), 109–131.
Elkind, E., Faliszewski, P., and Slinko, A. 2009c. Swap Bribery. In Proceedings of the 2nd International Symposium on Algorithmic Game Theory (SAGT), 299–310. New York: Springer.
Elkind, E., Faliszewski, P., and Slinko, A. 2010a. Good Rationalizations of Voting Rules. In Proceedings of the AAAI Conference on Artificial Intelligence, 774–779. Palo Alto, CA: AAAI.
Elkind, E., Faliszewski, P., and Slinko, A. 2010b. On the Role of Distances in Defining Voting Rules. In Proceedings of the International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 375–382. Richland, SC: IFAAMAS.
Elkind, E., Faliszewski, P., and Slinko, A. 2011a. Cloning in Elections: Finding the PossibleWinners. Journal of Artificial Intelligence Research (JAIR), 42, 529–573.
Elkind, E., Faliszewski, P., and Slinko, A. 2011b. Homogeneity and Monotonicity of Distance- Rationalizable Voting Rules. In Proceedings of the International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 821–828. Richland, SC: IFAAMAS.
Elkind, E., Faliszewski, P., and Slinko, A. 2012a. Clone Structures in Voters' Preferences. In Proceedings of the 13th ACM Conference on Electronic Commerce (EC), 496–513. New York: ACM.
Elkind, E., Faliszewski, P., and Slinko, A. 2012b. Rationalizations of Condorcet-Consistent Rules via Distances of Hamming Type. Social Choice and Welfare, 4(39), 891–905.
Elkind, E., Rahwan, T., and Jennings, N. R. 2013. Computational Coalition Formation. In Multiagent Systems, 329–380. Cambridge, MA: MIT Press.
Elkind, E., Faliszewski, P., Skowron, P., and Slinko, A. 2014a. Properties of Multiwinner Voting Rules. In Proceedings of the 13th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 53–60. Richland, SC: IFAAMAS.
Elkind, E., Grandi, U., Rossi, F., and Slinko, A. 2014b. Games Gibbard-Satterthwaite Manipulators Play. In Proceedings of the 5th International Workshop on Computational Social Choice (COMSOC).
Elkind, E., Lang, J., and Saffidine, A. 2015a. Condorcet Winning Sets. Social Choice and Welfare, 44(3), 493–517.
Elkind, E., Faliszewski, P., Lackner, M., and Obraztsova, S. 2015b. The Complexity of Recognizing Incomplete Single-Crossing Elections. In Proceedings of the 29th AAAI Conference on ArtificialIntelligence, 865–871. Palo Alto, CA: AAAI.
Emek, Y., Karidi, R., Tennenholtz, M., and Zohar, A. 2011. Mechanisms for Multi-Level Marketing. In Proceedings of the 12th ACM Conference on Electronic Commerce (EC), 209–218. New York: ACM.
Endriss, U. 2011. Logic and Social Choice Theory. In Logic and Philosophy Today, vol. 2, ed. Gupta, A., and van Benthem, J., 333–377. London: College Publications.
Endriss, U. 2013. Reduction of Economic Inequality in Combinatorial Domains. In Proceedingsof the 12th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 175–182. Richland, SC: IFAAMAS.
Endriss, U. and Fernández, R. 2013. Collective Annotation of Linguistic Resources: Basic Principles and a Formal Model. In Proceedings of the 51st Annual Meeting of the Association forComputational Linguistics (ACL), 539–549. Stroudsburg, PA: ACL.
Endriss, U. and Grandi, U. 2014. Binary Aggregation by Selection of the Most Representative Voter. In Proceedings of the 28th AAAI Conference on Artificial Intelligence, Palo Alto, CA: AAAI.
Endriss, U. and Maudet, N. 2005. On the Communication Complexity of Multilateral Trading: Extended Report. Journal of Autonomous Agents and Multi-Agent Systems, 11(1), 91–107.
Endriss, U., Maudet, N., Sadri, F., and Toni, F. 2006. Negotiating Socially Optimal Allocations of Resources. Journal of Artificial Intelligence Research (JAIR), 25, 315–348.
Endriss, U., Pini, M. S., Rossi, F., and Venable, K. B. 2009. Preference Aggregation over Restricted Ballot Languages: Sincerity and Strategy-Proofness. In Proceedings of the 21st International JointConference on Artificial Intelligence (IJCAI), 122–127. Palo Alto, CA: AAAI.
Endriss, U., Grandi, U., and Porello, D. 2012. Complexity of Judgment Aggregation. Journal ofArtificial Intelligence Research (JAIR), 45, 481–514.
Ephrati, E. and Rosenschein, J. S. 1993. Multi-Agent Planning as a Dynamic Search for Social Consensus. In Proceedings of the 13th International Joint Conference on Artificial Intelligence (IJCAI), 423–429.
Palo, Alto, CA: AAAI. Erdélyi, G. and Rothe, J. 2010. Control Complexity in Fallback Voting. In Proceedings of Computing:The 16th Australasian Theory Symposium, 39–48. Darlinghurst: ACS.
Erdélyi, G., Nowak, M., and Rothe, J. 2009. Sincere-Strategy Preference-Based Approval Voting Fully Resists Constructive Control and Broadly Resists Destructive Control. Mathematical LogicQuarterly, 55(1), 425–443.
Erdélyi, G., Piras, L., and Rothe, J. 2011. The Complexity of Voter Partition in Bucklin and Fallback Voting: Solving Three Open Problems. In Proceedings of the 10th International Conference onAutonomous Agents and Multiagent Systems (AAMAS), 837–844. Richland, SC: IFAAMAS.
Erdélyi, G., Fellows, M. R., Rothe, J., and Schend, L. 2015a. Control Complexity in Bucklin and Fallback Voting: A Theoretical Analysis. Journal of Computer and System Sciences, 81(4), 632–660.
Erdélyi, G., Fellows, M. R., Rothe, J., and Schend, L. 2015b. Control Complexity in Bucklin and Fallback Voting: An Experimental Analysis. Journal of Computer and System Sciences, 81(4), 661–670.
Erdös, P. and Moser, L. 1964. On the Representation of Directed Graphs as Unions of Orderings. Publications of the Mathematical Institute of the Hungarian Academy of Science, 9, 125–132.
Ergin, H. 2000. Consistency in House Allocation Problems. Journal of Mathematical Economics, 34(1), 77–97.
Escoffier, B., Lang, J., and Ö ztürk, M. 2008. Single-Peaked Consistency and Its Complexity. In Proceedings of the 8th European Conference on Artificial Intelligence (ECAI), 366–370. Amsterdam: IOS Press.
Escoffier, B., Gourvès, L., and Monnot, J. 2013. Fair Solutions for Some Multiagent Optimization Problems. Autonomous Agents and Multi-Agent Systems, 26(2), 184–201.
Even, S. and Paz, A. 1984. A Note on Cake-Cutting. Discrete Applied Mathematics, 7, 285–296.
Everaere, P., Konieczny, S., and Marquis, P. 2014. Counting Votes for Aggregating Judgments. In Proceedings of the 13th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 1177–1184. Richland, SC: IFAAMAS.
Fabrikant, A., Papadimitriou, C. H., and Talwar, K. 2004. The Complexity of Pure Nash Equilibria. In Proceedings of the 36th ACM Symposium on Theory of Computing (STOC), 504–612. New York: ACM.
Fagin, R., Kumar, R., and Sivakumar, D. 2003. Efficient Similarity Search and Classification via Rank Aggregation. In Proceedings of the 2003 ACMSIGMOD International Conference on Managementof Data, 301–312. New York: ACM.
Faliszewski, P. 2008. Non uniform Bribery. In Proceedings of the 7th International Conference onAutonomous Agents and Multiagent Systems (AAMAS), 1569–1572. Richland, SC: IFAAMAS.
Faliszewski, P. and Hemaspaandra, L. 2009. The Complexity of Power-Index Comparison. TheoreticalComputer Science, 410(1), 101–107.
Faliszewski, P. and Procaccia, A. D. 2010. AI's War on Manipulation: Are We Winning?AI Magazine, 31(4), 53–64.
Faliszewski, P., Hemaspaandra, E., and Schnoor, H. 2008. Copeland Voting: Ties Matter. In Proceedingsof the 7th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 983–990. Richland, SC: IFAAMAS.
Faliszewski, P., Elkind, E., and Wooldridge, M. 2009a. Boolean Combinations of Weighted Voting Games. In Proceedings of the 8th International Conference on Autonomous Agents and MultiagentSystems (AAMAS), 185–192. Richland, SC: IFAAMAS.
Faliszewski, P., Hemaspaandra, E., and Hemaspaandra, L. 2009b. How Hard Is Bribery in Elections?Journal of Artificial Intelligence Research (JAIR), 35, 485–532.
Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L., and Rothe, J. 2009c. Llull and Copeland Voting Computationally Resist Bribery and Constructive Control. Journal of Artificial IntelligenceResearch (JAIR), 35, 275–341.
Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L., and Rothe, J. 2009d. A Richer Understanding of the Complexity of Election Systems. In Fundamental Problems in Computing: Essays in Honorof Professor Daniel J. Rosenkrantz, ed. Ravi, S., and Shukla, S., 375–406. New York: Springer.
Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L. A., and Rothe, J. 2009e. The Shield that Never Was: Societies with Single-Peaked Preferences are More Open to Manipulation and Control. In Proceedings of the Conference on Theoretical Aspects of Rationality and Knowledge (TARK), 118–127. New York: ACM.
Faliszewski, P., Hemaspaandra, E., and Hemaspaandra, L. 2010. Using Complexity to Protect Elections. Communications of the ACM, 53(11), 74–82.
Faliszewski, P., Hemaspaandra, E., and Hemaspaandra, L. 2011a. The Complexity of Manipulative Attacks in Nearly Single-Peaked Electorates. In Proceedings of the 13th Conference on TheoreticalAspects of Rationality and Knowledge (TARK), 228–237. New York: ACM.
Faliszewski, P., Hemaspaandra, E., and Hemaspaandra, L. 2011b. Multimode Control Attacks on Elections. Journal of Artificial Intelligence Research (JAIR), 40, 305–351.
Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L., and Rothe, J. 2011c. The Shield that Never Was: Societies with Single-Peaked Preferences are More Open to Manipulation and Control. Information and Computation, 209(2), 89–107.
Faliszewski, P., Hemaspaandra, E., and Hemaspaandra, L. 2013. Weighted Electoral Control. In Proceedings of the 12th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 367–374. Richland, SC: IFAAMAS.
Faliszewski, P., Hemaspaandra, E., and Hemaspaandra, L. A. 2014. The complexity of Manipulative Attacks in Nearly Single-Peaked Electorates. Artificial Intelligence, 207, 69–99.
Faliszewski, P., Reisch, Y., Rothe, J., and Schend, L. 2015. Complexity of Manipulation, Bribery, and Campaign Management in Bucklin and Fallback Voting. Journal of Autonomous Agents andMulti-Agent Systems, 29(6), 1091–1124.
Farkas, D. and Nitzan, S. 1979. The Borda Rule and Pareto Stability: A Comment. Econometrica, 47(5), 1305–1306.
Farquharson, R. 1969. Theory of Voting. New Haven|CT: Yale University Press.
Fatima, S. S., Wooldridge, M., and Jennings, N. R. 2008. A Linear Approximation Method for the Shapley Value. Artificial Intelligence Journal, 172(14), 1673–1699.
Favardin, P. and Lepelley, D. 2006. Some Further Results on the Manipulability of Social Choice Rules. Social Choice and Welfare, 26(3), 485–509.
Favardin, P., Lepelley, D., and Serais, J. 2002. Borda Rule, Copeland Method and Strategic Manipulation. Review of Economic Design, 7(2), 213–228.
Feige, U. 1998. A Threshold of ln n for Approximating Set Cover. Journal of the ACM, 45(4), 643–652.
Fekete, S. P., Skutella, M., and Woeginger, G. J. 2003. The Complexity of Economic Equilibria for House Allocation Markets. Information Processing Letters, 88, 219–223.
Fellows, M. R., Jansen, B., Lokshtanov, D., Rosamond, F., and Saurabh, S. 2010. Determining the Winner of a Dodgson Election is Hard. In Proceedings of the 29th Conference on Foundations ofSoftware Technology and Theoretical Computer Science, 459–469. Dagstuhl: LIPICS.
Felsenthal, D. and Machover, M. 1998. The Measurement of Voting Power. Cheltenham, UK: Edward Elgar.
Fey, M. 2008. Choosing from a Large Tournament. Social Choice and Welfare, 31(2), 301–309.
Fischer, F. and Klimm, M. 2014. Optimal Impartial Selection. In Proceedings of the 15th ACMConference on Economics and Computation (EC), 803–820. New York: ACM.
Fischer, F., Procaccia, A. D., and Samorodnitsky, A. 2011. A New Perspective on Implementation by Voting Trees. Random Structures and Algorithms, 39(1), 59–82.
Fishburn, P. C. 1970. Utility Theory for Decision-Making. New York: John Wiley.
Fishburn, P. C. 1972. Even-Chance Lotteries in Social Choice Theory. Theory and Decision, 3, 18–40.
Fishburn, P. C. 1977. Condorcet Social Choice Functions. SIAM Journal on Applied Mathematics, 33(3), 469–489.
Fishburn, P. C. 1982. Monotonicity Paradoxes in the Theory of Elections. Discrete Applied Mathematics, 4(2), 119–134.
Fishburn, P. C. 1984. Probabilistic Social Choice Based on Simple Voting Comparisons. Review ofEconomic Studies, 51(167), 683–692.
Fishburn, P. C. 1985. Interval Orders and Interval Graphs: A Study of Partially Ordered Sets. Hoboken, NJ: Wiley.
Fisher, D. C. and Reeves, R. B. 1995. Optimal Strategies for Random Tournament Games. Linear Algebra and Its Applications, 217, 83–85.
Fisher, D. C. and Ryan, J. 1995. Tournament Games and Positive Tournaments. Journal of GraphTheory, 19(2), 217–236.
Fitzsimmons, Z., Hemaspaandra, E., and Hemaspaandra, L. 2013. Control in the Presence of Manipulators: Cooperative and Competitive Cases. In Proceedings of the 23rd International Joint Conferenceon Artificial Intelligence (IJCAI), 113–119. Palo Alto, CA: AAAI.
Fleiner, T. 2003. On the Stable b-Matching Polytope. Mathematical Social Sciences, 46(2), 149–158.
Fleurbaey, M. And Maniquet, F. 2011. A Theory of Fairness and Social Welfare. New York: Cambridge University Press.
Foley, D. K. 1967. Resource Allocation and the Public Sector. Yale Economic Essays, 7(1), 45–98.
Fomin, F. V. and Kratsch, D. 2010. Exact Exponential Algorithms. New York: Springer.
Fomin, F. V., Lokshtanov, D., Raman, V., and Saurabh, S. 2010. Fast Local Search Algorithm for Weighted Feedback Arc Set in Tournaments. In Proceedings of the 24th AAAI Conference onArtificial Intelligence, 65–70. Palo Alto, CA: AAAI.
Frances, M. and Litman, A. 1997. On Covering Problems of Codes. Theory of Computing Systems, 30, 113–119.
Freeman, R., Brill, M., and Conitzer, V. 2014. On the Axiomatic Characterization of Runoff Voting Rules. In Proceedings of the 28th AAAI Conference on Artificial Intelligence, 675–681. Palo Alto, CA: AAAI.
Freeman, R., Brill, M., and Conitzer, V. 2015. General Tiebreaking Schemes for Computational Social Choice. In Proceedings of the 14th International Conference on Autonomous Agents andMultiagent Systems (AAMAS), 1401–1409. Richland, SC: IFAAMAS.
Freixas, J. and Zwicker, W. S. 2009. Anonymous Yes-No Voting with Abstention and Multiple Levels of Approval. Games and Economic Behavior, 67, 428–444.
Friedgut, E., Kalai, G., and Nisan, N. 2008. Elections Can Be Manipulated Often. In Proceedings ofthe Annual Symposium on Foundations of Computer Science (FOCS), 243–249. New York: IEEE. Gaertner, W. 2006. A Primer in Social Choice Theory. New York: Oxford University Press.
Gairing, M. and Savani, R. 2010. Computing Stable Outcomes in Hedonic Games. In Proceedingsof the 3rd International Symposium on Algorithmic Game Theory (SAGT), 174–185. New York: Springer.
Gairing, M. and Savani, R. 2011. Computing Stable Outcomes in Hedonic Games with Voting- Based Deviations. In Proceedings of the 10th International Conference on Autonomous Agentsand Multiagent Systems (AAMAS), 559–566. Richland, SC: IFAAMAS.
Gale, D. and Shapley, L. S. 1962. College Admissions and the Stability of Marriage. AmericanMathematical Monthly, 69, 9–15.
Gale, D. and Sotomayor, M. 1985. Some Remarks on the Stable Matching Problem. Discrete AppliedMathematics, 11, 223–232.
Gamson, W. A. 1961. A Theory of Coalition Formation. American Sociological Review, 26, 373–382.
Gärdenfors, P. 1975. Match Making: Assignments Based on Bilateral Preferences. BehaviouralScience, 20, 166–173.
Gärdenfors, P. 1976. Manipulation of Social Choice Functions. Journal of Economic Theory, 13, 217–228.
Gärdenfors, P. 1979. On Definitions of Manipulation of Social Choice Functions. In Aggregation andRevelation of Preferences, ed. Laffont, J. J., 29–36. Amsterdam: North-Holland.
Gärdenfors, P. 2006. A Representation Theorem for Voting with Logical Consequences. Economicsand Philosophy, 22(2), 181–190.
Garey, M. R. and Johnson, D. S. 1979. Computers and Intractability: A Guide to the Theory ofNP-Completeness. New York: W. H. Freeman.
Garman, M. B. and Kamien, M. I. 1968. The Paradox of Voting: Probability Calculations. BehavioralScience, 13(4), 306–316.
Gaspers, S., Kalinowski, T., Narodytska, N., and Walsh, T. 2013. Coalitional Manipulation for Schulze's Rule. In Proceedings of the International Conference on Autonomous Agents and MultiagentSystems (AAMAS), 431–438. Richland, SC: IFAAMAS.
Gehrlein, W. V. 2002. Condorcet's Paradox and the Likelihood of Its Occurrence: Different Perspectives on Balanced Preferences. Theory and Decision, 52, 171–199.
Gehrlein, W. V. 2006. Condorcet's Paradox. New York: Springer.
Gehrlein, W. V. and Fishburn, P. C. 1976. Condorcet's Paradox and Anonymous Preference Profiles. Public Choice, 26(1), 1–18.
Gehrlein, W. V. and Fishburn, P. C. 1978. Coincidence Probabilities for Simple Majority and Positional Voting Rules. Social Science Research, 7(3), 272–283.
Geist, C. and Endriss, U. 2011. Automated Search for Impossibility Theorems in Social Choice Theory: Ranking Sets of Objects. Journal of Artificial Intelligence Research (JAIR), 40, 143– 174.
Gelain, M., Pini, M. S., Rossi, F., Venable, K. B., and Walsh, T. 2010. Elicitation Strategies for Soft Constraint Problems with Missing Preferences: Properties, Algorithms and Experimental Studies. Artificial Intelligence, 174(3–4), 270–294.
Gelain, M., Pini, M. S., Rossi, F., Venable, K. B., and Walsh, T. 2013. Local Search Approaches in Stable Matching Problems. Algorithms, 6(4), 591–617.
Ghodsi, A., Zaharia, M., Hindman, B., Konwinski, A., Shenker, S., and Stoica, I. 2011. Dominant Resource Fairness: Fair Allocation of Multiple Resource Types. In Proceedings of the 8th USENIXConference on Networked Systems Design and Implementation (NSDI), 24–37.
Berkeley: USENIX. Gibbard, A. 1973. Manipulation of Voting Schemes: A General Result. Econometrica, 41, 587–601.
Gibbard, A. 1977. Manipulation of Schemes that Mix Voting with Chance. Econometrica, 45, 665– 681.
Gillies, D. B. 1959. Solutions to General Non-zero-sum Games. In Contributions to the Theory of Games IV, ed. Tucker, A. W., and Luce, R. D., 47–85. Princeton, NJ: Princeton University Press.
Glorie, K. M., van de Klundert, J. J., and Wagelmans, A. P. M. 2014. Kidney Exchange with Long Chains: An Efficient Pricing Algorithm for Clearing Barter Exchanges with Branch-and-Price.
Manufacturing & Service Operations Management, 16(4), 498–512.
Goel, A. and Lee, D. 2012. Triadic Consensus: A Randomized Algorithm for Voting in a Crowd. In Proceedings of the 8th International Conference on Web and Internet Economics (WINE), 434–477. New York: Springer.
Golovin, D. 2005. Max-Min Fair Allocation of Indivisible Goods. Technical Report CMU-CS-05-144, School of Computer Science, Carnegie Mellon University.
Gonzales, C. and Perny, P. 2004. GAI Networks for Utility Elicitation. In Proceedings of the 9thInternational Conference on Principles of Knowledge Representation and Reasoning (KR), 224– 234. Pal Alto, CA: AAAI Press.
Gonzales, C., Perny, P., and Queiroz, S. 2008. Preference Aggregation with Graphical Utility Models. In Proceedings of the AAAI Conference on Artificial Intelligence, 1037–1042. Palo Alto, CA: AAAI.
Good, I. J. 1971. A Note on Condorcet Sets. Public Choice, 10, 97–101.
Gordon, S. and Truchon, M. 2008. Social Choice, Optimal Inference and Figure Skating. SocialChoice and Welfare, 30(2), 265–284.
Gourvès, L., Monnot, J., and Tlilane, L. 2013. A Matroid Approach to the Worst Case Allocation of Indivisible Goods. In Proceedings of the 23rd International Joint Conference on ArtificialIntelligence (IJCAI), 136–142. Palo Alto, CA: AAAI.
Grabisch, M. 1997. k-order Additive Discrete Fuzzy Measure and Their Representation. Fuzzy Setsand Systems, 92, 167–189.
Graham, R. L. 1969. Bounds on Multiprocessing Timing Anomalies. SIAM Journal of AppliedMathematics, 17, 416–429.
Grandi, U. and Endriss, U. 2011. Binary Aggregation with Integrity Constraints. In Proceedings ofthe International Joint Conference on Artificial Intelligence (IJCAI), 204–209. Palo Alto, CA: AAAI.
Grandi, U. and Endriss, U. 2013. Lifting Integrity Constraints in Binary Aggregation. Artificial Intelligence, 199-200, 45-66.
Grandi, U., Loreggia, A., Rossi, R, Venable, K. B., and Walsh, T. 2013. Restricted Manipulation in Iterative Voting: Condorcet Efficiency and Borda Score.In Proceedings of the 3rd International Conference on Algorithmic Decision Theory (ADT), 181-192. New York: Springer.
Groh, C, Moldovanu, B., Sela, A., and Sunde, U. 2012. Optimal Seedings in Elimination Tourna¬ments. Economic Theory, 49(1), 59-80.
Grossi, D. and Pigozzi, G. 2014. Judgment Aggregation: A Primer.San Rafael, CA: Morgan and Claypool.
Guha, R., Kumar, R., Raghavan, P., and Tomkins, A. 2004. Propagation of Trust and Distrust.In Proceedings of the 13th International Conference on the World Wide Web, 403-412. New York: ACM.
Guilbaud, G.-T. 1952. Les Théories de l'Intérêt Général et le Problème Logique de l'AgrÉgation. économie Appliquée, 5(4), 501-584. English translation appears in Journal Électronique d'Histoire des Probabilités et de la Statistique, 44(1), 57, 2008.
Guo, J. and Niedermeier, R. 2007. Invitation to Data Reduction and Problem Kernelization. ACM SIGACTNews, 38(1), 31-45.
Gusfield, D. and Irving, R. W. 1989. The Stable Marriage Problem: Structure and Algorithms.Cambridge, MA: MIT Press.
Gutman, A. and Nisan, N. 2012. Fair Allocation without Trade.In Proceedings of the 11th Interna-tional Conference on Autonomous Agents andMultiagent Systems (AAMAS), 719-728. Richland, SC: IFAAMAS.
Hajduková, J. 2006. Coalition Formation Games: A Survey. International Game Theory Review, 8(4), 613-641.
Hammond, P. 1991. Interpersonal Comparisons of Utility: Why and How They Are and Should Be Made.In Interpersonal Comparisons of Weil-Being, ed. Elster, J., and Roemer, J., 200-254. New York: Cambridge University Press.
Hare, T. 1859. Treatise on the Election of Representatives, Parliamentary and Municipal.London: Longman, Green, Reader, and Dyer.
Hartvigsen, D. 2006. Vote Trading in Public Elections. Mathematical Social Sciences, 52(1), 31-48.
Hazon, N. and Elkind, E. 2010. Complexity of Safe Strategic Voting.In Proceedings of the 3rd International Symposium on Algorithmic Game Theory (SAGT), 210-221.New York: Springer.
Hazon, N., Dunne, P. E., Kraus, S., and Wooldridge, M. 2008. How to Rig Elections and Competitions. In Proceedings of the 2nd International Workshop on Computational Social Choice (COMSOC).
Hazon, N., Aumann, Y, Kraus, S., and Wooldridge, M. 2012. On the Evaluation of Election Outcomes Under Uncertainty. Artificial Intelligence, 189, 1-18.
Hazon, N., Lin, R., and Kraus, S. 2013. How to Change a Group's Collective Decision? In Proceedings of the 23rd AAAI Conference on Artificial Intelligence, 198-205. Palo Alto, CA: AAAI.
Hemachandra, L. 1989. The Strong Exponential Hierarchy Collapses. Journal of Computer and System Sciences, 39(3), 299-322.
Hemaspaandra, E. and Hemaspaandra, L. 2007. Dichotomy for Voting Systems. Journal of Computer and System Sciences, 73(1), 73-83.
Hemaspaandra, L. and Ogihara, M. 2002. The Complexity Theory Companion.New York: Springer.
Hemaspaandra, L. and Williams, R. 2012. An Atypical Survey of Typical-Case Heuristic Algorithms. SIGACT News, 43(4), 71-89.
Hemaspaandra, E. and Rothe, J. 1998. Recognizing When Greed Can Approximate Maximum Inde-pendent Sets Is Complete for Parallel Access to NP. Information Processing Letters, 65(3), 151-156.
Hemachandra, L. and Wechsung, G. 1991. Kolmogorov Characterizations of Complexity Classes. Theoretical Computer Science, 83, 313-322.
Hemaspaandra, E., Hemaspaandra, L., and Rothe, J. 1997a. Exact Analysis of Dodgson Elections: Lewis Carroll's 1876 Voting System is Complete for Parallel Access to NP. Journal of the ACM, 44(6), 806-825.
Hemaspaandra, E., Hemaspaandra, L., and Rothe, J. 1997b. Raising NP Lower Bounds to Parallel NP Lower Bounds. SIGACT News, 28(2), 2-13.
Hemaspaandra, E., Spakowski, H., and Vogel, J. 2005. The Complexity of Kemeny Elections. Theoretical Computer Science, 349(3), 382-391.
Hemaspaandra, E., Hemaspaandra, L., and Rothe, J. 2007. Anyone But Him: The Complexity of Precluding an Alternative. Artificial Intelligence, 171(5-6), 255-285.
Hemaspaandra, E., Hemaspaandra, L., and Rothe, J. 2009. Hybrid Elections Broaden Complexity-Theoretic Resistance to Control. Mathematical Logic Quarterly, 55(4), 397-424.
Hemaspaandra, E., Hemaspaandra, L., and Rothe, J. 2012a. Controlling Candidate-Sequential Elec-tions.In Proceedings of the 20th European Conference on Artificial Intelligence (ECAI), 905-906. Amsterdam: IOS Press.
Hemaspaandra, E., Hemaspaandra, L., and Rothe, J. 2012b. Online Voter Control in Sequential Elections.In Proceedings of the 20th European Conference on Artificial Intelligence (ECAI), 396-401. Amsterdam: IOS Press.
Hemaspaandra, E., Hemaspaandra, L., and Menton, C. 2013a. Search versus Decision for Election Manipulation Problems.In Proceedings of the 30th Annual Symposium on Theoretical Aspects of Computer Science, 377-388. Dagstuhl: LIPICS.
Hemaspaandra, L., Lavaee, R., and Menton, C. 2013b. Schulze and Ranked-Pairs Voting Are Fixed-Parameter Tractable to Bribe, Manipulate, and Control.In Proceedings of the 12th International Conference on Autonomous Agents andMultiagent Systems (AAMAS), 1345-1346. Richland, SC: IFAAMAS.
Hemaspaandra, E., Hemaspaandra, L., and Rothe, J. 2014a. The Complexity of Online Manipulation of Sequential Elections. Journal of Computer and System Sciences, 80(4), 697-710.
Hemaspaandra, E., Hemaspaandra, L., and Schnoor, H. 2014b. A Control Dichotomy for Pure Scoring Rules. In Proceedings of the 28th AAAI Conference on Artificial Intelligence, 712-720. Palo Alto, CA: AAAI.
Hemaspaandra, L. A., Lavaee, R., and Menton, C. 2014c. Schulze and Ranked-Pairs Voting Are Fixed-Parameter Tractable to Bribe, Manipulate, and Control. CoRR, abs/1210.6963.
Hemaspaandra, E., Hemaspaandra, L., and Rothe, J. 2015. The Complexity of Manipulative Actions in Single-Peaked Societies. In Economics and Computation: An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division, ed. Rothe, J., Chapter 5, 327-360. New York: Springer.
Henriet, D. 1985. The Copeland Choice Function: An Axiomatic Characterization. Social Choice and Welfare, 2(1), 49-63.
Herreiner, D. K. and Puppe, C. D. 2002. A Simple Procedure for Finding Equitable Allocations of Indivisible Goods. Social Choice and Welfare, 19, 415-430.
Herreiner, D. K. and Puppe, C. D. 2009. Envy Freeness in Experimental Fair Division Problems. Theory and Decision, 67(1), 65-100.
Hillinger, C. 2005. The Case for Utilitarian Voting. Discussion Papers in Economics No. 653, University of Munich.
Hoag, C. G. and Hallett, G. H., eds. 1926. Proportional Representation.New York: Macmillan.
Hojati, M. 1996. Optimal Political Districting. Computers & OR, 23(12), 1147-1161.
Holler, M. J. 1982. Forming Coalitions and Measuring Voting Power. Political Studies, 30, 262-271.
Homan, C. and Hemaspaandra, L. 2009. Guarantees for the Success Frequency of an Algorithm for Finding Dodgson-Election Winners. Journal of Heuristics, 15(4), 403-423.
Homeshaw, J. 2001. Inventing Hare-Clark: The Model Arithmetocracy. In Elections: Full, Free and Fair, ed. Sawer, M., 96-114. Annandale: The Federation Press.
Horen, J. and Riezman, R. 1985. Comparing Draws for Single Elimination Tournaments. Op. Research, 33(2), 1401-1409.
Horan, S. 2013. Implementation of Majority Voting Rules. Working paper.
Houy, N. 2009a. A Few New Results on TEQ. Mimeo.
Houy, N. 2009b. Still More on the Tournament Equilibrium Set. Social Choice and Welfare, 32, 93-99.
Howard, R. A. and Matheson, J. E. 1984. Influence Diagrams. In Readings on the Principles and Applications of Decision Analysis, vol. 2, ed. Howard, R. A., and Matheson, J. E., 720-761. Menlo Park, CA: Strategic Decision Group.
Huang, C. C. and Kavitha, T. 2012. Weight-Maximal Matchings. In Proceedings of MATCH-UP ‘12: The 2nd International Workshop on Matching Under Preferences, 87-98.
Huang, J. and Guestrin, C. 2009. Riffled Independence for Ranked Data. In Advances in Neural Information Processing Systems 21, 799-807. Cambridge, MA: MIT.
Hudry, O. 1989. Recherche d'ordres Medians: Complexite, Algorithmique et Problemes Combinatoires. PhD thesis, Telecom Paris Tech.
Hudry, O. 2004. A Note on “Banks Winners in Tournaments are Difficult to Recognize” by G. J. Woeginger. Social Choice and Welfare, 23, 113-114.
Hudry, O. 2008. NP-Hardness Results for the Aggregation of Linear Orders into Median Orders. Annals of Operations Research, 163(1), 63-88.
Hudry, O. 2009. A Survey on the Complexity of Tournament Solutions. Mathematical Social Sciences, 57(3), 292-303.
Hudry, O. 2010. On the Complexity of Slater's Problems. European Journal of Operational Research, 203(1), 216-221.
Hudry, O. 2012. On the Computation of Median Linear Orders, of Median Complete Preorders and of Median Weak Orders. Mathematical Social Sciences, 64, 2-10.
Hylland, A. and Zeckhauser, R. 1979. The Efficient Allocation of Individuals to Positions. Journal of Political Economy, 87(2), 293-314.
Ianovski, E., Yu, L., Elkind, E., and Wilson, M. C. 2011. The Complexity of Safe Manipulation Under Scoring Rules. In Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI), 246-251. Palo Alto, CA: AAAI.
Ibaraki, T. and Katoh, N. 1983. On-Line Computation of Transitive Closures of Graphs. Information Processing Letters, 16, 95-97.
Ieong, S. and Shoham, Y. 2005. Marginal Contribution Nets: A Compact Representation Scheme for Coalitional Games. In Proceedings of the 6th ACM Conference on Electronic Commerce (EC), 193-202. New York: ACM.
Immorlica, N. and Mahdian, M. 2005. Marriage, Honesty and Stability. In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 53-62. New York: ACM-SIAM.
Irving, R. W. 1985. An Efficient Algorithm for the “Stable Roommates” Problem. Journal of Algo¬rithms, 6(4), 577-595.
Irving, R. W. 1994. Stable Marriage and Indifference. Discrete AppliedMathematics, 48(3), 261-272.
Irving, R. W. 2008. Stable Marriage. In Encyclopedia of Algorithms, ed. Kao, M. Y, 877-879. New York: Springer.
Irving, R. W. and Leather, P. 1986. The Complexity of Counting Stable Marriages. SIAM Journal on Computing, 15(3), 655-667.
Irving, R. W., Manlove, D. R, and Scott, S. 2000. The Hospitals/Residents Problem with Ties. In Proceedings of the 7th Scandinavian Workshop on Algorithm Theory (SWAT), 259-271. New York: Springer.
Irving, R. W., Manlove, D. R, and Scott, S. 2003. Strong Stability in the Hospitals/Residents Problem. In Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science (STACS), 439-450. New York: Springer.
Irving, R. W., Kavitha, T., Mehlhorn, K., Michail, D., and Paluch, K. 2006. Rank-Maximal Matchings. ACM Transactions on Algorithms, 2(4), 602-610.
Isaksson, M., Kindler, G., and Mossel, E. 2012. The Geometry of Manipulation: A Quantitative Proof of the Gibbard-Satterthwaite Theorem. Combinatorica, 32(2), 221-250.
Iwama, K., Manlove, D., Miyazaki, S., and Morita, Y 1999. Stable Marriage with Incomplete Lists and Ties. In Proceedings of the 26th International Colloquium on Automata, Languages, and Programming (ICALP), 443-452. New York: Springer.
Jackson, B. N., Schnable, P. S., and Aluru, S. 2008. Consensus Genetic Maps as Median Orders from Inconsistent Sources. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 5(2), 161-171.
Johnson, D. S., Papadimitriou, C. H., and Yannakakis, M. 1988. How Easy Is Local Search?Journal of Computer and System Sciences, 37, 79-100.
Johnson, R. J., Allen, J. E., Fuggle, S. V., Bradley, J. A., and Rudge, C. J. 2008. Early Experience of Paired Living Kidney Donation in the United Kingdom. Transplantation, 86, 1672-1677.
Ju, B.-G. 2003. A Characterization of Strategy-Proof Voting Rules for Separable Weak Orderings. Social Choice and Welfare, 21(3), 469-499.
Kadane, J. 1972. On Division of the Question. Public Choice, 13, 47-54.
Kadin, J. 1989. PNp[log n] and Sparse Turing-Complete Sets for NP. Journal of Computer and System Sciences, 39(3), 282-298.
Kalech, M., Kraus, S., Kaminka, G. A., and Goldman, C. V. 2011. Practical Voting Rules with Partial Information. Journal of Autonomous Agents and Multi-Agent Systems, 22(1), 151-182.
Kalinowski, T., Narodytska, N., and Walsh, T. 2013. A Social Welfare Optimal Sequential Allocation Procedure. In Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI), 227-233. Palo Alto, CA: AAAI.
Kann, V 1992. On the Approximability of NP-complete Optimization Problems. PhD thesis, Royal Institute of Technology, Stockholm.
Karakaya, M. 2011. Hedonic Coalition Formation Games: A New Stability Notion. Mathematical Social Sciences, 61(3), 157-165.
Karpinski, M. and Schudy, W. 2010. Faster Algorithms for Feedback Arc Set Tournament, Kemeny Rank Aggregation and Betweenness Tournament. In Proceedings of the 21st International Symposium on Algorithms and Computation (ISAAC),3-14. New York: Springer.
Kash, I., Procaccia, A. D., and Shah, N. 2014. No Agent Left Behind: Dynamic Fair Division of Multiple Resources. Journal of Artificial Intelligence Research (JAIR), 51, 579-603.
Kavitha, T., Mehlhorn, K., Michail, D., and Paluch, K. E. 2007. Strongly Stable Matchings in Time O (nm) and Extension to the Hospitals-Residents Problem. ACM Transactions on Algorithms, 3(2), Article 15.
Kavitha, T., Mestre, J., and Nasre, M. 2011. Popular Mixed Matchings. Theoretical Computer Science, 412(24), 2679-2690.
Keeney, R. and Raiffa, H. 1976. Decision with Multiple Objectives: Preferences and Value Tradeoffs.Hoboken, NJ: John Wiley.
Keizer, K. M., de Klerk, M., Haase-Kromwijk, B. J., and Weimar, W. 2005. The Dutch Algorithm for Allocation in Living Donor Kidney Exchange. Transplantation Proceedings, 37, 589-591.
Kelly, J. S. 1977. Strategy-Proofness and Social Choice Functions without Single-Valuedness. Econometrica, 45(2), 439-446.
Kelly, J. S. 1993. Almost All Social Choice Rules are Manipulable, But a Few Aren't. Social Choice and Welfare, 10(2), 161-175.
Kelso, A. S. and Crawford, V. P. 1982. Job Matching, Coalition Formation and Gross Substitutes. Econometrica, 50, 1483-1504.
Kemeny, J. 1959. Mathematics Without Numbers. Daedalus, 88(4), 577-591.
Kemeny, J. and Snell, L. 1960. Mathematical Models in the Social Sciences. Cambridge, MA: MIT Press.
Kendall, M. 1938. A New Measure of Rank Correlation. Biometrika, 30, 81-89.
Kendall, M. 1962. Rank Correlation Methods. 3rd ed. Royal Oak, MI: Hafner.
Kendall, M. and Gibbons, J. 1990. Rank Correlation Methods. New York: Oxford University Press.
Kendall, M. and Smith, B. B. 1939. The Problem of m Rankings. Annals of Mathematical Statistics, 10, 239-251.
Kenyon-Mathieu, C. and Schudy, W. 2007. How to Rank with Few Errors. In Proceedings of the 39th ACM Symposium on Theory of Computing (STOC), 95-103. New York: ACM.
Kesten, O. 2009. Coalitional Strategy-Proofness and Resource Monotonicity for House Allocation Problems. International Journal of Game Theory, 38, 17-21.
Kesten, O. 2010. School Choice with Consent. Quarterly Journal of Economics, 125, 1297-1348.
Kfir-Dahav, N. E. and Tennenholtz, M. 1996. Multi-Agent Belief Revision. In Proceedings of the Conference on Theoretical Aspects of Rationality and Knowledge (TARK), 175-194. New York: ACM.
Kim, H. 2004. Population Monotonic Rules for Fair Allocation Problems. Social Choice and Welfare, 23(1), 59-70.
Kim, M. 2014. Kings that Win Single-Elimination Tournaments. Unpublished manuscript.
Kintali, S., Poplawski, L. J., Rajaraman, R., Sundaram, R., and Teng, S.-H. 2009. Reducibility among Fractional Stability Problems. In Proceedings of the 50th Annual Symposium on Foundations of Computer Science (FOCS), 283-292.
Kiraly, Z. 2013. Linear Time Local Approximation Algorithm for Maximum Stable Marriage. Algorithms, 6(3), 471-484.
Kirman, A. P. and Sondermann, D. 1972. Arrow's Theorem, Many Agents, and Invisible Dictators. Journal of Economic Theory, 5(3), 267-277.
Klamler, C. and Pferschy, U. 2007. The Traveling Group Problem. Social Choice and Welfare, 29(3), 429-452.
Klaus, B. and Klijn, F. 2006. Median Stable Matching for College Admissions. International Journal of Game Theory, 34(1), 1-11.
Klaus, B. and Walzl, M. 2009. Stable Many-To-Many Matchings with Contracts. Journal of Mathe¬matical Economics, 45, 422-434.
Kleinberg, J. M. 1999. Authoritative Sources in a Hyperlinked Environment. Journal of the ACM, 46(5), 604-632.
Kleinberg, J. M. and Raghavan, P. 2005. Query Incentive Networks. In Proceedings of the Annual Symposium on Foundations of Computer Science (FOCS), 132-141. New York: IEEE Press.
Kleinberg, J. M., Papadimitriou, C. H., and Raghavan, P. 2004. Segmentation Problems. Journal of the ACM, 51(2).
Klijn, F. and Yazici, A. 2014. A Many-To-Many Rural Hospital Theorem. Journal of Mathematical Economics, 54, 63-73.
Knuth, D. E. 1973. Selected Topics in Computer Science. Lecture Notes Series, Institute of Mathe¬matics, University of Oslo.
Knuth, D. E. 1976. Mariages stables. Montreal: Les Presses de L'Universite de Montreal.
Kojima, F. and Pathak, P. A. 2009. Incentives and Stability in Large Two-Sided Matching Markets. American Economic Review, 99, 608-627.
Kojima, F. and Ünver, M. U. 2008. Random Paths to Pairwise Stability in Many-To-Many Matching Problems: A Study on Market Equilibration. International Journal of Game Theory, 36, 473-488.
Kolm, S.-C. 1972. Justice et équité. Éd. du Centre National de la Recherche Scientifique.
Komusiewicz, C. and Niedermeier, R. 2012. New Races in Parameterized Algorithmics. In Proceedings of the 37th International Symposium on Mathematical Foundations of Computer Science, 19-30. New York: Springer.
Konczak, K. and Lang, J. 2005. Voting Procedures with Incomplete Preferences. Pages 124—129 of: Proceedings of the Multidisciplinary IJCAI-05 Workshop on Advances in Preference Handling.
Konieczny, S. and Pino Pérez, R. 2002. Merging Information Under Constraints: A Logical Frame-work. Journal of Logic and Computation, 12(5), 773-808.
Konieczny, S. and Pino Perez, R. 2011. Logic Based Merging. Journal of Philosophical Logic, 40(2), 239-270.
Konieczny, S., Lang, J., and Marquis, P. 2004. DA2 Merging Operators. Artificial Intelligence, 157(1-2), 49-79.
Konishi, H. and Ünver, M. U. 2006. Credible Group Stability in Many-To-Many Matching Problems. Journal of Economic Theory, 129, 57-80.
Koriche, R. and Zanuttini, B. 2010. Learning Conditional Preference Networks. Artificial Intelligence, 174(11), 685-703.
Kornhauser, L. A. and Sager, L. G. 1993. The One and the Many: Adjudication in Collegial Courts. California Law Review, 81(1), 1-59.
Krakel, M. 2014. Optimal Seedings in Elimination Tournaments Revisited. Economic Theory Bulletin, 2(1), 77-91.
Kreweras, G. 1965. Aggregation of Preference Orderings. In Mathematics and Social Sciences I: Proceedings of the Seminars of Menthon-Saint-Bernard, France (1-27 July 1960) and of Gösing, Austria (3-27 July 1962), 73-79.
Krysta, P., Manlove, D., Rastegari, B., and Zhang, J. 2014. Size Versus Truthfulness in the House Allocation Problem. In Proceedings of the 15th ACM Conference on Economics and Computation (EC), 453-470. New York: ACM.
Kurokawa, D., Lai, J. K., and Procaccia, A. D. 2013. How to Cut a Cake Before the Party Ends. In Proceedings of the 27th AAAI Conference on Artificial Intelligence, 555-561. Palo Alto, CA: AAAI.
Kushilevitz, E. and Nisan, N. 1996. Communication Complexity.Cambridge: Cambridge University Press.
Lacey, M. 2010. Republican Runs Street People on Green Ticket. New York Times.
Lacy, D. and Niou, E. 2000. A Problem with Referenda. Journal of Theoretical Politics, 12(1), 5-31.
Lackner, M. 2014. Incomplete Preferences in Single-Peaked Electorates. In Proceedings of the 28th AAAI Conference on Artificial Intelligence, 742-748. Palo Alto, CA: AAAI.
Ladha, K. K. 1992. The Condorcet Jury Theorem, Free Speech and Correlated Votes. American Political Science Review, 36(3), 617-634.
Ladha, K. K. 1993. Condorcet's Jury Theorem in the Light of de Finetti's Theorem: Majority-Voting with Correlated Votes. Social Choice and Welfare, 10(1), 69-85.
Ladha, K. K. 1995. Information Pooling Through Majority Rule: Condorcet's Jury Theorem with Correlated Votes. Journal of Economic Behavior and Organization, 26(3), 353-372.
Lafage, C. and Lang, J. 2000. Logical Representation of Preferences for Group Decision Making. In Proceedings of the International Conference on Principles of Knowledge Representation and Reasoning (KR), 457-468. Burlington, MA: Morgan Kaufmann.
Laffond, G. and Lainé, J.-R. 2009. Condorcet Choice and the Ostrogorski paradox. Social Choice and Welfare, 32(2), 317-333.
Laffond, G., Laslier, J.-R., and Le Breton, M. 1993a. The Bipartisan Set of a Tournament Game. Games and Economic Behavior, 5, 182-201.
Laffond, G., Laslier, J.-R., and Le Breton, M. 1993b. More on the Tournament Rquilibrium Set. Mathématiques et sciences humaines, 31(123), 37-44.
Laffond, G., Laslier, J.-R., and Le Breton, M. 1994. Social-Choice Mediators. American Economic Review, 84(2), 448-453.
Lang, J. 2004. Logical Preference Representation and Combinatorial Vote. Annals of Mathematics and Artificial Intelligence, 42(1), 37-71.
Lang, J. and Slavkovik, M. 2013. Judgment Aggregation Rules and Voting Rules. In Proceedings of the 3rd International Conference on Algorithmic Decision Theory (ADT), 230-243. New York: Springer.
Lang, J. and Xia, L. 2009. Sequential Composition of Voting Rules in Multi-Issue Domains. Mathematical Social Sciences, 57(3), 304-324.
Lang, J., Pini, M. S., Rossi, R., Venable, K. B., and Walsh, T. 2007. Winner Determination in Sequential Majority Voting. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), 1372-1377. Palo Alto, CA: AAAI.
Lang, J., Pigozzi, G., Slavkovik, M., and van der Torre, L. 2011. Judgment Aggregation Rules Based on Minimization. In Proceedings of the Conference on Theoretical Aspects of Rationality and Knowledge (TARK), 238-246. New York: ACM.
Lang, J., Mengin, J., and Xia, L. 2012a. Aggregating Conditionally Lexicographic Preferences on Multi-issue Domains. In Proceedings of the International Conference on Principles and Practice of Constraint Programming, 973-987. New York: Springer.
Lang, J., Pini, M. S., Rossi, R., Salvagnin, D., Venable, K. B., and Walsh, T. 2012b. Winner Determi¬nation in Voting Trees with Incomplete Preferences and Weighted Votes. Autonomous Agents and Multi-Agent Systems, 25(1), 130-157.
Lang, J., Maudet, N., and Polukarov, M. 2013. New Results on Rquilibria in Strategic Candidacy. In Proceedings of the 6th International Symposium on Algorithmic Game Theory (SAGT), 13-25. New York: Springer.
Lari, I., Ricca, R., and Scozzari, A. 2014. Bidimensional Allocation of Seats via Zero-One Matrices with Given Line Sums. Annals of Operations Research, 215(1), 165-181.
Laruelle, A. and Valenciano, F. 2005. A Critical Reappraisal of Some Voting Power Paradoxes. Public Choice, 125, 17—41.
Laslier, J.-R. 1997. Tournament Solutions and Majority Voting.New York: Springer.
Laslier, J.-R. 2000. Interpretation of electoral mixed strategies. Social Choice and Welfare, 17, 283-292.
Laslier, J.-R. 2009. The Leader Rule: A Model of Strategic Approval Voting in a Large Rlectorate. Journal ofTheoretical Politics, 21, 113-136.
Laslier, J.-R. 2012. And the Loser is. ..Plurality Voting. In Electoral Systems: Paradoxes, Assumptions, and Procedures, ed. Felsenthal, D. S., and Machover, M., 327-352. New York: Springer.
Laslier, J.-R. and Sanver, M. R., eds. 2010. Handbook on Approval Voting. New York: Springer.
Lazear, R. and Rosen, S. 1981. Rank Order Tournaments as Optimum Labor Contracts. Journal of Political Economy, 89, 841-864.
Le Breton, M. 2005. On the Uniqueness of Rquilibrium in Symmetric Two-Player Zero-Sum Games with Integer Payoffs. Üconomie publique, 17(2), 187-195.
Le Breton, M. and Sen, A. 1999. Separable Preferences, Strategyproofness, and Decomposability. Econometrica, 67(3), 605-628.
Le Breton, M., Ortuno-Ortin, I., and Weber, S. 2008. Gamson's Law and Hedonic Games. Social Choice and Welfare, 30(1), 57-67.
Lebanon, G. and Mao, Y. 2008. Non-Parametric Modeling of Partially Ranked Data. Journal of Machine Learning Research, 9, 2401-2429.
Lee, S. 2014. Incentive Compatibility of Large Centralized Matching Markets. Working paper.
Leech, D. 2003. Computing Power Indices for Large Voting Games. Journal of Management Science, 49(6), 831-837.
LeGrand, R., Markakis, E., and Mehta, A. 2007. Some Results on Approximating the Minimax Solution in Approval Voting. In Proceedings of the International Conference on Autonomous Agents andMultiagent Systems (AAMAS), 1185-1187. Richland, SC: IFAAMAS.
Lehrer, E. 1988. An Axiomatization of the Banzhaf Value. International Journal of Game Theory, 17(2), 89-99.
Lemaitre, M., Verfaillie, G., and Bataille, N. 1999. Exploiting a Common Property Resource Under a Fairness Constraint: A Case Study. In Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI), 206-211. Palo Alto, CA: AAAI.
Lenstra, H. W Jr. 1983. Integer Programming with a Fixed Number of Variables. Mathematics of Operations Research, 8(4), 538-548.
Lenstra, H. W. Jr., Shmoys, D. B., and Tardos, E. 1990. Approximation Algorithms for Scheduling Unrelated Parallel Machines. Mathematical Programming, 46, 259-271.
Lerer, E. and Nitzan, S. 1985. Some General Results on the Metric Rationalization for Social Decision Rules. Journal of Economic Theory, 37(1), 191-201.
Lesca, J. and Perny, P. 2010. LP Solvable Models for Multiagent Fair Allocation problems. In Proceedings of the 19th European Conference on Artificial Intelligence (ECAI), 387-392. Amsterdam: IOS Press.
Lev, O. and Rosenschein, J. S. 2012. Convergence of Iterative Voting. In Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 611-618. Richland, SC: IFAAMAS.
Li, M., Vo, Q. B., and Kowalczyk, R. 2010. An Efficient Majority-Rule-Based Approach for Collective Decision Making with CP-Nets. In Proceedings of the International Conference on Principles of Knowledge Representation and Reasoning (KR). Palo Alto, CA: AAAI.
Li, M., Vo, Q. B., and Kowalczyk, R. 2011. Majority-Rule-Based Preference Aggregation on Multi-Attribute Domains with CP-Nets. In Proceedings of the International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 659-666. Richland, SC: IFAAMAS.
Liberatore, P. and Schaerf, M. 1998. Arbitration (or How to Merge Knowledge Bases). IEEE Trans¬actions on Knowledge and Data Engineering, 10(1), 76-90.
Lin, A. 2012. Solving Hard Problems in Election Systems. PhD thesis, Rochester Institute of Technology.
Lindner, C. and Rothe, J. 2009. Degrees of Guaranteed Envy-Freeness in Finite Bounded Cake-Cutting Protocols. In Proceedings of the 5th International Conference on Web and Internet Economics (WINE), 149-159. New York: Springer.
Lipton, R., Markakis, E., Mossel, E., and Saberi, A. 2004. On Approximately Fair Allocations of Indivisible Goods. In Proceedings of the 5th ACM Conference on Electronic Commerce (EC), 125-131. New York: ACM.
List, C. 2012. The Theory of Judgment Aggregation: An Introductory Review. Synthese, 187(1), 179-207.
List, C. and Pettit, P. 2002. Aggregating Sets of Judgments: An Impossibility Result. Economics and Philosophy, 18(1), 89-110.
List, C. and Puppe, C. 2009. Judgment Aggregation: A Survey. Handbook of Rational and Social Choice, ed. Anand, P., Pattanaik, P., and Puppe, C.New York: Oxford University Press.
Lita, D. 2008. Method and Apparatus for Managing Billiard Tournaments. US Patent 20080269925 (Oct).
Liu, H. and Zhu, D. 2010. Parameterized Complexity of Control Problems in Maximin Election. Information Processing Letters, 110(10), 383-388.
Liu, H. and Zhu, D. 2013. Parameterized Complexity of Control by Voter Selection in Maximin, Copeland, Borda, Bucklin, and Approval Election Systems. Theoretical Computer Science, 498, 115-123.
Liu, H., Feng, H., Zhu, D., and Luan, J. 2009. Parameterized Computational Complexity of Control Problems in Voting Systems. Theoretical Computer Science, 410(27-29), 2746-2753.
Liu, Q., Mailath, G. J., Postewaite, A., and Samuelson, L. 2012. Matching with Incomplete Information. Working paper WP-12-032, Penn Institute for Economic Research.
Loreggia, A., Narodytska, N., Rossi, E., Venable, K. B., and Walsh, T. 2014. Controlling Elec¬tions by Replacing Candidates: Theoretical and Experimental Results. In Proceedings of the 8th Multidisciplinary Workshop on Advances in Preference Handling, 61-66. Palo Alto: AAAI Press.
Lu, T. and Boutilier, C. 2010. The Unavailable Candidate Model: A Decision-theoretic View of Social Choice. In Proceedings of the ACM Conference on Electronic Commerce (EC), 263-274. New York: ACM.
Lu, T. and Boutilier, C. 2011a. Budgeted Social Choice: From Consensus to Personalized Decision Making. In Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI), 280-286. Palo Alto, CA: AAAI.
Lu, T. and Boutilier, C. 201lb. Learning Mallows Models with Pairwise Preferences. In Proceedings of the 28th International Conference on Machine Learning (ICML), 145-152. Madison, WI: Omnipress.
Lu, T. and Boutilier, C. 201lc. Robust Approximation and Incremental Elicitation in Voting Protocols. In Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI), 287- 293. Palo Alto, CA: AAAI.
Lu, T. and Boutilier, C. 2011d. Vote Elicitation with Probabilistic Preference Models: Empirical Estimation and Cost Tradeoffs. In Proceedings of the 2nd International Conference on Algorithmic Decision Theory (ADT), 135-149. New York: Springer.
Lu, T. and Boutilier, C. 2013. Multi-Winner Social Choice with Incomplete Preferences. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), 263-270. Palo Alto, CA: AAAI.
Lu, T., Tang, P., Procaccia, A. D., and Boutilier, C. 2012. Bayesian Vote Manipulation: Optimal Strategies and Impact on Welfare. In Proceedings of the 28th Conference on Uncertainty in Artificial Intelligence (UAI), 543-553. New York: Morgan Kaufmann.
Luce, R. Duncan. 1959. Individual Choice Behavior: A Theoretical Analysis.Hoboken, NJ: John Wiley.
Ma, J. 1994. Strategy-Proofness and the Strict Core in a Market with Indivisibilities. International Journal of Game Theory, 23, 75-83.
Ma, J. 1996. On Randomized Matching Mechanisms. Economic Theory, 8, 377-381.
Magdon-Ismail, M., Busch, C., and Krishnamoorthy, M. S. 2003. Cake Cutting is Not a Piece of Cake. In Proceedings of the 20th International Symposium on Theoretical Aspects of Computer Science, 596-607. New York: Springer.
Magiera, K. and Faliszewski, P. 2014. How Hard Is Control in Single-Crossing Elections? In Proceedings of the 21 st European Conference on Artificial Intelligence (ECAI), 579-584. Amsterdam: IOS Press.
Magrino, T., Rivest, R., Shen, E., and Wagner, D. 2011. Computing the Margin of Victory in IRV Elections. In Proceedings of the Electronic Voting Technology Workshop and the Workshop on Trustworthy Elections (EVT/WOTE). Berkeley: USENIX.
Mahajan, M., Raman, V., and Sikdar, S. 2009. Parameterizing Above or Below Guaranteed Values. Journal of Computer and System Sciences, 75, 137-153.
Majumdar, D. and Sen, A. 2004. Ordinally Bayesian Incentive Compatible Voting Rules. Econometrica, 72(2), 523-540.
Mallows, C. L. 1957. Non-Null Ranking Models. Biometrika, 44, 114-130.
Manjunath, V. 2013. Stability and the Core of Probabilistic Marriage Problems. Technical report 1809941. SSRN.
Manlove, D. R. 1999. Stable Marriage with Ties and Unacceptable Partners. Technical report TR- 1999-29, Department of Computing Science, University of Glasgow.
Manlove, D. R. 2008. Hospitals/Residents problem. In Encyclopedia of Algorithms, ed. Kao, M. Y., 390-394. New York: Springer.
Manlove, D. R. 2013. Algorithmics of Matching Under Preferences. Singapore: World Scientific.
Manlove, D. R. and O'Malley, G. 2012. Paired and Altruistic Kidney Donation in the UK: Algo-rithms and Experimentation. In Proceedings of the 11th International Symposium on Experimental Algorithms, 271-282. New York: Springer.
Manlove, D. R., Irving, R. W., Iwama, K., Miyazaki, S., and Morita, Y. 2002. Hard Variants of Stable Marriage. Theoretical Computer Science, 276(1-2), 261-279.
Mann, I. and Shapley, L. S. 1960. Values of Large Games, IV: Evaluating the Electoral College by Montecarlo Techniques. RAND Corporation.
Mann, I. and Shapley, L. S. 1962. Values of Large Games, VI: Evaluating the Electoral College Exactly. RAND Corporation.
Mao, A.Procaccia, A. D., and Chen, Y. 2013. Better Human Computation through Principled Voting. In Proceedings of ‘the 27th AAAI Conference on Artificial Intelligence, 1142-1148. Palo Alto, CA: AAAI.
Marchand, E. 2002. On the Comparison between Standard and Random Knockout Tournaments. The Statistician, 51, 169-178.
Marden, J. I. 1995. Analyzing and Modeling Rank Data.London: Chapman and Hall.
Markakis, E. and Psomas, C.-A. 2011. On Worst-Case Allocations in the Presence of Indivisible Goods. In Proceedings of the 7th International Conference on Web andlnternet Economics (WINE), 278-289. New York: Springer.
Marple, A., Rey, A., and Rothe, J. 2014. Bribery in Multiple-Adversary Path-Disruption Games Is Hard for the Second Level of the Polynomial Hierarchy. In Proceedings of the 13th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 1375-1376. Richland, SC: IFAAMAS.
Martínez, R., Massó, J., Neme, A., and Oviedo, J. 2004. An Algorithm to Compute the Pull Set of Many-To-Many Stable Matchings. Mathematical Social Sciences, 47(2), 187-210.
Masatlioglu, Y., Nakajima, D., and Ozbay, E. Y. 2012. Revealed Attention. American Economic Review, 102(5), 2183-2205.
Maschler, M., Solan, E., and Zamir, S. 2013. Game Theory. New York: Cambridge University Press.
Maskin, E. 1977. Nash Equilibrium and Welfare Optimality. Mimeo.
Maskin, E. 1987. On the Pair Allocation of Indivisible Goods. In Arrow and the Foundations of the Theory of Economic Policy (Essays in Honor of Kenneth Arrow) Vol. 2, ed. Peiwel, G., 341-349. New York: Macmillan.
Maskin, E. 1999. Nash Equilibrium and Welfare Optimality. Review of Economic Studies, 66, 23-38.
Massa, P. and Avesani, P. 2005. Controversial Users Demand Local Trust Metrics: An Experimental Study on Epinions.com Community. In Proceedings of the AAAI Conference on Artificial Intelligence, 121-126. Palo Alto, CA: AAAI.
Matsui, T. and Matsui, Y. 2000. A Survey of Algorithms for Calculating Power Indices of Weighted Majority Games. Journal of the Operations Research Society of Japan, 43(1), 71-86.
Matsui, Y. and Matsui, T. 2001. NP-Completeness for Calculating Power Indices of Weighted Majority Games. Theoretical Computer Science, 263(1-2), 305-310.
Mattei, N. 2011. Empirical Evaluation of Voting Rules with Strictly Ordered Preference Data. In Proceedings of the 2nd International Conference on Algorithmic Decision Theory (ADT), 165— 177. New York: Springer.
Mattei, N., Pini, M. S., Rossi, E., and Venable, K. B. 2012a. Bribery in Voting Over Combinatorial Domains Is Easy. In Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 1407-1408. Richland, SC: IFAAMAS.
Mattei, N., Goldsmith, J., and Klapper, A. 2012b. On the Complexity of Bribery and Manipulation in Tournaments with Uncertain Information. In Proceedings of the 25 th AAAI Conference on Artificial Intelligence, 549-554. Palo Alto, CA: AAAI.
May, K. 1952. A Set of Independent, Necessary and Sufficient Conditions for Simple Majority Decision. Econometrica, 20(2-3), 680-684.
Maya, A. and Nisan, N. 2012. Incentive Compatible Two Player Cake Cutting. In Proceedings of the 8th International Conference on Web and Internet Economics (WINE), 170-183. New York: Springer.
McCabe-Dansted, J. 2006. Approximability and Computational Feasibility of Dodgson's Rule. MPhil thesis, University of Auckland.
McCabe-Dansted, J., Pritchard, G., and Slinko, A. 2008. Approximability of Dodgson's Rule. Social Choice and Welfare, 31(2), 311-330.
McCutchen, R. M. 2008. The Least-Unpopularity-Factor and Least-Unpopularity-Margin Criteria for Matching Problems with One-Sided Preferences. In Proceedings of the 8th Latin-American Theoretical Informatics Symposium, 593-604. New York: Springer.
McDermid, E. J. 2009. A 3/2 Approximation Algorithm for General Stable Marriage. In Proceedings of the 36th International Colloquium on Automata, Languages and Programming, 689-700. New York: Springer.
McDermid, E. J. and Irving, R. W. 2011. Popular Matchings: Structure and Algorithms. Journal of Combinatorial Optimization, 22(3), 339-358.
McDermid, E. J. and Manlove, D. F. 2010. Keeping Partners Together: Algorithmic Results for the Hospitals / Residents Problem with Couples. Journal of Combinatorial Optimization, 19(3), 279-303.
McGarvey, D. C. 1953. A Theorem on the Construction of Voting Paradoxes. Econometrica, 21(4), 608-610.
McKelvey, R. D. and Niemi, R. G. 1978. A Multistage Game Representation of Sophisticated Voting for Binary Procedures. Journal of Economic Theory, 18, 1-22.
McLean, I. and Urken, A. 1995. Classics of Social Choice. Ann Arbor: University of Michigan Press.
McLennan, A. 1998. Consequences of the Condorcet Jury Theorem for Beneficial Information Aggregation by Rational Agents. American Political Science Review, 92(2), 413-419.
McSweeney, P. J., Mehrotra, K., and Oh, J. C. 2014. Game-Theoretic Framework for Commu¬nity Detection. In Encyclopedia of Social Network Analysis and Mining, 573-588. New York: Springer.
Meilă, M. and Chen, H. 2010. Dirichlet Process Mixtures of Generalized Mallows Models. In Proceedings of the 26th Conference on Uncertainty in Artificial Intelligence (UAI), 358-367. New York: Morgan Kaufmann.
Meir, R., Procaccia, A. D., Rosenschein, J. S., and Zohar, A. 2008. Complexity of Strategic Behavior in Multi-Winner Elections. Journal of Artificial Intelligence Research (JAIR), 33, 149-178.
Meir, R., Polukarov, M., Rosenschein, J. S., and Jennings, N. R. 2010. Convergence to Equilibria in Plurality Voting. In Proceedings of the 24th AAAI Conference on Artificial Intelligence, 823-828. Palo Alto, CA: AAAI.
Meir, R., Procaccia, A. D., and Rosenschein, J. S. 2012. Algorithms for Strategyproof Classification. Artificial Intelligence, 186, 123-156.
Meir, R., Lev, O., and Rosenschein, J. S. 2014. A Local-Dominance Theory of Voting Equilibria. In Proceedings of the 15th ACM Conference on Electronic Commerce (EC), 313-330. New York: ACM.
Menton, C. 2013. Normalized Range Voting Broadly Resists Control. Theory of Computing Systems, 53(4), 507-531.
Menton, C. and Singh, P. 2013. Control Complexity of Schulze Voting. In Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI), 286-292. Palo Alto, CA: AAAI.
Merrill, S. 1982. Approximations to the Banzhaf Index. American Mathematical Monthly, 89, 108-110.
Meskanen, T. and Nurmi, H. 2008. Closeness Counts in Social Choice. In Power, Freedom, and Voting, ed. Braham, M., and Steffen, F., 182-191. New York: Springer.
Messner, M. and Polborn, M. K. 2007. Strong and Coalition-Proof Political Equilibria Under Plurality and Runoff Rule. International Journal of Game Theory, 35, 287-314.
Michalak, T., Sroka, J., Rahwan, T., McBurney, P., Wooldridge, M., and Jennings, N. R. 2010. A Distributed Algorithm for Anytime Coalition Structure Generation. In Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems (AAMAS),1007-1014. Richland, SC: IFAAMAS.
Milchtaich, I. 1996. Congestion Games with Player-Specific Payoff Functions. Games and Economic Behavior, 13, 111-124.
Miller, M. K. and Osherson, D. 2009. Methods for Distance-Based Judgment Aggregation. Social Choice and Welfare, 32(4), 575-601.
Miller, N. R. 1977. Graph-Theoretic Approaches to the Theory of Voting. American Journal of Political Science, 21(4), 769-803.
Miller, N. R. 1980. A New Solution Set for Tournaments and Majority Voting: Further Graph-Theoretical Approaches to the Theory of Voting. American Journal of Political Science, 24(1), 68-96.
Mossel, E. and Tamuz, O. 2010. Truthful Fair Division. In Proceedings of the 3rd International Symposium on Algorithmic Game Theory (SAGT), 288-299. New York: Springer.
Monjardet, B. 2008. Statement of Precedence and a Comment on IIA Terminology. Games and Economic Behavior, 62, 736-738.
Monroe, B. L. 1995. Fully Proportional Representation. American Political Science Review, 89, 925-940.
Montanari, U. 1974. Network of Constraints: Fundamental Properties and Applications to Picture Processing. Information Sciences, 7, 95-132.
Moon, J. W. 1968. Topics on Tournaments.New York: Holt, Reinhard and Winston.
Moon, J. W. and Pullman, N. K. 1970. On Generalized Tournament Matrices. SIAM Review, 12(3), 384-399.
Mossel, E. and Racz, M. Z. 2012. A Quantitative Gibbard-Satterthwaite Theorem without Neutrality. In Proceedings of the ACM Symposium on Theory of Computing (STOC), 1041-1060. New York: ACM.
Mossel, E., Procaccia, A. D., and Racz, M. Z. 2013. A Smooth Transition from Powerlessness to Absolute Power. Journal of Artificial Intelligence Research (JAIR), 48, 923-951.
Moulin, H. 1979. Dominance Solvable Voting Schemes. Econometrica, 47, 1337-1351.
Moulin, H. 1983. The Strategy of Social Choice. Amsterdam: North Holland.
Moulin, H. 1986. Choosing from a Tournament. Social Choice and Welfare, 3, 271-291.
Moulin, H. 1988a. Axioms of Cooperative Decision Making.New York: Cambridge University Press.
Moulin, H. 1988b. Condorcet's Principle Implies the No-Show Paradox. Journal of Economic Theory, 45, 53-64.
Moulin, H. 1990. Uniform Externalities: Two Axioms for Fair Allocation. Journal of Public Economics, 43(3), 305-326.
Moulin, H. 1995. Cooperative Microeconomics: A Game-Theoretic Introduction.Princeton, NJ: Princeton University Press.
Moulin, H. 2000. Priority Rules and Other Asymmetric Rationing Methods. Econometrica, 68(3), 643-684.
Moulin, H. 2004. Fair Division and Collective Welfare.Cambridge, MA: MIT Press.
Moulin, H. and Thomson, W. 1988. Can Everyone Benefit from Growth?: Two Difficulties. Journal of Mathematical Economics, 17(4), 339-345.
Muller, E. and Satterthwaite, M. A. 1977. The Equivalence of Strong Positive Association and Strategy-Proofness. Journal of Economic Theory, 14(2), 412-418.
Munera, D., Diaz, D., Abreu, S., Rossi, E., Saraswat, V., and Codognet, P. 2015. Solving Hard Stable Matching Problems via Local Search and Cooperative Parallelization. In Proceedings of the 29th AAAI Conference on Artificial Intelligence, 1212-1218. Palo Alto, CA: AAAI.
Muroga, S. 1971. Threshold Logic and Its Applications.Hoboken, NJ: John Wiley.
Murphy, T. B. and Martin, D. 2003. Mixtures of Distance-Based Models for Ranking Data. Computational Statistics and Data Analysis, 41, 645-655.
Myerson, R. B. 1991. Game Theory.Cambridge, MA: Harvard University Press.
Nanson, E. J. 1882. Methods of Election. Transactions and Proceedings of the Royal Society of Victoria, 19, 197-240.
Narodytska, N. and Walsh, T. 2013. Manipulating Two Stage Voting Rules. In Proceedings of the 13th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 423-430. Richland, SC: IFAAMAS.
Narodytska, N., Walsh, T., and Xia, L. 2011. Manipulation of Nanson's and Baldwin's Rules. In Proceedings of the 25th AAAI Conference on Artificial Intelligence, 713-718. Palo Alto, CA: AAAI.
Narodytska, N., Walsh, T., and Xia, L. 2012. Combining Voting Rules Together. In Proceedings of the 20th European Conference on Artificial Intelligence (ECAI), 612-617. Amsterdam: IOS Press.
Nash, J. F. 1950. The Bargaining Problem. Econometrica, 18(2), 155-162.
Nehama, I. 2013. Approximately Classic Judgement Aggregation. Annals of Mathematics and Artificial Intelligence, 68(1-3), 91-134.
Nehring, K. and Puppe, C. 2007. The Structure of Strategy-Proof Social Choice. Part I: General Characterization and Possibility Results on Median Spaces. Journal of Economic Theory, 135(1), 269-305.
Nemhauser, G. L. and Wolsey, L. A. 1999. Integer and Combinatorial Optimization. Hoboken, NJ: John Wiley.
Newman, M. E. J. 2008. The Mathematics of Networks. The New Palgrave Encyclopedia of Economics, 2.
Ng, C. and Hirschberg, D. S. 1988. Complexity of the Stable Marriage and Stable Roommate Problems in Three Dimensions. Technical report UCI-ICS 88-28, Department of Information and Computer Science, University of California, Irvine.
Nguyen, N.-T., Nguyen, T. T., Roos, M., and Rothe, J. 2014. Computational Complexity and Approximability of Social Welfare Optimization in Multiagent Resource Allocation. Journal of Autonomous Agents and Multi-Agent Systems, 28(2), 256-289.
Nguyen, T. T. and Rothe, J. 2015. Minimizing Envy and Maximizing Average Nash Social Welfare in the Allocation of Indivisible Goods. Discrete Applied Mathematics, 179, 54—68.
Nguyen, T. T., Roos, M., and Rothe, J. 2013. A Survey of Approximability and Inapproximability Results for Social Welfare Optimization in Multiagent Resource Allocation. Annals of Mathematics and Artificial Intelligence, 68(1-3), 65-90.
Nicolo, A. and Yu, Y. 2008. Strategic Divide and Choose. Games and Economic Behavior, 64(1), 268-289.
Nicosia, G., Pacifici, A., and Pferschy, U. 2009. On Multi-agent Knapsack Problems. In Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW), 44-47.
Niedermeier, R. 2006. Invitation to Fixed-Parameter Algorithms.New York: Oxford University Press.
Niou, E. M. S. 1987. A Note on Nanson's Rule. Public Choice, 54, 191-193.
Nipkow, T. 2009. Social Choice Theory in HOL: Arrow and Gibbard-Satterthwaite. Journal of Automated Reasoning, 43(3), 289-304.
Nisan, N. 2006. Bidding Languages for Combinatorial Auctions. In Combinatorial Auctions, ed. Cramton, P., Shoham, Y., and Steinberg, R., Chapter 9. Cambridge, MA: MIT Press.
Nisan, N. 2007. Introduction to Mechanism Design (for Computer Scientists). In Algorithmic Game Theory, 209-242. New York: Cambridge University Press.
Nitzan, S. 1981. Some Measures of Closeness to Unanimity and Their Implications. Theory and Decision, 13(2), 129-138.
Nitzan, S. 2010. Collective Preference and Choice.New York: Cambridge University Press.
Nitzan, S. and Paroush, J. 1982. Optimal Decision Rules in Uncertain Dichotomous Choice Situations. International Economic Review, 23, 289-297.
NRMP. 2014. National Resident Matching Program, http://www.nrmp.org.
Obraztsova, S. and Elkind, E. 2011. On the Complexity of Voting Manipulation Under Randomized Tie-Breaking. In Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI), 319-324. Palo Alto, CA: AAAI.
Obraztsova, S., Elkind, E., and Hazon, N. 2011. Ties Matter: Complexity of Voting Manipulation Revisited. In Proceedings of the 10th International Conference on Autonomous Agents and Multi-agent Systems (AAMAS), 71-78. Richland, SC: IFAAMAS.
Obraztsova, S., Markakis, E., and Thompson, D. R. M. 2013. Plurality Voting with Truth-Biased Agents. In Proceedings of the 6th International Symposium on Algorithmic Game Theory (SAGT), 26-37. New York: Springer.
Obraztsova, S., Rabinovich, Z., Lev, O., Markakis, E., and Rosenschein, J. S. 2015a. Analysis of Equilibria in Iterative Voting Schemes. In Proceedings of the 29th AAAI Conference on Artificial Intelligence, 1007-1013. Palo Alto, CA: AAAI.
Obraztsova, S., Markakis, E., Polukarov, M., Rabinovich, Z., and Jennings, N. R. 2015b. On the Convergence of Iterative Voting: How Restrictive Should Restricted Dynamics Be. In Proceedings of the 29th AAAI Conference on Artificial Intelligence, 993-999. Palo Alto, CA: AAAI.
Olsen, M. 2009. Nash Stability in Additively Separable Hedonic Games and Community Structures. Theory of Computing Systems, 45, 917-925.
Olsen, M. 2013. A general view on computing communities. Mathematical Social Sciences, 66(3), 331-336.
O'Neill, B. 1982. A Problem of Rights Arbitration from the Talmud. Mathematical Social Sciences, 2(4), 345-371.
Oren, J., Filmus, Y., and Boutilier, C. 2013. Efficient Vote Elicitation Under Candidate Uncertainty. In Proceedings of ‘the 23rdInternational Joint Conference on Artificial Intelligence (IJCAI), 309-316. Palo Alto, CA: AAAI.
Othman, A., Sandholm, T., and Budish, E. 2010. Finding Approximate Competitive Equilib¬ria: Efficient and Fair Course Allocation. In Proceedings of the 9th International Confer¬ence on Autonomous Agents and Multiagent Systems (AAMAS), 873-880. Richland, SC: IFAAMAS.
Owen, G. 1975. Multilinear Extensions and the Banzhaf Value. Naval Research Logistics Quarterly, 22(4), 741-750.
Özkal-Sanver, İ. and Sanver, M. R. 2006. Ensuring Pareto-Optimality by Referendum Voting. Social Choice and Welfare, 27, 211-219.
Page, L., Brin, S., Motwani, R., and Winograd, T. 1998. The Page Rank Citation Ranking: Bringing Order to the Web. Technical report, Stanford University.
Paluch, K. 2014. Faster and Simpler Approximation of Stable Matchings. Algorithms, 7(2), 189-202.
Papadimitriou, C. H. 1994. Computational Complexity.Addison Wesley.
Papadimitriou, C. H. and Zachos, S. 1983. Two Remarks on the Power of Counting. In Proceedings of the 6th GIConference on Theoretical Computer Science, 269-276. New York: Springer.
Pápai, S. 2004. Unique Stability in Simple Coalition Formation Games. Games and Economic Behavior, 48, 337-354.
Pareto, V. 1919. Manuale di Economia Politica con una Introduzione alia Scienza Sociale.Società Editrice Libraria.
Parkes, D. C. and Procaccia, A. D. 2013. Dynamic Social Choice with Evolving Preferences. In Proceedings of the 27th AAAI Conference on Artificial Intelligence, 767-773. Palo Alto, CA: AAAI.
Parkes, D. C. and Xia, L. 2012. A Complexity-of-Strategic-Behavior Comparison between Schulze's Rule and Ranked Pairs. In Proceedings of the 26th AAAI Conference on Artificial Intelligence, 1429-1435. Palo Alto, CA: AAAI.
Parkes, D. C., Procaccia, A. D., and Shah, N. 2014. Beyond Dominant Resource Fairness: Extensions, Limitations, and Indivisibilities. ACM Transactions on Economics and Computation, 3(1).
Pathak, P. A. 2011. The Mechanism Design Approach to Student Assignment. Annual Reviews of Economics, 3, 513-536.
Pauly, M. 2014. Can Strategizing in Round-Robin Subtournaments be Avoided?Social Choice and Welfare, 43(1), 29-46.
Pauly, M. and van Hees, M. 2006. Logical Constraints on Judgement Aggregation. Journal of Philo-sophical Logic, 35(6), 569-585.
Pazner, E. A. 1977. Pitfalls in the Theory of Fairness. Journal of Economic Theory, 14(2), 458-466.
Pazner, E. A. and Schmeidler, D. 1978. Egalitarian Equivalent Allocations: A New Concept of Economic Equity. Quarterly Journal of Economics, 92(4), 671-687.
Pearl, J. 1988. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference.San Francisco: Morgan Kaufmann.
Peleg, B. 1975. Consistent Voting Systems. Research Memorandum No.9, Centre for Research in Mathematical Economics and Game Theory, The Hebrew University, Jerusalem.
Peleg, B. 1981. Monotonicity Properties of Social Choice Correspondences. In Game Theory and Mathematical Economics, ed. Moeschlin, O., and Pallaschka, D., 97-101. Amsterdam: Elsevier.
Peleg, B. and Sudholter, P. 2007. Introduction to the Theory of Cooperative Games. 2nd ed. New York: Springer.
Peleg, B. and Zamir, S. 2012. Extending the Condorcet Jury Theorem to a General Dependent Jury. Social Choice and Welfare, 1(39), 91-125.
Pennock, D. M., Horvitz, E., and Giles, C. L. 2000a. Social Choice Theory and Recommender Systems: Analysis of the Axiomatic Foundations of Collaborative Filtering. In Proceedings of the 17th AAAI Conference on Artificial Intelligence, 729-734. Palo Alto, CA: AAAI.
Pettit, P. 2001. Deliberative Democracy and the Discursive Dilemma. Philosophical Issues, 11(1), 268-299.
Pickard, G., Pan, W., Rahwan, I., Cebrian, M., Crane, R., Madan, A., and Pentland, A. 2011. Time-Critical Social Mobilization. Science, 334(6055), 509-512.
Pigozzi, G. 2006. Belief Merging and the Discursive Dilemma: An Argument-Based Account of Paradoxes of Judgment Aggregation. Synthese, 152(2), 285-298.
Pini, M. S., Rossi, F.,Venable, K. B., and Walsh, T. 2009. Aggregating Partially Ordered Preferences. Journal of Logic and Computation, 19, 475-502.
Pini, M. S., Rossi, F, Venable, K. B., and Walsh, T. 2011a. Manipulation Complexity and Gender Neutrality in Stable Marriage Procedures. Autonomous Agents and Multi-Agent Systems, 22(1), 183-199.
Pini, M. S., Rossi, F, Venable, K. B., and Walsh, T. 2011b. Stability in Matching Problems with Weighted Preferences. In Proceedings of the 3rd International Conference on Agents and Artificial Intelligence.Setubal: SciTePress.
Pinski, G. and Narin, R 1976. Citation Influence for Journal Aggregates of Scientific Publications: Theory, with Applications to the Literature of Physics. Information Processing and Management, 297-312.
Pivato, M. 2012. Voting Rules as Statistical Rstimators. Social Choice and Welfare, 40(2), 581-630.
Porello, D. and Rndriss, U. 2011. Ontology Merging as Social Choice. In Proceedings of the 12th International Workshop on Computational Logic in Multiagent Systems, 157-170. New York: Springer.
Prasad, K. and Kelly, J. S. 1990. NP-Completeness of Some Problems Concerning Voting Games. International Journal of Game Theory, 19(1), 1-9.
Pritchard, G. and Wilson, M. C. 2009. Asymptotics of the Minimum Manipulating Coalition Size for Positional Voting Rules Under Impartial Culture Behaviour. Mathematical Social Sciences, 58(1), 35-57.
Procaccia, A. D. 2008. A Note on the Query Complexity of the Condorcet Winner Problem. Information Processing Letters, 108(6), 390-393.
Procaccia, A. D. 2009. Thou Shalt Covet Thy Neighbor's Cake. In Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI), 239-244. Palo Alto, CA: AAAI.
Procaccia, A. D. 2010. Can Approximation Circumvent Gibbard-Satterthwaite? In Proceedings of the 24th AAAI Conference on Artificial Intelligence, 836-841. Palo Alto, CA: AAAI.
Procaccia, A. D. and Rosenschein, J. S. 2006. The Distortion of Cardinal Preferences in Voting. In Proceedings of the 10th International Workshop on Cooperative Information Agents, 317-331. New York: Springer.
Procaccia, A. D. and Rosenschein, J. S. 2007a. Average-Case Tractability of Manipulation in Voting via the Fraction of Manipulators. In Proceedings of the 6th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 718-720. Richland, SC: IFAAMAS.
Procaccia, A. D. and Rosenschein, J. S. 2007b. Junta Distributions and the Average-Case Complexity of Manipulating Elections. Journal of Artificial Intelligence Research (JAIR), 28, 157-181.
Procaccia, A. D. and Tennenholtz, M. 2013. Approximate Mechanism Design without Money. ACM Transactions on Economics and Computation, 1(4), 18.
Procaccia, A. D. and Wang, J. 2014. Fair Enough: Guaranteeing Approximate Maximin Shares. In Proceedings of the 15th ACM Conference on Electronic Commerce (EC), 675-692. New York: ACM.
Procaccia, A. D., Rosenschein, J. S., and Zohar, A. 2008. On the Complexity of Achieving Proportional Representation. Social Choice and Welfare, 30(3), 353-362.
Procaccia, A. D., Zohar, A., Peleg, Y., and Rosenschein, J. S. 2009. The Learnability of Voting Rules. Artificial Intelligence, 173(12-13), 1133-1149.
Procaccia, A. D., Reddi, S., and Shah, N. 2012. A Maximum Likelihood Approach for Selecting Sets of Alternatives. In Proceedings of the Conference on Uncertainty in Artificial Intelligence (UAI), 695-704. New York: Morgan Kaufmann.
Pukelsheim, F., Ricca, F., Simeone, B., Scozzari, A., and Serafini, P. 2012. Network Flow Methods for Electoral Systems. Networks, 59(1), 73-88.
Qing, C., Endriss, U., Fernández, R., and Kruger, J. 2014. Empirical Analysis of Aggregation Methods for Collective Annotation. In Proceedings of the 25th International Conference on Computational Linguistics, 1533-1542. Stroudsburg, PA: ACL.
Rabinovich, Z., Obraztsova, S., Lev, O., Markakis, E., and Rosenschein, J. S. 2014. Analysis of Equilibria in Iterative Voting Schemes. In Proceedings of the 5th International Workshop on Computational Social Choice (COMSOC).
Rahwan, T., Ramchurn, S., and Jennings, N. R. 2009a. An Anytime Algorithm for Optimal Coalition Structure Generation. Journal of Artificial Intelligence Research (JAIR), 34, 521-567.
Rahwan, T., Michalak, T. P., Jennings, N. R., Wooldridge, M., and McBurney, P. 2009b. Coalition Structure Generation in Multi-Agent Systems with Positive and Negative Externalities. In Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI), 257-263. Palo Alto, CA: AAAI.
Rajagopalan, S. and Vazirani, V. 1999. Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer programs. SIAM Journal on Computing, 28, 526-541.
Raman, V. and Saurabh, S. 2007. Improved Fixed Parameter Tractable Algorithms for Two “Edge” Problems: MAXCUT and MAXDAG. Information Processing Letters, 104(2), 65-72.
Rassenti, S., Smith, V. L., and Bulfin, R. L. 1982. A Combinatorial Auction Mechanisms for Airport Time Slot Allocation. Bell Journal of Economics, 13(2), 402-417.
Rastegari, B., Condon, A., Leyton-Brown, K., and Immorlica, N. 2013. Two-Sided Matching with Partial Information. In Proceedings of the 14th ACM Conference on Electronic Commerce (EC), 733-750. New York: ACM.
Ratliff, T. C. 2001. A Comparison of Dodgson's Method and Kemeny's Rule. Social Choice and Welfare, 18(1), 79-89.
Raz, R. and Safra, S. 1997. A Sub-Constant Error-Probability Low-Degree Test, and Sub-Constant Error-Probability PCP Characterization of NP. In Proceedings of the 29th ACM Symposium on Theory of Computing, 475-484. New York: ACM.
Regenwetter, M., Grofman, B., Marley, A. A. J., and Tsetlin, I. 2006. Behavioral Social Choice: Probabilistic Models, Statistical Inference, and Applications. Cambridge: Cambridge University Press.
Reid, K. B. 2004. Tournaments. In Handbook of Graph Theory, ed. Gross, J. L., and Yellen, J., 156-184. Boca Raton, FL: CRC Press.
Reid, K. B. and Beineke, L. W. 1978. Tournaments. In Selected Topics in Graph Theory, ed. Beineke, L. W., and Wilson, R. J., 169-204. New York: Academic Press.
Reijngoud, A. and Endriss, U. 2012. Voter Response to Iterated Poll Information. In Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 635-644. Richland, SC: IFAAMAS.
Reisch, Y., Rothe, J., and Schend, L. 2014. The Margin of Victory in Schulze, Cup, and Copeland Elections: Complexity of the Regular and Exact Variants. In Proceedings of the 7th European Starting AIResearcher Symposium, 250-259. Amsterdam: IOS Press.
Resnick, P. and Zeckhauser, R. 2001. Trust among Strangers in Internet Transactions: Empirical Analysis of eBay's Reputation System. Working paper, NBER Workshop on Empirical Studies of Electronic Commerce.
Resnick, P., Zeckhauser, R., Friedman, R., and Kuwabara, E. 2000. Reputation Systems. Communications of the ACM, 43(12), 45-48.
Revesz, P. Z. 1997. On the Semantics of Arbitration. International Journal of Algebra and Computation, 7(2), 133-160.
Rey, A. and Rothe, J. 2011. Bribery in Path-Disruption Games. In Proceedings of the 2nd International Conference on Algorithmic Decision Theory (ADT), 247-261. New York: Springer.
Rey, A. and Rothe, J. 2014. False-Name Manipulation in Weighted Voting Games is Hard for Probabilistic Polynomial Time. Journal of Artificial Intelligence Research (JAIR), 50, 573-601.
Reyhani, R. and Wilson, M. C. 2012. Best Reply Dynamics for Scoring Rules. In Proceedings of the 20th European Conference on Artificial Intelligence (ECAI), 672-677. Amsterdam: IOS Press.
Ricca, R, Scozzari, A., and Simeone, B. 2007. Weighted Voronoi Region Algorithms for Political Districting. Mathematical and Computer Modelling, 48(9-10), 1468-1477.
Ricca, R, Scozzari, A., and Simeone, B. 2011. The Give-Up Problem for Blocked Regional Lists with Multi-Winners. Mathematical Social Sciences, 62(1), 14—24.
Ricca, R, Scozzari, A., and Simeone, B. 2013. Political Districting: From Classical Models to Recent Approaches. Annals of Operations Research, 204(1), 271-299.
Robertson, J. M. and Webb, W A. 1998. Cake Cutting Algorithms: Be Fair If You Can. Natick, MA: A. K. Peters.
Rodríguez-Álvarez, C. 2009. Strategy-Proof Coalition Formation. International Journal of Game Theory, 38, 431—452.
Roemer, J. 1986. The Mismarriage of Bargaining Theory and Distributive Justice. Ethics, 97(1), 88-110.
Ronn, E. 1990. NP-Complete Stable Matching Problems. Journal of Algorithms, 11, 285-304.
Rosen, S. 1986. Prizes and Incentives in Elimination Tournaments. American Economic Review, 76, 701-715.
Rossi, R, Venable, K. B., and Walsh, T. 2004. mCP Nets: Representing and Reasoning with Pref¬erences of Multiple Agents. In Proceedings of the AAAI Conference on Artificial Intelligence, 729-734. Palo Alto, CA: AAAI.
Roth, A. E. 1982a. The Economics of Matching: Stability and Incentives. Mathematics of Operations Research, 7(4), 617-628.
Roth, A. E. 1982b. Incentive Compatibility in a Market with Indivisible Goods. Economics Letters, 9, 127-132.
Roth, A. E. 1984a. The Evolution of the Labor Market for Medical Interns and Residents: a case study in game theory. Journal of Political Economy, 92(6), 991-1016.
Roth, A. E. 1984b. Stability and Polarization of Interests in Job Matching. Econometrica, 52(1), 47-57.
Roth, A. E. 1985. The College Admissions Problem is not Equivalent to the Marriage Problem. Journal of Economic Theory, 36, 277-288.
Roth, A. E. 1986. On the Allocation of Residents to Rural Hospitals: A General Property of Two-Sided Matching Markets. Econometrica, 54, 425-427.
Roth, A. E. 2008. Deferred Acceptance Algorithms: History, Theory, Practice, and Open Questions. International Journal of Game Theory, 36(3-4), 537-569.
Roth, A. E. and Peranson, E. 1997. The Effects of the Change in the NRMP Matching Algorithm. Journal of the American Medical Association, 278(9), 729-732.
Roth, A. E. and Peranson, E. 1999. The Redesign of the Matching Market for American Physicians: Some Engineering Aspects of Economic Design. American Economic Review, 89(4), 748-780.
Roth, A. E. and Postlewaite, A. 1977. Weak versus Strong Domination in a Market with Indivisible Goods. Journal of Mathematical Economics, 4, 131-137.
Roth, A. E. and Sotomayor, M. A. O. 1990. Two-Sided Matching: A Study in Game-Theoretic Modeling and Analysis. New York: Cambridge University Press.
Roth, A. E. and Vande Vate, J. H. 1990. Random Paths to Stability in Two-Sided Matching. Econometrica, 58(6), 1475-1480.
Roth, A. E. and Xing, X. 1994. Jumping the gun: Imperfections and Institutions Related to the Timing of Market Transactions. American Economic Review, 84(4), 992-1044.
Roth, A. E., Sönmez, T., and Ünver, M. U. 2004. Kidney Exchange. Quarterly Journal of Economics, 119(2), 457-488.
Roth, A. E., Sönmez, T., and Ünver, M. U. 2005. Pairwise Kidney Exchange. Journal of Economic Theory, 125, 151-188.
Rothe, J. and Schend, L. 2012. Control Complexity in Bucklin, Fallback, and Plurality Voting: An Experimental Approach. In Proceedings of the 11th International Symposium on Experimental Algorithms, 356-368. New York: Springer.
Rothe, J. and Schend, L. 2013. Challenges to Complexity Shields That Are Supposed to Protect Elections against Manipulation and Control: A Survey. Annals of Mathematics and Artificial Intelligence, 68(1-3), 161-193.
Rothe, J., Spakowski, H., and Vogel, J. 2003. Exact Complexity of the Winner Problem for Young Elections. Theory of Computing Systems, 36(4), 375-386.
Rothe, J., Baumeister, D., Lindner, C, and Rothe, I. 2011. Einführung in Computational Social Choice: Individuelle Strategien und kollektive Entscheidungen beim Spielen, Wählen und Teilen. Heidelberg, Germany: Spektrum.
Rubinstein, A. and Fishburn, P. C. 1986. Algebraic Aggregation Theory. Journal of Economic Theory, 38(1), 63-77.
Russel, N. 2007. Complexity of Control of Borda Count Elections. MPhil thesis, Rochester Institute of Technology.
Russell, T. 2010. A Computational Study of Problems in Sports. PhD dissertation, University of Waterloo.
Russell, T. and Walsh, T. 2009. Manipulating Tournaments in Cup and Round Robin Competitions. In Proceedings of the International Conference on Algorithmic Decision Theory (ADT), 26-37. New York: Springer.
Ryvkin, D. 2010. The Selection Efficiency of Tournaments. European Journal of Operational Research, 206(3), 667-675.
Ryvkin, D. and Ortmann, A. 2008. The Predictive Power of Three Prominent Tournament Formats. Management Science, 54(3), 492-504.
Saad, W, Han, Z., Basar, T., Debbah, M., and Hjorungnes, A. 2011. Hedonic Coalition Formation for Distributed Task Allocation among Wireless Agents. IEEE Transactions on Mobile Computing, 10(9), 1327-1344.
Saari, D. 1995. Basic Geometry of Voting. New York: Springer.
Saari, D. 2009. Condorcet Domains: A Geometric Perspective. In The Mathematics of Preference, Choice, and Order: Essays in Honor of Peter C. Fishburn, ed. Brams, S. J., Gehrlein, W. V., and Roberts, F. S., 161-182. New York: Springer.
Saari, D. and Merlin, V. R. 2000. A Geometric Examination of Kemeny's Rule. Social Choice and Welfare, 17, 403-438.
Saari, D. and Sieberg, K. 2001. The Sum of the Parts Can Violate the Whole. American Political Science Review, 95(2), 415-433.
Saban, D. and Sethuraman, J. 2013. The Complexity of Computing the Random Priority Allocation Matrix. In Proceedings of the 9th International Conference on Web and Internet Economics (WINE), 421. New York: Springer.
Saberi, A. and Wang, Y. 2009. Cutting a Cake for Five People. In Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management, 292-300. New York: Springer.
Sandholm, T. 1998. Agents in Electronic Commerce: Component Technologies for Automated Negotiation and Coalition Formation. In Cooperative Information Agents, ed. Klusch, M., 113-134. New York: Springer.
Sandholm, T., Larson, K., Andersson, M., Shehory, O., and Tohmé, F. 1999. Coalition Structure Generation with Worst Case Guarantees. Artificial Intelligence, 111(1-2), 209-238.
Sanver, M. R. 2010. Approval as an Intrinsic Part of Preference. In Handbook on Approval Voting, ed. Laslier, J.-F. and Sanver, M. R., 469-481. New York: Springer.
Sanver, M. R. and Zwicker, W. S. 2009. One-Way Monotonicity as a Form of Strategy-Proofness. International Journal of Game Theory, 38, 553-574.
Sanver, M. R. and Zwicker, W. S. 2012. Monotonicity Properties and Their Adaptation to Irresolute Social Choice Rules. Social Choice and Welfare, 39, 371-398.
Sasaki, H. and Toda, M. 1992. Consistency and Characterization of the Core of Two-Sided Matching Problems. Journal of Economic Theory, 56, 218-227.
Sato, S. 2009. Informational Requirements of Social Choice Rules. Mathematical Social Sciences, 57(2), 188-198.
Satterthwaite, M. A. 1975. Strategy Proofness and Arrow's Conditions: Existence and Correspondence Theorems for Voting Procedures and Social Welfare Functions. Journal of Economic Theory, 10, 187-217.
Savage, L. J. 1951. The Theory of Statistical Decision. Journal of the American Statistical Association, 46(253), 55-67.
Scarsini, M. 1998. A Strong Paradox of Multiple Elections. Social Choice and Welfare, 15(2), 237-238.
Schalekamp, F. and van Zuylen, A. 2009. Rank Aggregation: Together We're Strong. In Proceedings of the 11th Workshop on Algorithm Engineering and Experiments, 38-51. Philadelphia: SIAM.
Schiex, T., Fargier, H., and Verfaillie, G. 1995. Valued Constraint Satisfaction Problems: Hard and Easy Problems. In Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI), 631-637. Palo Alto, CA: AAAI.
Schlotter, I., Faliszewski, P., and Elkind, E. 2011. Campaign Management Under Approval-Driven Voting Rules. In Proceedings of the 25th AAAI Conference on Artificial Intelligence, 726-731. Palo Alto, CA: AAAI.
Schmeidler, D. and Vind, K. 1972. Fair Net Trades. Econometrica, 40(4), 637-642.
Schulze, M. 2003. A New Monotonic and Clone-Independent Single-Winner Election Method. Voting Matters, 17, 9-19.
Schulze, M. 2011. A New Monotonic, Clone-Independent, Reversal Symmetric, and Condorcet-Consistent Single-Winner Election Method. Social Choice and Welfare, 36(2), 267-303.
Schwartz, T. 1972. Rationality and the Myth of the Maximum. Noûs, 6(2), 97-117.
Schwartz, T. 1986. The Logic of Collective Choice. New York: Columbia University Press.
Schwartz, T. 1990. Cyclic Tournaments and Cooperative Majority Voting: A Solution. Social Choice and Welfare, 7(1), 19-29.
Scott, A. and Fey, M. 2012. The Minimal Covering Set in Large Tournaments. Social Choice and Welfare, 38(1), 1-9.
Scott, S. 2005. A Study of Stable Marriage Problems with Ties. PhD thesis, University of Glasgow.
See, A., Bachrach, Y., and Kohli, P. 2014. The Cost of Principles: Analyzing Power in Compatibility Weighted Voting Games. In Proceedings of the 13th International Conference on Autonomous Agents andMultiagent Systems (AAMAS), 37-44. Richland, SC: IFAAMAS.
Seedig, H. G. 2014. Majority Relations and Tournament Solutions: A Computational Study. PhD thesis, Technische Universität München.
Sen, A. K. 1966. A Possibility Theorem on Majority Decisions. Econometrica, 34, 491-499.
Sen, A. K. 1970. Collective Choice and Social Welfare. Amsterdam: North-Holland.
Sen, A. K. 1986. Social Choice Theory. In Handbook of Mathematical Economics, vol. 3, ed. Arrow, K. J., and Intriligator, M. D., 1073-1181. New York: Elsevier.
Serafini, P. and Simeone, B. 2012. Parametric Maximum Flow Methods for Minimax Approximation of Target Quotas in Biproportional Apportionment. Networks, 59(2), 191-208.
Sertel, M. R. and Sanver, M. R. 2004. Strong Equilibrium Outcomes of Voting Games are the Generalized Condorcet Winners. Social Choice and Welfare, 22(2), 331-347.
Service, T. C. and Adams, J. A. 2012a. Strategyproof Approximations of Distance Rationalizable Voting Rules. In Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 569-576. Richland, SC: IFAAMAS.
Service, T. C. and Adams, J. A. 2012b. Communication Complexity of Approximating Voting Rules. In Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 593-602. Richland, SC: IFAAMAS.
Shapley, L. S. 1953. A Value for n-Person Games. In Contributions to the Theory of Games, vol. 2, ed. Kuhn, H. W., and Tucker, A. W., 307-317. Princeton, NJ: Princeton University Press.
Shapley, L. S. and Grofman, B. 1984. Optimizing Group Judgmental Accuracy in the Presence of Interdependencies. Public Choice, 43, 329-343.
Shapley, L. S. and Scarf, H. 1974. On Cores and Indivisibility. Journal of Mathematical Economics, 1, 23-37.
Shepard, R. N. 1959. Stimulus and Response Generalization: A Stochastic Model Relating Generalization to Distance in Psychological Space. Psychometrika, 22(4), 325-345.
Shepsle, K. A. and Weingast, B. R. 1984. Uncovered Sets and Sophisticated Outcomes with Implications for Agenda Institutions. American Journal of Political Science, 28(1), 49-74.
Shoham, Y. and Leyton-Brown, K. 2009. Multiagent Systems: Algorithmic, Game-Theoretic, and Logical Foundations. New York: Cambridge University Press.
Simjour, N. 2009. Improved Parameterized Algorithms for the Kemeny Aggregation Problem. In Proceedings of the 4th International Workshop on Parameterized and Exact Computation, 312-323. New York: Springer.
Simjour, N. 2013. Parameterized Enumeration of Neighbour Strings and Kemeny Aggregations. PhD thesis, University of Waterloo.
Skowron, P., Faliszewski, P., and Slinko, A. 2013a. Achieving Fully Proportional Representation is Easy in Practice. In Proceedings of the International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 399-406. Richland, SC: IFAAMAS.
Skowron, P., Yu, L., Faliszewski, P., and Elkind, E. 2013b. The Complexity of Fully Proportional Representation for Single-Crossing Electorates. In Proceedings of the International Symposium on Algorithmic Game Theory (SAGT), 1-12. New York: Springer.
Skowron, P., Faliszewski, P., and Slinko, A. 2013c. Fully Proportional Representation as Resource Allocation: Approximability Results. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), 353-359. Palo Alto, CA: AAAI.
Skowron, P., Faliszewski, P., and Lang, J. 2015. Finding a Collective Set of Items: From Proportional Multirepresentation to Group Recommendation. In Proceedings of the AAAI Conference on Artificial Intelligence, 2131-2137. Palo Alto, CA: AAAI.
Slater, P. 1961. Inconsistencies in a Schedule of Paired Comparisons. Biometrika, 48(3-4), 303-312.
Slinko, A. 2004. How Large Should a Coalition be to Manipulate an Election?Mathematical Social Sciences, 47(3), 289-293.
Slinko, A. and White, S. 2008. Non-Dictatorial Social Choice Rules are Safely Manipulable. In Proceedings of the 2nd International Workshop on Computational Social Choice (COMSOC), 403-413.
Smith, J. 1973. Aggregation of Preferences with Variable Electorate. Econometrica, 41(6), 1027- 1041.
Smith, R. G. 1980. The Contract Net Protocol: High-Level Communication and Control in a Distributed Problem Solver. IEEE Transactions on Computers, C-29(12), 1104-1113.
Smith, W. D. 2000. Range Voting. http://scorevoting.net/WarrenSmithPages/homepage/rangevote.pdf.
Sönmez, T. and Ünver, M. U. 2011. Matching, Allocation and Exchange of Discrete Resources. In Handbook of Social Economics, vol. 1A, ed. Benhabib, J., Bisin, A., and Jackson, M., 781-852. Amsterdam: North-Holland.
Sotomayor, M. 1999. Three Remarks on the Many-To-Many Stable Matching Problem. Mathematical Social Sciences, 38(1), 55-70.
Sprumont, Y. 1991. The Division Problem with Single-Peaked Preferences: A Characterization of the Uniform Allocation Rule. Econometrica, 59(2), 509-519.
Stanton, I. and Vassilevska Williams, V. 2011. Manipulating Stochastically Generated Single-Elimination Tournaments for Nearly All Players. In Proceedings of the International Conference on Web and Internet Economics (WINE), 326-337. New York: Springer.
Stanton, I. and Vassilevska Williams, V. 2013. The Structure, Efficacy, and Manipulation of Double-Elimination Tournaments. Journal of Quantitative Analysis in Sports, 9(4), 319-335.
Stearns, R. 1959. The Voting Problem. American Mathematical Monthly, 66(9), 761-763.
Steinhaus, H. 1948. The Problem of Fair Division. Econometrica, 16(1), 101-104.
van der Straeten, K., Laslier, J.-E, and Blais, A. 2013. Vote au Pluriel: How People Vote when Offered to Vote Under Different Rules. Political Science and Politics, 4(2), 324-328.
Stromquist, W. 2008. Envy-Free Cake Divisions Cannot be Found by Finite Protocols. Electronic Journal of Combinatorics, 15, #R11.
Sui, X., Francois-Nienaber, A., and Boutilier, C. 2013. Multi-Dimensional Single-Peaked Consistency and Its Approximations. In Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI), 375-382. Palo Alto, CA: AAAI.
Sung, S. C. and Dimitrov, D. 2007a. On Core Membership Testing for Hedonic Coalition Formation Games. Operations Research Letters, 35(2), 155-158.
Sung, S. C. and Dimitrov, D. 2007b. On Myopic Stability Concepts for Hedonic Games. Theory and Decision, 62(1), 31-45.
Sung, S. C. and Dimitrov, D. 2010. Computational Complexity in Additive Hedonic Games. European Journal of Operational Research, 203(3), 635-639.
Svensson, L. G. 1999. Strategy-Proof Allocation of Indivisible Goods. Social Choice and Welfare, 16, 557-567.
Takagi, S. and Serizawa, S. 2010. An Impossibility Theorem for Matching Problems. Social Choice and Welfare, 35, 245-266.
Tamura, A. 1993. Transformation from Arbitrary Matchings to Stable Matchings. Journal of Combi-natorial Theory, Series A, 62, 310-323.
Tan, J. J. M. and Su, W. C. 1995. On the Divorce Digraph of the Stable Marriage Problem. Proceedings of the National Science Council, Republic of China, Part A, 19(2), 342-354.
Tang, P. and Lin, F. 2009. Computer-Aided Proofs of Arrow's and Other Impossibility Theorems. Artificial Intelligence, 173(11), 1041-1053.
Taylor, A. D. 1995. Mathematics and Politics. New York: Springer.
Taylor, A. D. 2005. Social Choice and the Mathematics of Manipulation. New York: Cambridge University Press.
Taylor, A. D. and Pacelli, A. M. 2006. Mathematics and Politics: Strategy, Voting, Power and Proof. 2nd ed. New York: Springer.
Taylor, A. D. and Zwicker, W. S. 1999. Simple games: Desirability Relations, Trading, Pseudoweightings. Princeton, NJ: Princeton University Press.
Tennenholtz, M. 2004. Reputation Systems: An Axiomatic Approach. In Proceedings of the Conference on Uncertainty in Artificial Intelligence (UAI), 544-551. New York: Morgan Kaufmann.
Thompson, D. R. M., Lev, O., Leyton-Brown, K., and Rosenschein, J. S. 2013. Empirical Analysis of Plurality Election Equilibria. In Proceedings of the 12th International Conference on Autonomous Agents andMultiagent Systems (AAMAS), 391-398. Richland, SC: IFAAMAS.
Thomson, W. 1983. The Fair Division of a Fixed Supply among a Growing Population. Mathematics of Operations Research, 8(3), 319-326.
Thomson, W. 1994a. Consistent Solutions to the Problem of Fair Division when Preferences are Single-Peaked. Journal of Economic Theory, 63(2), 219-245.
Thomson, W. 1994b. Notions of Equal, or Equivalent, Opportunities. Social Choice and Welfare, 11(2), 137-156.
Thomson, W. 1999. Welfare-Domination Under Preference-Replacement: A Survey and Open Questions. Social Choice and Welfare, 16(3), 373-394.
Thomson, W. 2003. Axiomatic and Game-Theoretic Analysis of Bankruptcy and Taxation Problems: A Survey. Mathematical Social Sciences, 45(3), 249-297.
Thomson, W. 2011. Fair Allocation Rules. Handbook of Social Choice and Welfare, 2, 393-506.
Thomson, W. 2012. On the Axiomatics of Resource Allocation: Interpreting the Consistency Principle. Economics and Philosophy, 28(03), 385-421.
Thomson, W. 2014a. Axiomatic and Game-Theoretic Analysis of Bankruptcy and Taxation Problems: A Survey. Technical report, University of Rochester, Center for Economic Research (RCER).
Thomson, W. 2014b. Consistent Allocation Rules. Technical report, University of Rochester-Center for Economic Research (RCER).
Thomson, W. 2014c. Population-Monotonic Allocation Rules. Technical report, University of Rochester, Center for Economic Research (RCER).
Thomson, W. 2014d. The Theory of Fair Allocation. Unpublished manuscript.
Tideman, N. 1987. Independence of Clones as a Criterion for Voting Rules. Social Choice and Welfare, 4(3), 185-206.
Tideman, N. 2006. Collective Decisions and Voting: The Potential for Public Choice. Farnham: Ashgate.
Toda, M. 2006. Monotonicity and Consistency in Matching Markets. International Journal of Game Theory, 34, 13-31.
Todo, T., Iwasaki, A., and Yokoo, M. 2011. False-Name-Proof Mechanism Design without Money. In Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 651-658. Richland, SC: IFAAMAS.
Trick, M. A. 1989. Recognizing Single-Peaked Preferences on a Tree. Mathematical Social Sciences, 17(3), 329-334.
Truchon, M. 1998. An Extension of the Concordet Criterion and Kemeny Orders. Cahier 98- 15, Centre de Recherche en Economie et Finance Appliquees, Universite Laval, Quebec, Canada.
Truchon, M. 2008. Borda and the Maximum Likelihood Approach to Vote Aggregation. Mathematical Social Sciences, 55(1), 96-102.
Uckelman, J. 2009. More Than the Sum of Its Parts: Compact Preference Representation Over Combinatorial Domains. PhD thesis, University of Amsterdam.
Uckelman, S. L. and Uckelman, J. 2010. Strategy and Manipulation in Medieval Elections. In Proceedings of the 3rd International Workshop on Computational Social Choice (COMSOC), 15-16.
Vassilevska Williams, V. 2009. Fixing a Single-Elimination Tournament. Unpublished manuscript.
Vassilevska Williams, V. 2010. Fixing a Tournament. In Proceedings of the AAAI Conference on Artificial Intelligence, 895-900. Palo Alto, CA: AAAI.
Vazirani, V. 2001. Approximation Algorithms. New York: Springer.
Vazirani, V. 2007. Combinatorial Algorithms for Market Equilibria. In Algorithmic Game Theory, ed. Nisan, N., Roughgarden, T., Tardos, E., and Vazirani, V, Chapter 5. New York: Cambridge University Press.
Vetschera, R. 2010. A General Branch-And-Bound Algorithm for Fair Division Problems. Computers and Operations Research, 37, 189-201.
Vu, T. and Shoham, Y. 2010a. Broadening the Scope of Optimal Seeding Analysis in Knockout Tournaments. Unpublished manuscript.
Vu, T. and Shoham, Y. 2010b. Optimal Seeding in Knockout Tournaments. In Proceedings of the International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 1579-1580. Richland, SC: IFAAMAS.
Vu, T., Altman, A., and Shoham, Y. 2009a. On the Complexity of Schedule Control Problems for Knockout Tournaments. In Proceedings of the International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 225-232. Richland, SC: IFAAMAS.
Vu, T., Hazon, N., Altman, A., Kraus, S., Shoham, Y, and Wooldridge, M. 2009b. On the Complexity of Schedule Control Problems for Knock-out Tournaments. Working paper.
Vulkan, N., Roth, A. E., and Neeman, Z., eds. 2013. Handbook of Market Design. Oxford: Oxford University Press.
Wagner, K. 1987. More Complicated Questions about Maxima and Minima, and Some Closures of NP. Theoretical Computer Science, 51(1-2), 53-80.
Wagner, K. 1990. Bounded Query Classes. SIAM Journal on Computing, 19(5), 833-846.
Wakabayashi, Y 1986. Aggregation of Binary Relations: Algorithmic and Polyhedral Investigations. PhD thesis, Universitat Augsburg.
Wakabayashi, Y 1998. The Complexity of Computing Medians of Relations. Resenhas, 3(3), 323-349.
Walsh, T. 2007. Uncertainty in Preference Elicitation and Aggregation. In Proceedings of the AAAI Conference on Artificial Intelligence, 3-8. Palo Alto, CA: AAAI.
Walsh, T. 2008. Complexity of Terminating Preference Elicitation. In Proceedings of the 7th Interna¬tional Conference on Autonomous Agents and Multiagent Systems (AAMAS), 967-974. Richland, SC: IFAAMAS.
Walsh, T. 2009. Where are the Really Hard Manipulation Problems? The Phase Transition in Manip¬ulating the Veto Rule. In Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI), 324-329. Palo Alto, CA: AAAI.
Walsh, T. 2010. An Empirical Study of the Manipulability of Single Transferable Voting. In Proceed¬ings of the 19th European Conference on Artificial Intelligence (ECAI), 257-262. Amsterdam: IOS Press.
Walsh, T. 2011a. Is Computational Complexity a Barrier to Manipulation?Annals of Mathematics and Artificial Intelligence, 62(1-2), 7-26.
Walsh, T. 2011b. Where are the Hard Manipulation Problems?Journal of Artificial Intelligence Research (JAIR), 42, 1-39.
Walsh, T. and Xia, L. 2012. Lot-Based Voting Rules. In Proceedings of the 12th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 603-610. Richland, SC: IFAAMAS.
Wilson, N. 2004. Extending CP-Nets with Stronger Conditional Preference Statements. In Proceedings of the 19th AAAI Conference on Artificial Intelligence, 735-741. Palo Alto, CA: AAAI.
Wilson, R. 1975. On the Theory of Aggregation. Journal of Economic Theory, 10(1), 89-99.
Woeginger, G. J. 2013. Core Stability in Hedonic Coalition Formation. In Proceedings of the 39th International Conference on Current Trends in Theory and Practice of Computer Science, 33-50. New York: Springer.
Woeginger, G. J. 2003. Banks Winners in Tournaments Are Difficult to Recognize. Social Choice and Welfare, 20, 523-528.
Woeginger, G. J. and Sgall, J. 2007. On the Complexity of Cake Cutting. Discrete Optimization, 4, 213-220.
Wojtas, K. and Faliszewski, P. 2012. Possible Winners in Noisy Elections. In Proceedings of the 26th AAAI Conference on Artificial Intelligence, 1499-1505. Palo Alto, CA: AAAI.
Wooldridge, M. 2009. Multiagent Systems. 2nd ed. New York: John Wiley.
Xia, L. 2012a. Computing the Margin of Victory for Various Voting Rules. In Proceedings of the 13th ACM Conference on Electronic Commerce (EC), 982–999. New York: ACM Press.
Xia, L. 2012b. How Many Vote Operations Are Needed to Manipulate a Voting System?In Proceedings of the 4th International Workshop on Computational Social Choice (COMSOC), 443–454.
Xia, L. 2013. Generalized Scoring Rules: A Framework that Reconciles Borda and Condorcet. SIGecom Exchanges, 12, 42–48.
Xia, L. 2014a. Deciphering Young's Interpretation of Condorcet's Model. Unpublished manuscript.
Xia, L. 2014b. Statistical Properties of Social Choice Mechanisms. In Proceedings of the 5th International Workshop on Computational Social Choice (COMSOC).
Xia, L. and Conitzer, V. 2008a. Generalized Scoring Rules and the Frequency of Coalitional Manipulability. In Proceedings of the ACM Conference on Electronic Commerce (EC), 109–118. New York: ACM.
Xia, L. and Conitzer, V. 2008b. A Sufficient Condition for Voting Rules to be Frequently Manipulable. In Proceedings of the 9th ACM Conference on Electronic Commerce (EC), 99–108. New York: ACM.
Xia, L. and Conitzer, V. 2009. Finite Local Consistency Characterizes Generalized Scoring Rules. In Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI), 336–341. Palo Alto, CA: AAAI.
Xia, L. and Conitzer, V. 2010a. Strategy-Proof Voting Rules Over Multi-Issue Domains with Restricted Preferences. In Proceedings of the International Conference on Web and Internet Economics (WINE), 402–414. New York: Springer.
Xia, L. and Conitzer, V. 2010b. Compilation Complexity of Common Voting Rules. In Proceedings of the AAAI Conference on Artificial Intelligence, 915–920. Palo Alto, CA: AAAI.
Xia, L. and Conitzer, V. 2010c. Stackelberg Voting Games: Computational Aspects and Paradoxes. In Proceedings of the AAAI Conference on Artificial Intelligence, 921–926. Palo Alto, CA: AAAI.
Xia, L. and Conitzer, V. 2011a. Determining Possible and Necessary Winners Given Partial Orders. Journal of Artificial Intelligence Research (JAIR), 41, 25–67.
Xia, L. and Conitzer, V. 2011b. A Maximum Likelihood Approach Towards Aggregating Partial Orders. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), 446–451. Palo Alto, CA: AAAI.
Xia, L. and Lang, J. 2009. A Dichotomy Theorem on the Existence of Efficient or Neutral Sequential Voting Correspondences. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), 342–347. Palo Alto, CA: AAAI.
Xia, L., Conitzer, V., and Lang, J. 2008. Voting on Multiattribute Domains with Cyclic Preferential Dependencies. In Proceedings of the AAAI Conference on Artificial Intelligence, 202–207. Palo Alto, CA: AAAI.
Xia, L., Zuckerman, M., Procaccia, A. D., Conitzer, V., and Rosenschein, J. S. 2009. Complexity of Unweighted Coalitional Manipulation Under Some Common Voting Rules. In Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI), 348–353. Palo Alto, CA: AAAI.
Xia, L., Conitzer, V., and Lang, J. 2010a. Aggregating Preferences in Multi-Issue Domains by Using Maximum Likelihood Estimators. In Proceedings of the International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 399–408. Richland, SC: IFAAMAS.
Xia, L., Conitzer, V., and Procaccia, A. D. 2010b. A Scheduling Approach to Coalitional Manipulation. In Proceedings of the 11th ACM Conference on Electronic Commerce (EC), 275–284. New York: ACM.
Xia, L., Conitzer, V., and Lang, J. 2011a. Strategic Sequential Voting in Multi-Issue Domains and Multiple-Election Paradoxes. In Proceedings of the ACM Conference on Electronic Commerce (EC), 179–188. New York: ACM.
Xia, L., Lang, J., and Monnot, J. 2011b. Possible Winners when New Alternatives Join: New Results Coming Up!In Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 829–836. Richland, SC: IFAAMAS.
Yager, R. R. 1988. On OrderedWeighted Averaging Aggregation Operators in Multicriteria Decision Making. IEEE Transactions on Systems, Man, and Cybernetics, 18, 183–190.
Yannakakis, M. 2008. Equilibria, Fixed Points, and Complexity Classes. In Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science (STACS), 19–38. NewYork: Springer.
Yao, A. C.-C. 1979. Some Complexity Questions Related to Distributive Computing (Preliminary Report). In Proceedings of the 11th ACM Symposium on Theory of Computing (STOC), 209–213. New York: ACM.
Yokoo, M., Sakurai, Y., and Matsubara, S. 2004. The Effect of False-Name Bids in Combinatorial Auctions: New Fraud in Internet Auctions. Games and Economic Behavior, 46(1), 174–188.
Young, H. P. 1975. Social Choice Scoring Functions. SIAM Journal on Applied Mathematics, 28(4), 824–838.
Young, H. P. 1977. Extending Condorcet's Rule. Journal of Economic Theory, 16(2), 335–353.
Young, H. P. 1987. On Dividing an Amount According to Individual Claims or Liabilities. Mathematics of Operations Research, 12(3), 398–414.
Young, H. P. 1988. Condorcet's Theory of Voting. American Political Science Review, 82(4), 1231–1244.
Young, H. P. 1995a. Optimal Voting Rules. Journal of Economic Perspectives, 9(1), 51–64.
Young, H. P. 1995b. Equity: in theory and practice. Princeton, NJ: Princeton University Press.
Young, H. P. 1998. Individual Strategy and Social Structure: An Evolutionary Theory of Institutions. Princeton, NJ: Princeton University Press.
Young, H. P. and Levenglick, A. 1978. A Consistent Extension of Condorcet's Election Principle. SIAM Journal on Applied Mathematics, 35(2), 285–300.
Yu, L., Chan, H., and Elkind, E. 2013. Multiwinner Elections Under Preferences That Are Single-Peaked on a Tree. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), 425–431. Palo Alto, CA: AAAI.
Zavist, T. M. and Tideman, T. N. 1989. Complete Independence of Clones in the Ranked Pairs Rule. Social Choice and Welfare, 6(2), 167–173.
Zhou, L. 1990. On a Conjecture by Gale About One-SidedMatching Problems. Journal of Economic Theory, 52(1), 123–135.
Zhu, M. 2014. College Admissions in China: A Mechanism Design Perspective. China Economic Review, 30, 618–631.
Zick, Y., Skopalik, A., and Elkind, E. 2011. The Shapley Value as a Function of the Quota inWeighted Voting Games. In Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI), 490–496. Palo Alto, CA: AAAI.
Zivan, R. 2011. Can Trust Increase the Efficiency of Cake Cutting Algorithms?In Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 1145–1146. Richland, SC: IFAAMAS.
Zuckerman, M., Faliszewski, P., Bachrach, Y., and Elkind, E. 2008. Manipulating the Quota in Weighted Voting Games. In Proceedings of the 23rd AAAI Conference on Artificial Intelligence, 215–220. Palo Alto, CA: AAAI.
Zuckerman, M., Procaccia, A. D., and Rosenschein, J. S. 2009. Algorithms for the Coalitional Manipulation Problem. Artificial Intelligence, 173(2), 392–412.
Zuckerman, M., Faliszewski, P., Conitzer, V., and Rosenschein, J. S. 2011. An NTU Cooperative Game Theoretic View of Manipulating Elections. In Proceedings of the 7th International Conference on Web and Internet Economics (WINE), 363–374. New York: Springer.
van Zuylen, A. and Williamson, D. P. 2009. Deterministic Pivoting Algorithms for Constrained Ranking and Clustering Problems. Mathematics of Operations Research, 34, 594–620.
Zwicker, W. S. 1991. The Voters' Paradox, Spin, and the Borda Count. Mathematical Social Sciences, 22, 187–227.
Zwicker, W. S. 2008. Consistency without Neutrality in Voting Rules: When is a Vote an Average?Mathematical and Computer Modelling, 48, 1357–1373.