{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:49:08Z","timestamp":1740098948577,"version":"3.37.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319716817"},{"type":"electronic","value":"9783319716824"}],"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-71682-4_7","type":"book-chapter","created":{"date-parts":[[2017,11,24]],"date-time":"2017-11-24T16:24:12Z","timestamp":1511540652000},"page":"103-115","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Working Together: Committee Selection and the Supermodular Degree"],"prefix":"10.1007","author":[{"given":"Rani","family":"Izsak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,11,25]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Abraham, I., Babaioff, M., Dughmi, S., Roughgarden, T.: Combinatorial auctions with restricted complements. In: EC, pp. 3\u201316, New York, NY, USA. ACM (2012)","DOI":"10.1145\/2229012.2229016"},{"key":"7_CR2","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1613\/jair.3896","volume":"47","author":"N Betzler","year":"2013","unstructured":"Betzler, N., Slinko, A., Uhlmann, J.: On the computation of fully proportional representation. Artif. Intell. Res. 47, 475\u2013519 (2013)","journal-title":"Artif. Intell. Res."},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Bhaskara, A., Charikar, M., Chlamtac, E., Feige, U., Vijayaraghavan, A.: Detecting high log-densities: an $$O(n{}^{{1\/4}}$$ ) approximation for densest k-subgraph. In: Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5\u20138 June 2010, pp. 201\u2013210 (2010)","DOI":"10.1145\/1806689.1806719"},{"key":"7_CR4","unstructured":"Borda, J.: Memmoire sur les elections au scrutine. Histoire de l\u2019Academie Royale des Sciences (1781)"},{"key":"7_CR5","doi-asserted-by":"crossref","first-page":"718","DOI":"10.2307\/1957270","volume":"77","author":"B Chamberlin","year":"1983","unstructured":"Chamberlin, B., Courant, P.: Representative deliberations and representative decisions: Proportional representation and the borda rule. Am. Polit. Sci. Rev. 77, 718\u2013733 (1983)","journal-title":"Am. Polit. Sci. Rev."},{"key":"7_CR6","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s10479-008-0335-0","volume":"163","author":"Y Chevaleyre","year":"2008","unstructured":"Chevaleyre, Y., Endriss, U., Estivie, S., Maudet, N.: Multiagent resource allocation in $$k$$ -additive domains: preference representation and complexity. Ann. Oper. Res. 163, 49\u201362 (2008)","journal-title":"Ann. Oper. Res."},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Conitzer, V., Sandholm, T., Lang, J.: When are elections with few candidates hard to manipulate? J. ACM 54(3) (2007)","DOI":"10.1145\/1236457.1236461"},{"key":"7_CR8","unstructured":"Conitzer, V., Sandholm, T., Santi, P.: Combinatorial auctions with $$k$$ -wise dependent valuations. In: AAAI, pp. 248\u2013254 (2005)"},{"key":"7_CR9","unstructured":"Elkind, E., Faliszewski, P., Skowron, P., Slinko, A.: Properties of multiwinner voting rules. In: AAMAS, pp. 53\u201360 (2014)"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Feige, U., Izsak, R.: Welfare maximization and the supermodular degree. In: ITCS, pp. 247\u2013256 (2013)","DOI":"10.1145\/2422436.2422466"},{"key":"7_CR11","unstructured":"Feldman, M., Izsak, R.: Constrained monotone function maximization and the supermodular degree. In: APPROX-RANDOM, pp. 160\u2013175 (2014)"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Feldman, M., Izsak, R.: Building a good team: secretary problems and the supermodular degree. In: SODA (2017)","DOI":"10.1137\/1.9781611974782.109"},{"key":"7_CR13","unstructured":"Fishburn, P., Pekec, A.: Approval voting for committees: Threshold approaches (2017). Working paper"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Fisher, M.L., Nemhauser, G.L., Wolsey, L.A.: An analysis of approximations for maximizing submodular set functions - II. In: Polyhedral Combinatorics, volume 8 of Mathematical Programming Study, pp. 73\u201387. North-Holland Publishing Company (1978)","DOI":"10.1007\/BFb0121195"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Goldsmith, J., Lang, J., Mattei, N., Perny, P.: Voting with rank dependent scoring rules. In: AAAI, pp. 698\u2013704 (2014)","DOI":"10.1609\/aaai.v28i1.8826"},{"issue":"1","key":"7_CR16","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1023\/B:USER.0000010138.79319.fd","volume":"14","author":"J Masthoff","year":"2004","unstructured":"Masthoff, J.: Group modeling: Selecting a sequence of television items to suit a group of viewers. User Model. User-Adapt. Interact. 14(1), 37\u201385 (2004)","journal-title":"User Model. User-Adapt. Interact."},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Masthoff, J.: Group recommender systems: combining individual models. In: Recommender Systems Handbook, pp. 677\u2013702 (2011)","DOI":"10.1007\/978-0-387-85820-3_21"},{"key":"7_CR18","unstructured":"Oren, J., Lucier, B.: Online (budgeted) social choice. In: Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 27\u201331 July 2014, Qu\u00e9bec City, Qu\u00e9bec, Canada, pp. 1456\u20131462 (2014)"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"Raghavendra, P., Steurer, D.: Graph expansion and the unique games conjecture. In: STOC, pp. 755\u2013764 (2010)","DOI":"10.1145\/1806689.1806792"},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"Raghavendra, P., Steurer, D., Tulsiani, M.: Reductions between expansion problems. In: IEEE Conference on Computational Complexity, pp. 64\u201373 (2012)","DOI":"10.1109\/CCC.2012.43"},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"Skowron, P., Faliszewski, P., Lang, J.: Finding a collective set of items: from proportional multirepresentation to group recommendation. In: AAAI, pp. 2131\u20132137 (2015)","DOI":"10.1609\/aaai.v29i1.9431"},{"key":"7_CR22","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1126\/science.1193147","volume":"330","author":"AW Woolley","year":"2010","unstructured":"Woolley, A.W., Chabris, C.F., Pentland, A., Hashmi, N., Malone, T.W.: Evidence for a collective intelligence factor in the performance of human groups. Science 330, 265\u2013294 (2010)","journal-title":"Science"}],"container-title":["Lecture Notes in Computer Science","Autonomous Agents and Multiagent Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-71682-4_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,8]],"date-time":"2022-08-08T15:08:47Z","timestamp":1659971327000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-71682-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319716817","9783319716824"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-71682-4_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}