{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,6]],"date-time":"2025-10-06T00:07:18Z","timestamp":1759709238802,"version":"build-2065373602"},"reference-count":23,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2023,6,15]],"date-time":"2023-06-15T00:00:00Z","timestamp":1686787200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100010663","name":"European Research Council","doi-asserted-by":"publisher","award":["101002854"],"award-info":[{"award-number":["101002854"]}],"id":[{"id":"10.13039\/100010663","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100009023","name":"Precursory Research for Embryonic Science and Technology","doi-asserted-by":"publisher","award":["JPMJPR20C1"],"award-info":[{"award-number":["JPMJPR20C1"]}],"id":[{"id":"10.13039\/501100009023","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001352","name":"National University of Singapore","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001352","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001459","name":"Ministry of Education - Singapore","doi-asserted-by":"publisher","award":["MOE-T2EP20221-0001"],"award-info":[{"award-number":["MOE-T2EP20221-0001"]}],"id":[{"id":"10.13039\/501100001459","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["BR 4744\/2-1"],"award-info":[{"award-number":["BR 4744\/2-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002241","name":"Japan Science and Technology Agency","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002241","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007601","name":"Horizon 2020","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100007601","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2023,8]]},"DOI":"10.1016\/j.tcs.2023.114039","type":"journal-article","created":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T11:58:06Z","timestamp":1687262286000},"page":"114039","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Justifying groups in multiwinner approval voting"],"prefix":"10.1016","volume":"969","author":[{"given":"Edith","family":"Elkind","sequence":"first","affiliation":[]},{"given":"Piotr","family":"Faliszewski","sequence":"additional","affiliation":[]},{"given":"Ayumi","family":"Igarashi","sequence":"additional","affiliation":[]},{"given":"Pasin","family":"Manurangsi","sequence":"additional","affiliation":[]},{"given":"Ulrike","family":"Schmidt-Kraepelin","sequence":"additional","affiliation":[]},{"given":"Warut","family":"Suksompong","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.tcs.2023.114039_br0010","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1145\/273865.273901","article-title":"Probabilistic checking of proofs; a new characterization of NP","volume":"45","author":"Arora","year":"1998","journal-title":"J. ACM"},{"issue":"3","key":"10.1016\/j.tcs.2023.114039_br0020","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1145\/278298.278306","article-title":"Proof verification and hardness of approximation problems","volume":"45","author":"Arora","year":"1998","journal-title":"J. ACM"},{"issue":"2","key":"10.1016\/j.tcs.2023.114039_br0030","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1007\/s00355-016-1019-3","article-title":"Justified representation in approval-based committee voting","volume":"48","author":"Aziz","year":"2017","journal-title":"Soc. Choice Welf."},{"year":"2007","series-title":"Approval Voting","author":"Brams","key":"10.1016\/j.tcs.2023.114039_br0040"},{"key":"10.1016\/j.tcs.2023.114039_br0050","series-title":"Proceedings of the 32nd AAAI Conference on Artificial Intelligence (AAAI)","first-page":"933","article-title":"Multiwinner elections with diversity constraints","author":"Bredereck","year":"2018"},{"key":"10.1016\/j.tcs.2023.114039_br0060","series-title":"Proceedings of the 28th International Joint Conference on Artificial Intelligence (IJCAI)","first-page":"109","article-title":"An experimental view on committees providing justified representation","author":"Bredereck","year":"2019"},{"key":"10.1016\/j.tcs.2023.114039_br0070","series-title":"Proceedings of the 46th ACM Symposium on Theory of Computing (STOC)","first-page":"624","article-title":"Analytical approach to parallel repetition","author":"Dinur","year":"2014"},{"key":"10.1016\/j.tcs.2023.114039_br0080","series-title":"Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI)","first-page":"2019","article-title":"Structure in dichotomous preferences","author":"Elkind","year":"2015"},{"key":"10.1016\/j.tcs.2023.114039_br0090","series-title":"Proceedings of the 31st AAAI Conference on Artificial Intelligence (AAAI)","first-page":"494","article-title":"What do multiwinner voting rules do? An experiment over the two-dimensional Euclidean domain","author":"Elkind","year":"2017"},{"key":"10.1016\/j.tcs.2023.114039_br0100","series-title":"Proceedings of the 15th International Symposium on Algorithmic Game Theory (SAGT)","first-page":"472","article-title":"Justifying groups in multiwinner approval voting","author":"Elkind","year":"2022"},{"key":"10.1016\/j.tcs.2023.114039_br0110","series-title":"Proceedings of the 36th AAAI Conference on Artificial Intelligence (AAAI)","first-page":"4983","article-title":"The price of justified representation","author":"Elkind","year":"2022"},{"key":"10.1016\/j.tcs.2023.114039_br0120","series-title":"Trends in Computational Social Choice","first-page":"27","article-title":"Multiwinner voting: a new challenge for social choice theory","author":"Faliszewski","year":"2017"},{"year":"1979","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","key":"10.1016\/j.tcs.2023.114039_br0130"},{"key":"10.1016\/j.tcs.2023.114039_br0140","series-title":"Proceedings of the 35th AAAI Conference on Artificial Intelligence (AAAI)","first-page":"5448","article-title":"An analysis of approval-based committee rules for 2D-Euclidean elections","author":"Godziszewski","year":"2021"},{"key":"10.1016\/j.tcs.2023.114039_br0150","series-title":"Proceedings of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","first-page":"1731","article-title":"Losing treewidth by separating subsets","author":"Gupta","year":"2019"},{"key":"10.1016\/j.tcs.2023.114039_br0160","series-title":"Handbook on Approval Voting","first-page":"105","article-title":"Approval balloting for multi-winner elections","author":"Marc Kilgour","year":"2010"},{"key":"10.1016\/j.tcs.2023.114039_br0170","series-title":"Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI)","first-page":"280","article-title":"Budgeted social choice: from consensus to personalized decision making","author":"Lu","year":"2011"},{"key":"10.1016\/j.tcs.2023.114039_br0180","doi-asserted-by":"crossref","first-page":"221","DOI":"10.4086\/toc.2015.v011a007","article-title":"The projection games conjecture and the NP-hardness of ln n-approximating set-cover","volume":"11","author":"Moshkovitz","year":"2015","journal-title":"Theory Comput."},{"issue":"1","key":"10.1016\/j.tcs.2023.114039_br0190","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF01588971","article-title":"An analysis of approximations for maximizing submodular set functions\u2014i","volume":"14","author":"Nemhauser","year":"1978","journal-title":"Math. Program."},{"key":"10.1016\/j.tcs.2023.114039_br0200","series-title":"Proceedings of the 35th Conference on Neural Information Processing Systems (NeurIPS)","first-page":"12726","article-title":"Proportional participatory budgeting with additive utilities","author":"Peters","year":"2021"},{"key":"10.1016\/j.tcs.2023.114039_br0210","series-title":"Proceedings of the 31st International Joint Conference on Artificial Intelligence (IJCAI)","first-page":"496","article-title":"How to sample approval elections?","author":"Szufa","year":"2022"},{"year":"2003","series-title":"Approximation Algorithms","author":"Vazirani","key":"10.1016\/j.tcs.2023.114039_br0220"},{"key":"10.1016\/j.tcs.2023.114039_br0230","series-title":"Proceedings of the 28th International Joint Conference on Artificial Intelligence (IJCAI)","first-page":"644","article-title":"On the tree representations of dichotomous preferences","author":"Yang","year":"2019"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397523003523?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397523003523?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T01:13:06Z","timestamp":1759626786000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397523003523"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8]]},"references-count":23,"alternative-id":["S0304397523003523"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2023.114039","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2023,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Justifying groups in multiwinner approval voting","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2023.114039","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2023 The Author(s). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}],"article-number":"114039"}}