{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T16:41:02Z","timestamp":1775752862415,"version":"3.50.1"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319675039","type":"print"},{"value":"9783319675046","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-67504-6_13","type":"book-chapter","created":{"date-parts":[[2017,9,23]],"date-time":"2017-09-23T02:03:20Z","timestamp":1506132200000},"page":"182-196","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Complexity of Group Identification with Partial Information"],"prefix":"10.1007","author":[{"given":"G\u00e1bor","family":"Erd\u00e9lyi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Reger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongjie","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,9,24]]},"reference":[{"key":"13_CR1","unstructured":"Aziz, H., Gaspers, S., Gudmundsson, J., Mackenzie, S., Mattei, N., Walsh, T.: Computational aspects of multi-winner approval voting. In: AAMAS, pp. 107\u2013115 (2015)"},{"key":"13_CR2","volume-title":"Digraphs - Theory, Algorithms and Applications","author":"J Bang-Jensen","year":"2008","unstructured":"Bang-Jensen, J., Gutin, G.: Digraphs - Theory, Algorithms and Applications. Springer, London (2008)"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Briskorn, D., Erd\u00e9lyi, G., Reger, C.: Bribery in $$k$$-Approval and $$k$$-Veto under partial information: (extended abstract). In: AAMAS, pp. 1299\u20131300 (2016)","DOI":"10.1007\/978-3-319-44748-3_29"},{"key":"13_CR4","unstructured":"Dey, P., Misra, N., Narahari, Y.: Complexity of manipulation with partial information in voting. In: IJCAI, pp. 229\u2013235 (2016)"},{"key":"13_CR5","series-title":"Studies in Fuzziness and Soft Computing","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-642-20533-0_7","volume-title":"Consensual Processes","author":"D Dimitrov","year":"2011","unstructured":"Dimitrov, D.: The Social Choice Approach to Group Identification. In: Herrera-Viedma, E., Garc\u00eda-Lapresta, J.L., Kacprzyk, J., Fedrizzi, M., Nurmi, H., Zadro\u017cny, S. (eds.) Consensual Processes. Studies in Fuzziness and Soft Computing, vol. 267, pp. 123\u2013134. Springer, Heidelberg (2011)"},{"issue":"2","key":"13_CR6","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.mathsocsci.2007.06.001","volume":"54","author":"D Dimitrov","year":"2007","unstructured":"Dimitrov, D., Sung, S.C., Xu, Y.: Procedural group identification. Math. Soc. Sci. 54(2), 137\u2013146 (2007)","journal-title":"Math. Soc. Sci."},{"key":"13_CR7","unstructured":"Erd\u00e9lyi, G., Reger, C., Yang, Y.: The complexity of bribery and control in group identification. In: AAMAS, pp. 1142\u20131150 (2017)"},{"issue":"3","key":"13_CR8","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Stockmeyer, L.: Some simplified NP-complete graph problems. Theor. Comput. Sci. 1(3), 237\u2013267 (1976)","journal-title":"Theor. Comput. Sci."},{"key":"13_CR9","doi-asserted-by":"publisher","DOI":"10.1515\/9781400875184","volume-title":"Flows in Networks","author":"LR Ford","year":"1962","unstructured":"Ford, L.R., Fulkerson, D.R.: Flows in Networks. Princeton Unviersity Press, Princeton (1962)"},{"key":"13_CR10","first-page":"385","volume":"160","author":"A Kasher","year":"1997","unstructured":"Kasher, A., Rubinstein, A.: On the question \u201cWho is a J?\u201d: a social choice approach. Log. Anal. 160, 385\u2013395 (1997)","journal-title":"Log. Anal."},{"key":"13_CR11","unstructured":"Konczak, K., Lang, J.: Voting procedures with incomplete preferences. In: MPREF, pp. 124\u2013129 (2005)"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Meir, R., Procaccia, A.D., Rosenschein, J.S.: A broader picture of the complexity of strategic behavior in multi-winner elections. In: AAMAS, pp. 991\u2013998 (2008)","DOI":"10.1613\/jair.2566"},{"key":"13_CR13","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1613\/jair.2566","volume":"33","author":"R Meir","year":"2008","unstructured":"Meir, R., Procaccia, A.D., Rosenschein, J.S., Zohar, A.: Complexity of strategic behavior in multi-winner elections. J. Artif. Intell. Res. (JAIR) 33, 149\u2013178 (2008)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"issue":"1","key":"13_CR14","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/j.geb.2007.08.006","volume":"63","author":"AD Miller","year":"2008","unstructured":"Miller, A.D.: Group identification. Games. Econ. Behav. 63(1), 188\u2013202 (2008)","journal-title":"Games. Econ. Behav."},{"issue":"1","key":"13_CR15","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.mathsocsci.2007.04.005","volume":"54","author":"H Nicolas","year":"2007","unstructured":"Nicolas, H.: \u201cI want to be a J!\u201d: liberalism in group identification problems. Math. Soc. Sci. 54(1), 59\u201370 (2007)","journal-title":"Math. Soc. Sci."},{"key":"13_CR16","unstructured":"Obraztsova, S., Zick, Y., Elkind, E.: On manipulation in multi-winner elections based on scoring rules. In: AAMAS, pp. 359\u2013366 (2013)"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Orlin, J.B.: Max flows in $${O}(nm)$$ time, or better. In: STOC, pp. 765\u2013774 (2013)","DOI":"10.1145\/2488608.2488705"},{"key":"13_CR18","unstructured":"Procaccia, A.D., Rosenschein, J.S., Zohar, A.: Multi-winner elections: complexity of manipulation, control and winner-determination. In: IJCAI, pp. 1476\u20131481 (2007)"},{"issue":"2","key":"13_CR19","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/S0022-0531(03)00080-2","volume":"110","author":"D Samet","year":"2003","unstructured":"Samet, D., Schmeidler, D.: Between liberalism and democracy. J. Econ. Theor. 110(2), 213\u2013233 (2003)","journal-title":"J. Econ. Theor."},{"key":"13_CR20","doi-asserted-by":"crossref","unstructured":"Xia, L., Conitzer, V.: Stackelberg voting games: computational aspects and paradoxes. In: AAAI, pp. 921\u2013926 (2010)","DOI":"10.1609\/aaai.v24i1.7626"},{"key":"13_CR21","unstructured":"Yang, Y., Dimitrov, D.: How hard is it to control a group? In: COMSOC 2016. https:\/\/arxiv.org\/abs\/1606.03366"},{"issue":"3","key":"13_CR22","doi-asserted-by":"publisher","first-page":"882","DOI":"10.1007\/s10878-016-0012-1","volume":"33","author":"Y Yang","year":"2017","unstructured":"Yang, Y., Guo, J.: Possible winner problems on partial tournaments: a parameterized study. J. Comb. Optim. 33(3), 882\u2013896 (2017)","journal-title":"J. Comb. Optim."}],"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-319-67504-6_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,26]],"date-time":"2023-08-26T08:22:35Z","timestamp":1693038155000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-67504-6_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319675039","9783319675046"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-67504-6_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"24 September 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithmic Decision Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Luxembourg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Luxembourg","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 October 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 October 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aldt2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/sma.uni.lu\/adt2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}