{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T17:58:18Z","timestamp":1769277498788,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":93,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540695066","type":"print"},{"value":"9783540695073","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-69507-3_4","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T13:35:58Z","timestamp":1184592958000},"page":"51-69","source":"Crossref","is-referenced-by-count":96,"title":["A Short Introduction to Computational Social Choice"],"prefix":"10.1007","author":[{"given":"Yann","family":"Chevaleyre","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ulle","family":"Endriss","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00e9r\u00f4me","family":"Lang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Maudet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"\u00c5gotnes, T., van der Hoek, W., Wooldridge, M.: On the Logic of Coalitional Games. In: Proceedings of AAMS-2006 (2006)","DOI":"10.1145\/1160633.1160659"},{"key":"4_CR2","unstructured":"\u00c5gotnes, T., van\u00a0der Hoek, W., and Wooldridge, M.: Towards a Logic of Social Welfare. In: Proceedings of LOFT-2006 (2006)"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Ailon, N., Charikar, M., Newman, A.: Aggregating Inconsistent Information: Ranking and Clustering. In: Proceedings of STOC-2005 (2005)","DOI":"10.1145\/1060590.1060692"},{"issue":"1\u20132","key":"4_CR4","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1137\/050623905","volume":"20","author":"N. Alon","year":"2006","unstructured":"Alon, N.: Ranking Tournaments. SIAM Journal of Discrete Mathematics\u00a020(1\u20132), 137\u2013142 (2006)","journal-title":"SIAM Journal of Discrete Mathematics"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Altman, A., Tennenholtz, M.: Ranking Systems: The PageRank Axioms. In: Proceedings of EC-2005 (2005)","DOI":"10.1145\/1064009.1064010"},{"key":"4_CR6","volume-title":"Social Choice and Individual Values","author":"K. Arrow","year":"1951","unstructured":"Arrow, K.: Social Choice and Individual Values, 2nd edn. John Wiley and Sons, Chichester (1951)","edition":"2"},{"key":"4_CR7","unstructured":"Baltag, A., Moss, L., Solecki, S.: The Logic of Public Annoucements, Common Knowledge, and Private Suspicion. In: Proceedings of TARK-1998 (1998)"},{"issue":"4","key":"4_CR8","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/BF00183045","volume":"8","author":"J. Bartholdi","year":"1991","unstructured":"Bartholdi, J., Orlin, J.: Single Transferable Vote Resists Strategic Voting. Social Choice and Welfare\u00a08(4), 341\u2013354 (1991)","journal-title":"Social Choice and Welfare"},{"issue":"3","key":"4_CR9","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/BF00295861","volume":"6","author":"J. Bartholdi","year":"1989","unstructured":"Bartholdi, J., Tovey, C., Trick, M.: The Computational Difficulty of Manipulating an Election. Social Choice and Welfare\u00a06(3), 227\u2013241 (1989)","journal-title":"Social Choice and Welfare"},{"issue":"3","key":"4_CR10","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF00303169","volume":"6","author":"J. Bartholdi","year":"1989","unstructured":"Bartholdi, J., Tovey, C., Trick, M.: Voting Schemes for Which It Can Be Difficult to Tell Who Won the Election. Social Choice and Welfare\u00a06(3), 157\u2013165 (1989)","journal-title":"Social Choice and Welfare"},{"issue":"8\/9","key":"4_CR11","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0895-7177(92)90085-Y","volume":"16","author":"J. Bartholdi","year":"1992","unstructured":"Bartholdi, J., Tovey, C., Trick, M.: How Hard Is It to Control an Election? Mathematical and Computer Modeling\u00a016(8\/9), 27\u201340 (1992)","journal-title":"Mathematical and Computer Modeling"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Bouveret, S., Fargier, H., Lang, J., Lema\u00eetre, M.: Allocation of Indivisible Goods: A General Model and Some Complexity Results. In: Proceedings of AAMAS-2005 (2005)","DOI":"10.1145\/1082473.1082747"},{"key":"4_CR13","unstructured":"Bouveret, S., Lang, J.: Efficiency and Envy-Freeness in Fair Division of Indivisible Goods: Logical Representation and Complexity. In: Proceedings of IJCAI-2005 (2005)"},{"key":"4_CR14","unstructured":"Brams, S., Edelman, P., Fishburn, P.: Fair Division of Indivisible Items. Technical Report RR 2000-15, C.V. Starr Center for Applied Economics, New York University (2000)"},{"key":"4_CR15","volume-title":"Handbook of Social Choice and Welfare","author":"S. Brams","year":"2004","unstructured":"Brams, S., Fishburn, P.: Voting Procedures. In: Arrow, K., Sen, A. (eds.) Handbook of Social Choice and Welfare, Elsevier, Amsterdam (2004)"},{"key":"4_CR16","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/s003550050101","volume":"15","author":"S. Brams","year":"1998","unstructured":"Brams, S., Kilgour, D.M., Zwicker, W.: The Paradox of Multiple Elections. Social Choice and Welfare\u00a015, 211\u2013236 (1998)","journal-title":"Social Choice and Welfare"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Brandt, F.: Social Choice and Preference Protection \u2013 Towards Fully Private Mechanism Design. In: Proceedings of EC-2003 (2003)","DOI":"10.1145\/779928.779968"},{"key":"4_CR18","unstructured":"Brandt, F., Sandholm, T.: Unconditional Privacy in Social Choice. In: Proceedings of TARK-2005 (2005)"},{"key":"4_CR19","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/S1571-0653(05)80125-8","volume":"5","author":"I. Charon","year":"2000","unstructured":"Charon, I., Hudry, O.: Slater Orders and Hamiltonian Paths of Tournaments. Electronic Notes in Discrete Mathematics\u00a05, 60\u201363 (2000)","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"4_CR20","first-page":"3","volume":"30","author":"Y. Chevaleyre","year":"2006","unstructured":"Chevaleyre, Y., Dunne, P.E., Endriss, U., Lang, J., Lema\u00eetre, M., Maudet, N., Padget, J., Phelps, S., Rodr\u00edguez-Aguilar, J.A., Sousa, P.: Issues in Multiagent Resource Allocation. Informatica\u00a030, 3\u201331 (2006)","journal-title":"Informatica"},{"key":"4_CR21","unstructured":"Chevaleyre, Y., Endriss, U., Estivie, S., Maudet, N.: Reaching Envy-Free States in Distributed Negotiation Settings. In: Proceedings of IJCAI-2007 (2007)"},{"key":"4_CR22","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/j.inffus.2005.05.003","volume":"1","author":"S. Chopra","year":"2006","unstructured":"Chopra, S., Ghose, A., Meyer, T.: Social Choice Theory, Belief Merging, and Strategy-Proofness. International Journal on Information Fusion\u00a01, 61\u201379 (2006)","journal-title":"International Journal on Information Fusion"},{"key":"4_CR23","unstructured":"Conitzer, V.: Computing Slater Rankings Using Similarities among Candidates. In: Proceedings of AAAI-2006 (2006)"},{"key":"4_CR24","unstructured":"Conitzer, V., Davenport, A., Kalagnanam, J.: Improved Bounds for Computing Kemeny Rankings. In: Proceedings of AAAI-2006 (2006)"},{"key":"4_CR25","doi-asserted-by":"crossref","unstructured":"Conitzer, V., Lang, J., Sandholm, T.: How Many Candidates Are Required to Make an Election Hard to Manipulate? In: Proceedings of TARK-2003 (2003)","DOI":"10.1145\/846267.846268"},{"key":"4_CR26","unstructured":"Conitzer, V., Sandholm, T.: Complexity of Manipulating Elections with Few Candidates. In: Proceedings of AAAI-2002 (2002)"},{"key":"4_CR27","unstructured":"Conitzer, V., Sandholm, T.: Vote Elicitation: Complexity and Strategy-Proofness. In: Proceedings of AAAI-2002 (2002)"},{"key":"4_CR28","unstructured":"Conitzer, V., Sandholm, T.: Universal Voting Protocols to Make Manipulation Hard. In: Proceedings of IJCAI-2003 (2003)"},{"key":"4_CR29","unstructured":"Conitzer, V., Sandholm, T.: Computing Shapley Values, Manipulating Value Division Schemes, and Checking Core Membership in Multi-Issue Domains. In: AAAI, pp. 219\u2013225 (2004)"},{"key":"4_CR30","doi-asserted-by":"crossref","unstructured":"Conitzer, V., Sandholm, T.: Communication Complexity of Common Votiong Rules. In: Proceedings of EC-2005 (2005)","DOI":"10.1145\/1064009.1064018"},{"issue":"6-7","key":"4_CR31","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1016\/j.artint.2006.01.005","volume":"170","author":"V. Conitzer","year":"2006","unstructured":"Conitzer, V., Sandholm, T.: Complexity of Constructing Solutions in the Core Based on Synergies among Coalitions. Artif. Intell.\u00a0170(6-7), 6\u20137 (2006)","journal-title":"Artif. Intell."},{"key":"4_CR32","unstructured":"Conitzer, V., Sandholm, T.: Nonexistence of Voting Rules that Are Usually Hard to Manipulate. In: Proceedings of AAAI-2006 (2006)"},{"key":"4_CR33","doi-asserted-by":"crossref","unstructured":"Conitzer, V., Sandholm, T.W.: Complexity of Mechanism Design. In: Proceedings of UAI-2002 (2002)","DOI":"10.1145\/948005.948008"},{"key":"4_CR34","unstructured":"Coste-Marquis, S., Lang, J., Liberatore, P.: Marquis\u00a0P.: Expressive Power and Succinctness of Propositional Languages for Preference Representation. In: Proceedings of KR-2004 (2004)"},{"key":"4_CR35","volume-title":"Combinatorial Auctions","author":"P. Cramton","year":"2006","unstructured":"Cramton, P., Shoham, Y., Steinberg, R.: Combinatorial Auctions. MIT Press, Cambridge (2006)"},{"key":"4_CR36","unstructured":"Davenport, A., Kalagnanam, J.: A Computational Study of the Kemeny Rule for Preference Aggregation. In: Proceedings of AAAI-2004 (2004)"},{"key":"4_CR37","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0165-4896(88)90047-9","volume":"16","author":"S. Demko","year":"1998","unstructured":"Demko, S., Hill, T.P.: Equitable Distribution of Indivisible Items. Mathematical Social Sciences\u00a016, 145\u2013158 (1998)","journal-title":"Mathematical Social Sciences"},{"key":"4_CR38","doi-asserted-by":"crossref","unstructured":"Dietrich, F., List, C.: Judgment Aggregation by Quota Rules. Journal of Theoretical Politics, Forthcoming (2006)","DOI":"10.1177\/0951629807080775"},{"key":"4_CR39","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1613\/jair.1526","volume":"23","author":"P.E. Dunne","year":"2005","unstructured":"Dunne, P.E.: Extremal Behaviour in Multiagent Contract Negotiation. Journal of Artificial Intelligence Research\u00a023, 41\u201378 (2005)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"4_CR40","unstructured":"Dunne, P.E., Chevaleyre, Y.: Negotiation Can Be as Hard as Planning: Deciding Reachability Properties of Distributed Negotiation Schemes. Technical Report ULCS-05-009, Department of Computer Science, University of Liverpool (2005)"},{"issue":"1\u20132","key":"4_CR41","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.artint.2005.01.006","volume":"164","author":"P.E. Dunne","year":"2005","unstructured":"Dunne, P.E., Wooldridge, M., Laurence, M.: The Complexity of Contract Negotiation. Artificial Intelligence\u00a0164(1\u20132), 23\u201346 (2005)","journal-title":"Artificial Intelligence"},{"key":"4_CR42","unstructured":"Eckert, D., Pigozzi, G.: Belief Merging, Judgment Aggregation, and Some Links with Social Choice Theory. In: Belief Change in Rational Agents: Perspectives from Artificial Intelligence, Philosophy, and Economics, Dagstuhl Seminar Proceedings\u00a005321 (2005)"},{"key":"4_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/11602613_22","volume-title":"Algorithms and Computation","author":"E. Elkind","year":"2005","unstructured":"Elkind, E., Lipmaa, H.: Hybrid Voting Protocols and Hardness of Manipulation. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol.\u00a03827, pp. 206\u2013215. Springer, Heidelberg (2005)"},{"issue":"1","key":"4_CR44","first-page":"91","volume":"11","author":"U. Endriss","year":"2005","unstructured":"Endriss, U., Maudet, N.: On the Communication Complexity of Multilateral Trading: Extended Report. Journal of Autonomous Agents and Multiagent Systems\u00a011(1), 91\u2013107 (2005)","journal-title":"Journal of Autonomous Agents and Multiagent Systems"},{"key":"4_CR45","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1613\/jair.1870","volume":"25","author":"U. Endriss","year":"2006","unstructured":"Endriss, U., Maudet, N., Sadri, F., Toni, F.: Negotiating Socially Optimal Allocations of Resources. Journal of Artificial Intelligence Research\u00a025, 315\u2013348 (2006)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"4_CR46","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/11853886_13","volume-title":"Logics in Artificial Intelligence","author":"U. Endriss","year":"2006","unstructured":"Endriss, U., Pacuit, E.: Modal logics of negotiation and preference. In: Fisher, M., van der Hoek, W., Konev, B., Lisitsa, A. (eds.) JELIA 2006. LNCS (LNAI), vol.\u00a04160, pp. 138\u2013150. Springer, Heidelberg (2006)"},{"key":"4_CR47","unstructured":"Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L.A.: The Complexity of Bribery in Elections. In: Proceedings of AAAI-2006 (2006)"},{"key":"4_CR48","doi-asserted-by":"publisher","first-page":"587","DOI":"10.2307\/1914083","volume":"41","author":"A. Gibbard","year":"1973","unstructured":"Gibbard, A.: Manipulation of Voting Schemes. Econometrica\u00a041, 587\u2013602 (1973)","journal-title":"Econometrica"},{"key":"4_CR49","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/2516.001.0001","volume-title":"Dynamic Logic","author":"D. Harel","year":"2000","unstructured":"Harel, D., Kozen, D., Tiuryn, J.: Dynamic Logic. MIT Press, Cambridge (2000)"},{"issue":"6","key":"4_CR50","doi-asserted-by":"publisher","first-page":"806","DOI":"10.1145\/268999.269002","volume":"44","author":"E. Hemaspaandra","year":"1997","unstructured":"Hemaspaandra, E., Hemaspaandra, L.A., Rothe, J.: Exact Analysis of Dodgson Elections: Lewis Carroll\u2019s 1876 System Is Complete for Parallel Access to NP. JACM\u00a044(6), 806\u2013825 (1997)","journal-title":"JACM"},{"key":"4_CR51","unstructured":"Hemaspaandra, E., Hemaspaandra, L.A., Rothe, J.: Anyone but Him: The Complexity of Precluding an Alternative. In: AAAI (2005)"},{"key":"4_CR52","unstructured":"Hemaspaandra, E., Spakowski, H., Vogel, J.: The Complexity of Kemeny Elections. Jenaer Schriften zur Mathematik und Informatik (2003)"},{"key":"4_CR53","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/s003550100119","volume":"19","author":"D. Herreiner","year":"2002","unstructured":"Herreiner, D., Puppe, C.: A Simple Procedure for Finding Equitable Allocations of Indivisible Goods. Social Choice and Welfare\u00a019, 415\u2013430 (2002)","journal-title":"Social Choice and Welfare"},{"key":"4_CR54","unstructured":"Hudry, O.: Computation of Median Orders: Complexity Results. In: Proceedings of the DIMACS-LAMSADE Workshop on Computer Science and Decision Theory, Annales du LAMSADE\u00a03 (2004)"},{"issue":"1","key":"4_CR55","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s00355-003-0241-y","volume":"23","author":"O. Hudry","year":"2004","unstructured":"Hudry, O.: A Note on Banks Winners in Tournaments Are Difficult to Recognize. Social Choice and Welfare\u00a023(1), 113\u2013114 (2004)","journal-title":"Social Choice and Welfare"},{"key":"4_CR56","unstructured":"Hudry, O.: Improvements of a Branch and Bound Method to Compute the Slater Orders of Tournaments. Technical report, ENST (2006)"},{"key":"4_CR57","unstructured":"Konczak, K., Lang, J.: Voting Procedures with Incomplete Preferences. In: Proceedings of the Multidisplinary Workshop on Advances in Preference Handling (2005)"},{"issue":"1-2","key":"4_CR58","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.artint.2004.04.008","volume":"157","author":"S. Konieczny","year":"2004","unstructured":"Konieczny, S., Lang, J., Marquis, P.: DA2 Merging Operators. Artificial Intelligence\u00a0157(1-2), 49\u201379 (2004)","journal-title":"Artificial Intelligence"},{"issue":"3","key":"4_CR59","doi-asserted-by":"publisher","first-page":"785","DOI":"10.1016\/j.ejor.2003.06.039","volume":"160","author":"S. Konieczny","year":"2005","unstructured":"Konieczny, S., P\u00e9rez, R.P.: Propositional Belief Base Merging or How to Merge Beliefs\/Goals Coming from Several Sources and Some Links with Social Choice Theory. European Journal of Operational Research\u00a0160(3), 785\u2013802 (2005)","journal-title":"European Journal of Operational Research"},{"key":"4_CR60","volume-title":"Communication Complexity","author":"E. Kushilevitz","year":"1997","unstructured":"Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press, New York (1997)"},{"issue":"1","key":"4_CR61","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1023\/B:AMAI.0000034522.25580.09","volume":"42","author":"J. Lang","year":"2004","unstructured":"Lang, J.: Logical Preference Representation and Combinatorial Vote. Annals of Mathematics and Artificial Intelligence\u00a042(1), 37\u201371 (2004)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"4_CR62","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/11518655_3","volume-title":"Symbolic and Quantitative Approaches to Reasoning with Uncertainty","author":"J. Lang","year":"2005","unstructured":"Lang, J.: Some Representation and Computational Issues in Social Choice. In: Godo, L. (ed.) ECSQARU 2005. LNCS (LNAI), vol.\u00a03571, pp. 15\u201326. Springer, Heidelberg (2005)"},{"key":"4_CR63","unstructured":"Lang, J.: Vote and Aggregation in Combinatorial Domains with Structured Preferences. In: Proceedings of IJCAI-2007 (2007)"},{"key":"4_CR64","unstructured":"Lang, J., Pini, M., Rossi, F., Venable, K.: Walsh,\u00a0T.: Winner Determination in Sequential Majority Voting with Incomplete Preferences. In: Proceedings of Multidisciplinary ECAI06 Workshop about Advances on Preference Handling (2006)"},{"key":"4_CR65","doi-asserted-by":"crossref","unstructured":"Lipton, R., Markakis, E., Mossel, E., Saberi, A.: On Approximately Fair Allocations of Indivisible Goods. In: Proceedings of EC-2004 (2004)","DOI":"10.1145\/988772.988792"},{"key":"4_CR66","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1613\/jair.1206","volume":"19","author":"P. Maynard-Zhang","year":"2003","unstructured":"Maynard-Zhang, P., Lehmann, D.: Representing and Aggregating Conflicting Beliefs. Journal of Artificial Intelligence Research\u00a019, 155\u2013203 (2003)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"4_CR67","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1007\/3-540-44652-4_41","volume-title":"Symbolic and Quantitative Approaches to Reasoning with Uncertainty","author":"T. Meyer","year":"2001","unstructured":"Meyer, T., Ghose, A.K., Chopra, S.: Social Choice, Merging, and Elections. In: Benferhat, S., Besnard, P. (eds.) ECSQARU 2001. LNCS (LNAI), vol.\u00a02143, p. 466. Springer, Heidelberg (2001)"},{"key":"4_CR68","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/BF00128122","volume":"35","author":"H. Moulin","year":"1980","unstructured":"Moulin, H.: On Strategy-Proofness and Single Peakedness. Public Choice\u00a035, 437\u2013455 (1980)","journal-title":"Public Choice"},{"key":"4_CR69","doi-asserted-by":"crossref","DOI":"10.1017\/CCOL0521360552","volume-title":"Axioms of Cooperative Decision Making","author":"H. Moulin","year":"1988","unstructured":"Moulin, H.: Axioms of Cooperative Decision Making. Cambridge University Press, Cambridge (1988)"},{"key":"4_CR70","unstructured":"Nehring, K., Puppe, C.: Consistent Judgement Aggregation: A Characterization. Technical Report, Univ. Karlsruhe (2005)"},{"key":"4_CR71","doi-asserted-by":"crossref","unstructured":"Nisan, N., Segal, I.: The Communication Requirements of Efficient Allocations and Supporting Prices. Journal of Economic Theory, to appear (2006)","DOI":"10.1016\/j.jet.2004.10.007"},{"key":"4_CR72","volume-title":"A Course in Game Theory","author":"M.J. Osborne","year":"1994","unstructured":"Osborne, M.J., Rubinstein, A.: A Course in Game Theory. MIT Press, Cambridge (1994)"},{"key":"4_CR73","first-page":"111","volume":"24","author":"R. Parikh","year":"1985","unstructured":"Parikh, R.: The Logic of Games and Its Applications. Annals of Discrete Mathematics\u00a024, 111\u2013140 (1985)","journal-title":"Annals of Discrete Mathematics"},{"issue":"3","key":"4_CR74","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1023\/A:1020391420768","volume":"132","author":"R. Parikh","year":"2002","unstructured":"Parikh, R.: Social Software. Synthese\u00a0132(3), 187\u2013211 (2002)","journal-title":"Synthese"},{"key":"4_CR75","doi-asserted-by":"crossref","unstructured":"Pattanaik, P.K.: On the Stability of Sincere Voting Situations. Journal of Economic Theory 6 (1973)","DOI":"10.1016\/0022-0531(73)90076-8"},{"key":"4_CR76","unstructured":"Pauly, M.: Logic for Social Software. PhD Thesis, ILLC, University of Amsterdam (2001)"},{"key":"4_CR77","unstructured":"Pauly, M., Wooldridge, M.: Logic for Mechanism Design: A Manifesto. In: Proc. 5th\u00a0Workshop on Game-Theoretic and Decision-Theoretic Agents (2003)"},{"key":"4_CR78","doi-asserted-by":"crossref","unstructured":"Pigozzi, G.: Belief Merging and the Discursive Dilemma: an Argument-Based Account to Paradoxes of Judgment Aggregation. Synthese, to appear (2007)","DOI":"10.1007\/s11229-006-9063-7"},{"key":"4_CR79","doi-asserted-by":"crossref","unstructured":"Pini, M., Rossi, F., Venable, K., Walsh, T.: Strategic Voting when Aggregating Partially Ordered Preferences. In: Proceedings of AAMAS-2006 (2006)","DOI":"10.1145\/1160633.1160755"},{"key":"4_CR80","unstructured":"Pini, M., Rossi, F., Venable, K., Walsh, T.: Winner Determination in Sequential Majority Voting with Incomplete Preferences. In: Proceedings of Multidisciplinary ECAI06 Workshop about Advances on Preference Handling (2006)"},{"key":"4_CR81","doi-asserted-by":"crossref","unstructured":"Pini, M.S., Rossi, F., Venable, K., Walsh, T.: Aggregating Partially Ordered Preferences: Possibility and Impossibility Results. In: Proceedings of TARK-2005 (2005)","DOI":"10.1145\/1160633.1160755"},{"key":"4_CR82","doi-asserted-by":"crossref","unstructured":"Procaccia, A., Rosenschein, J.S.: The Communication Complexity of Coalition Formation among Autonomous Agents. In: Proceedings of AAMAS-2006 (2006)","DOI":"10.1145\/1160633.1160727"},{"key":"4_CR83","unstructured":"Rossi, F., Venable, K., Walsh, T.: mCP Nets: Representing and Reasoning with Preferences of Multiple Agents. In: Proceedings of AAAI-2004, pp. 729\u2013734 (2004)"},{"issue":"4","key":"4_CR84","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/s00224-002-1093-z","volume":"36","author":"J. Rothe","year":"2003","unstructured":"Rothe, J., Spakowski, H., Vogel, J.: Exact Complexity of the Winner for Young Elections. Theory of Computing Systems\u00a036(4), 375\u2013386 (2003)","journal-title":"Theory of Computing Systems"},{"issue":"8","key":"4_CR85","doi-asserted-by":"publisher","first-page":"1131","DOI":"10.1287\/mnsc.44.8.1131","volume":"44","author":"M. Rothkopf","year":"1998","unstructured":"Rothkopf, M., Peke\u010d, A., Harstad, R.: Computationally Manageable Combinational Auctions. Management Science\u00a044(8), 1131\u20131147 (1998)","journal-title":"Management Science"},{"issue":"1","key":"4_CR86","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s00355-003-0295-x","volume":"24","author":"A. Rusinowska","year":"2005","unstructured":"Rusinowska, A., de Swart, H., van der Rijt, J.-W.: A New Model of Coalition Formation. Social Choice and Welfare\u00a024(1), 129\u2013154 (2005)","journal-title":"Social Choice and Welfare"},{"key":"4_CR87","unstructured":"Sandholm, T.: Contract Types for Satisficing Task Allocation: I Theoretical Results. In: Proc. AAAI Spring Symposium: Satisficing Models (1998)"},{"key":"4_CR88","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0022-0531(75)90050-2","volume":"10","author":"M. Satterthwaite","year":"1975","unstructured":"Satterthwaite, M.: Strategyproofness and Arrow\u2019s Conditions. Journal of Economic Theory\u00a010, 187\u2013217 (1975)","journal-title":"Journal of Economic Theory"},{"key":"4_CR89","volume-title":"Combinatorial Auctions","author":"I. Segal","year":"2006","unstructured":"Segal, I.: The Communication Requirements of Combinatorial Allocation Problems. In: Cramton, P., et al. (eds.) Combinatorial Auctions, MIT Press, Cambridge (2006)"},{"key":"4_CR90","doi-asserted-by":"crossref","unstructured":"Segal, I.: The Communication Requirements of Social Choice Rules and Supporting Budget Sets. Journal of Economic Theory, to appear (2006)","DOI":"10.1016\/j.jet.2006.09.011"},{"key":"4_CR91","volume-title":"Coalition Formation among Autonomous Agents","author":"O. Shehory","year":"1995","unstructured":"Shehory, O., Kraus, S.: Coalition Formation among Autonomous Agents. Springer, Heidelberg (1995)"},{"key":"4_CR92","doi-asserted-by":"crossref","unstructured":"Tennenholtz, M.: Transitive Voting. In: Proceedings of EC-2004 (2004)","DOI":"10.1145\/988772.988808"},{"issue":"3","key":"4_CR93","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/s003550200197","volume":"20","author":"G.J. Woeginger","year":"2003","unstructured":"Woeginger, G.J.: Banks Winners in Tournaments Are Difficult to Recognize. Social Choice and Welfare\u00a020(3), 523\u2013528 (2003)","journal-title":"Social Choice and Welfare"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2007: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69507-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,13]],"date-time":"2023-05-13T06:42:13Z","timestamp":1683960133000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69507-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540695066","9783540695073"],"references-count":93,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69507-3_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007]]}}}