{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T10:35:08Z","timestamp":1774434908372,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642415746","type":"print"},{"value":"9783642415753","type":"electronic"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-41575-3_5","type":"book-chapter","created":{"date-parts":[[2013,10,28]],"date-time":"2013-10-28T01:37:47Z","timestamp":1382924267000},"page":"57-70","source":"Crossref","is-referenced-by-count":5,"title":["Possible Winners in Approval Voting"],"prefix":"10.1007","author":[{"given":"Nathana\u00ebl","family":"Barrot","sequence":"first","affiliation":[]},{"given":"Laurent","family":"Gourv\u00e8s","sequence":"additional","affiliation":[]},{"given":"J\u00e9r\u00f4me","family":"Lang","sequence":"additional","affiliation":[]},{"given":"J\u00e9r\u00f4me","family":"Monnot","sequence":"additional","affiliation":[]},{"given":"Bernard","family":"Ries","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Bachrach, Y., Betzler, N., Faliszewski, P.: Probabilistic possible-winner determination. In: Proc. of AAAI 2010 (2010)","DOI":"10.1609\/aaai.v24i1.7609"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Baumeister, D., Erd\u00e8lyi, G., Hemaspaandra, E., Hemaspaandra, L., Rothe, J.: Computational aspects of approval voting. In: Laslier, J.-F., Sanver, R. (eds.) Handbook of Approval Voting, pp. 199\u2013251. Springer (2010)","DOI":"10.1007\/978-3-642-02839-7_10"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Baumeister, D., Rothe, J.: Taking the final step to a full dichotomy of the possible winner problem in pure scoring rules. In: Proceedings of ECAI 2010 (2010)","DOI":"10.3233\/978-1-60750-606-5-1019"},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-642-03816-7_12","volume-title":"Mathematical Foundations of Computer Science 2009","author":"N. Betzler","year":"2009","unstructured":"Betzler, N., Dorn, B.: Towards a dichotomy of finding possible winners in elections based on scoring rules. In: Kr\u00e1lovi\u010d, R., Niwi\u0144ski, D. (eds.) MFCS 2009. LNCS, vol.\u00a05734, pp. 124\u2013136. Springer, Heidelberg (2009)"},{"key":"5_CR5","unstructured":"Betzler, N., Hemmann, S., Niedermeier, R.: A multivariate complexity analysis of determining possible winners given incomplete votes. In: Proceedings of IJCAI 2009, pp. 53\u201358 (2009)"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Betzler, N., Slinko, A., Uhlmann, J.: On the computation of fully proportional representation. Journal of Artificial Intelligence Research (2013)","DOI":"10.1613\/jair.3896"},{"issue":"3","key":"5_CR7","doi-asserted-by":"publisher","first-page":"831","DOI":"10.2307\/1955105","volume":"72","author":"S. Brams","year":"1978","unstructured":"Brams, S., Fishburn, P.: Approval voting. American Political Review\u00a072(3), 831\u2013847 (1978)","journal-title":"American Political Review"},{"key":"5_CR8","unstructured":"Brams, S., Fishburn, P.: Approval Voting, 2nd edn. Birkh\u00e4user (1987)"},{"issue":"2","key":"5_CR9","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/j.electstud.2005.05.007","volume":"25","author":"S. Brams","year":"2006","unstructured":"Brams, S., Sanver, R.: Critical strategies under approval voting: Who gets ruled in and ruled out. Electoral Studies\u00a025(2), 287\u2013305 (2006)","journal-title":"Electoral Studies"},{"issue":"1","key":"5_CR10","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.mathsocsci.2011.12.003","volume":"64","author":"Y. Chevaleyre","year":"2012","unstructured":"Chevaleyre, Y., Lang, J., Maudet, N., Monnot, J., Xia, L.: New candidates welcome! possible winners with respect to the addition of new candidates. Mathematical Social Sciences\u00a064(1), 74\u201388 (2012)","journal-title":"Mathematical Social Sciences"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Darmann, A.: Popular committees. Mathematical Social Sciences (to appear, 2013)","DOI":"10.2139\/ssrn.2035363"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Delort, C., Spanjaard, O., Weng, P.: Committee selection with a weight constraint based on a pairwise dominance relation. In: ADT, pp. 28\u201341 (2011)","DOI":"10.1007\/978-3-642-24873-3_3"},{"key":"5_CR13","unstructured":"Elkind, E., Lang, J., Saffidine, A.: Choosing collectively optimal sets of alternatives based on the condorcet criterion. In: IJCAI 2011, pp. 186\u2013191 (2011)"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Endriss, U.: Sincerity and manipulation under approval voting. Theory and Decision (2011)","DOI":"10.1007\/s11238-012-9301-z"},{"key":"5_CR15","unstructured":"Endriss, U., Pini, M.S., Rossi, F., Venable, K.B.: Preference aggregation over restricted ballot languages: Sincerity and strategy-proofness. In: Boutilier, C. (ed.) IJCAI 2009, pp. 122\u2013127 (2009)"},{"key":"5_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-540-85238-4_25","volume-title":"Mathematical Foundations of Computer Science 2008","author":"G. Erd\u00e9lyi","year":"2008","unstructured":"Erd\u00e9lyi, G., Nowak, M., Rothe, J.: Sincere-strategy preference-based approval voting broadly resists control. In: Ochma\u0144ski, E., Tyszkiewicz, J. (eds.) MFCS 2008. LNCS, vol.\u00a05162, pp. 311\u2013322. Springer, Heidelberg (2008)"},{"key":"5_CR17","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)"},{"issue":"1","key":"5_CR18","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s10458-010-9133-6","volume":"22","author":"M. Kalech","year":"2011","unstructured":"Kalech, M., Kraus, S., Kaminka, G.A., Goldman, C.V.: Practical voting rules with partial information. Autonomous Agents and Multiagent Systems\u00a022(1), 151\u2013182 (2011)","journal-title":"Autonomous Agents and Multiagent Systems"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Kilgour, M.: Approval balloting for multi-winner elections. In: Laslier, J.-F., Sanver, R. (eds.) Handbook of Approval Voting, pp. 105\u2013124. Springer (2010)","DOI":"10.1007\/978-3-642-02839-7_6"},{"key":"5_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-642-04428-1_5","volume-title":"Algorithmic Decision Theory","author":"C. Klamler","year":"2009","unstructured":"Klamler, C., Pferschy, U., Ruzika, S.: Committee selection with a weight constraint based on lexicographic rankings of individuals. In: Rossi, F., Tsoukias, A. (eds.) ADT 2009. LNCS, vol.\u00a05783, pp. 50\u201361. Springer, Heidelberg (2009)"},{"key":"5_CR21","unstructured":"Konczak, K., Lang, J.: Voting procedures with incomplete preferences. In: IJCAI 2005 Multidisciplinary Workshop on Advances in Preference Handling (2005)"},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"Lang, J., Pini, M.S., Rossi, F., Salvagnin, D., Venable, K.B., Walsh, T.: Winner determination in voting trees with incomplete preferences and weighted votes. In: Autonomous Agents and Multi-Agent Systems (2011)","DOI":"10.1007\/s10458-011-9171-8"},{"key":"5_CR23","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1177\/0951629808097286","volume":"21","author":"J.-F. Laslier","year":"2009","unstructured":"Laslier, J.-F.: The leader rule \u2013 a model of strategic approval voting in a large electorate. Journal of Theoretical Politics\u00a021, 113\u2013136 (2009)","journal-title":"Journal of Theoretical Politics"},{"key":"5_CR24","doi-asserted-by":"crossref","unstructured":"Laslier, J.-F., Sanver, R.: The basic approval voting game. In: Laslier, J.-F., Sanver, R. (eds.) Handbook of Approval Voting. Springer (2010)","DOI":"10.1007\/978-3-642-02839-7"},{"key":"5_CR25","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1613\/jair.2566","volume":"33","author":"R. Meir","year":"2008","unstructured":"Meir, R., Procaccia, A., Rosenschein, J., Zohar, A.: The complexity of strategic behavior in multi-winner elections. JAIR\u00a033, 149\u2013178 (2008)","journal-title":"JAIR"},{"key":"5_CR26","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1177\/0951629809348268","volume":"22","author":"M. Nu\u00f1ez","year":"2010","unstructured":"Nu\u00f1ez, M.: Condorcet consistency of approval voting: a counter example in large Poisson games. Journal of Theoretical Politics\u00a022, 64\u201384 (2010)","journal-title":"Journal of Theoretical Politics"},{"issue":"3","key":"5_CR27","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/s00355-007-0235-2","volume":"30","author":"A. Procaccia","year":"2008","unstructured":"Procaccia, A., Rosenschein, J., Zohar, A.: On the complexity of achieving proportional representation. Social Choice and Welfare\u00a030(3), 353\u2013362 (2008)","journal-title":"Social Choice and Welfare"},{"issue":"2","key":"5_CR28","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s00355-009-0394-4","volume":"34","author":"D. Saari","year":"2010","unstructured":"Saari, D.: Systematic analysis of multiple voting rules. Social Choice and Welfare\u00a034(2), 217\u2013247 (2010)","journal-title":"Social Choice and Welfare"},{"issue":"4","key":"5_CR29","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1007\/s003550050164","volume":"16","author":"M. Sertel","year":"1999","unstructured":"Sertel, M., Y\u0131lmaz, B.: The majoritarian compromise is majoritarian-optimal and subgame-perfect implementable. Social Choice and Welfare\u00a016(4), 615\u2013627 (1999)","journal-title":"Social Choice and Welfare"},{"issue":"1","key":"5_CR30","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s00182-006-0053-2","volume":"35","author":"F. De Sinopoli","year":"2006","unstructured":"De Sinopoli, F., Dutta, B., Laslier, J.-F.: Approval voting: three examples. International Journal of Game Theory\u00a035(1), 27\u201338 (2006)","journal-title":"International Journal of Game Theory"},{"key":"5_CR31","unstructured":"Skowron, P., Faliszewski, P., Slinko, A.: Achieving fully proportional representation is easy in practice. In: AAMAS 2013, pp. 399\u2013406 (2013)"},{"key":"5_CR32","unstructured":"Xia, L., Conitzer, V.: Determining possible and necessary winners under common voting rules given partial orders. In: Proceedings of AAAI 2008, pp. 196\u2013201 (2008)"},{"key":"5_CR33","unstructured":"Xia, L., Lang, J., Monnot, J.: Possible winners when new alternatives join: new results coming up! In: Sonenberg, L., Stone, P., Tumer, K., Yolum, P. (eds.) AAMAS. IFAAMAS, pp. 829\u2013836 (2011)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Decision Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-41575-3_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T18:28:50Z","timestamp":1746037730000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-41575-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642415746","9783642415753"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-41575-3_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}