{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T04:07:23Z","timestamp":1751861243541,"version":"3.40.3"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031231001"},{"type":"electronic","value":"9783031231018"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-23101-8_4","type":"book-chapter","created":{"date-parts":[[2022,12,19]],"date-time":"2022-12-19T20:18:53Z","timestamp":1671481133000},"page":"47-62","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["More Effort Towards Multiagent Knapsack"],"prefix":"10.1007","author":[{"given":"Sushmita","family":"Gupta","sequence":"first","affiliation":[]},{"given":"Pallavi","family":"Jain","sequence":"additional","affiliation":[]},{"given":"Sanjay","family":"Seetharaman","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.artint.2018.07.006","volume":"264","author":"E Anshelevich","year":"2018","unstructured":"Anshelevich, E., Bhardwaj, O., Elkind, E., Postl, J., Skowron, P.: Approximating optimal social choice under metric preferences. Artif. Intell. 264, 27\u201351 (2018)","journal-title":"Artif. Intell."},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Anshelevich, E., Bhardwaj, O., Postl, J.: Approximating optimal social choice under metric preferences. In: AAAI, pp. 777\u2013783 (2015)","DOI":"10.1609\/aaai.v29i1.9308"},{"issue":"1","key":"4_CR3","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1613\/jair.5340","volume":"58","author":"E Anshelevich","year":"2017","unstructured":"Anshelevich, E., Postl, J.: Randomized social choice functions under metric preferences. J. Artif. Intell. Res. 58(1), 797\u2013827 (2017)","journal-title":"J. Artif. Intell. Res."},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Anshelevich, E., Sekar, S.: Blind, greedy, and random: algorithms for matching and clustering using only ordinal information. In: AAAI, pp. 383\u2013389 (2016)","DOI":"10.1007\/978-3-662-54110-4_19"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Aziz, H., Lee, B.E.: Proportionally representative participatory budgeting with ordinal preferences. In: AAAI, pp. 5110\u20135118 (2021)","DOI":"10.1609\/aaai.v35i6.16646"},{"key":"4_CR6","unstructured":"Aziz, H., Lee, B.E., Talmon, N.: Proportionally representative participatory budgeting: axioms and algorithms. In: AAMAS, pp. 23\u201331 (2018)"},{"key":"4_CR7","series-title":"Computational Social Sciences","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-3-030-54936-7_10","volume-title":"Pathways Between Social Science and Computational Social Science","author":"H Aziz","year":"2021","unstructured":"Aziz, H., Shah, N.: Participatory budgeting: models and approaches. In: Rudas, T., P\u00e9li, G. (eds.) Pathways Between Social Science and Computational Social Science. CSS, pp. 215\u2013236. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-54936-7_10"},{"issue":"5","key":"4_CR8","doi-asserted-by":"publisher","first-page":"2813","DOI":"10.1287\/mnsc.2020.3666","volume":"67","author":"G Benad\u00e9","year":"2021","unstructured":"Benad\u00e9, G., Procaccia, A.D., Nath, S., Shah, N.: Preference elicitation for participatory budgeting. Manage. Sci. 67(5), 2813\u20132827 (2021)","journal-title":"Manage. Sci."},{"key":"4_CR9","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/j.artint.2015.06.003","volume":"227","author":"C Boutilier","year":"2015","unstructured":"Boutilier, C., Caragiannis, I., Haber, S., Lu, T., Procaccia, A.D., Sheffet, O.: Optimal social choice functions: a utilitarian view. Artif. Intell. 227, 190\u2013213 (2015)","journal-title":"Artif. Intell."},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Bredereck, R., Faliszewski, P., Kaczmarczyk, A., Knop, D., Niedermeier, R.: Parameterized algorithms for finding a collective set of items. In: AAAI, pp. 1838\u20131845 (2020)","DOI":"10.1609\/aaai.v34i02.5551"},{"issue":"9","key":"4_CR11","doi-asserted-by":"publisher","first-page":"1655","DOI":"10.1016\/j.artint.2011.03.005","volume":"175","author":"I Caragiannis","year":"2011","unstructured":"Caragiannis, I., Procaccia, A.D.: Voting almost maximizes social welfare despite limited communication. Artif. Intell. 175(9), 1655\u20131671 (2011)","journal-title":"Artif. Intell."},{"key":"4_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., et al.: Parameterized Algorithms. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3"},{"issue":"40\u201342","key":"4_CR13","doi-asserted-by":"publisher","first-page":"3701","DOI":"10.1016\/j.tcs.2010.06.018","volume":"411","author":"M Cygan","year":"2010","unstructured":"Cygan, M., Pilipczuk, M.: Exact and approximate bandwidth. Theoret. Comput. Sci. 411(40\u201342), 3701\u20133713 (2010)","journal-title":"Theoret. Comput. Sci."},{"key":"4_CR14","doi-asserted-by":"publisher","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity, vol. 4. TCS, Springer, London (2013). https:\/\/doi.org\/10.1007\/978-1-4471-5559-1","DOI":"10.1007\/978-1-4471-5559-1"},{"issue":"3","key":"4_CR15","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1007\/s00355-017-1026-z","volume":"48","author":"E Elkind","year":"2017","unstructured":"Elkind, E., Faliszewski, P., Skowron, P., Slinko, A.: Properties of multiwinner voting rules. Soc. Choice Welfare 48(3), 599\u2013632 (2017). https:\/\/doi.org\/10.1007\/s00355-017-1026-z","journal-title":"Soc. Choice Welfare"},{"key":"4_CR16","unstructured":"Endriss, U.: Trends in computational social choice. Lulu. com (2017)"},{"issue":"1","key":"4_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3296672","volume":"7","author":"P Faliszewski","year":"2019","unstructured":"Faliszewski, P., Skowron, P., Slinko, A., Talmon, N.: Committee scoring rules: axiomatic characterization and hierarchy. TEAC 7(1), 1\u201339 (2019)","journal-title":"TEAC"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Fluschnik, T., Skowron, P., Triphaus, M., Wilker, K.: Fair knapsack. In: AAAI, pp. 1941\u20131948 (2019)","DOI":"10.1609\/aaai.v33i01.33011941"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Ganuza, E., Baiocchi, G.: The power of ambiguity: how participatory budgeting travels the globe. J. Public Deliberation 8(2), 1\u201312 (2012)","DOI":"10.16997\/jdd.142"},{"issue":"2","key":"4_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3340230","volume":"7","author":"A Goel","year":"2019","unstructured":"Goel, A., Krishnaswamy, A.K., Sakshuwong, S., Aitamurto, T.: Knapsack voting for participatory budgeting. ACM Trans. Econ. Comput. 7(2), 1\u201327 (2019)","journal-title":"ACM Trans. Econ. Comput."},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Gupta, S., Jain, P., Panolan, F., Roy, S., Saurabh, S.: Gerrymandering on graphs: computational complexity and parameterized algorithms. In: SAGT, pp. 140\u2013155 (2021)","DOI":"10.1007\/978-3-030-85947-3_10"},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"Gupta, S., Jain, P., Saurabh, S.: Well-structured committees. In: IJCAI, pp. 189\u2013195 (2020)","DOI":"10.24963\/ijcai.2020\/27"},{"key":"4_CR23","doi-asserted-by":"crossref","unstructured":"Gupta, S., Jain, P., Saurabh, S., Talmon, N.: Even more effort towards improved bounds and fixed-parameter tractability for multiwinner rules. In: IJCAI, pp. 217\u2013223 (2021)","DOI":"10.24963\/ijcai.2021\/31"},{"key":"4_CR24","doi-asserted-by":"crossref","unstructured":"Hershkowitz, D.E., Kahng, A., Peters, D., Procaccia, A.D.: District-fair participatory budgeting. In: AAAI, pp. 5464\u20135471 (2021)","DOI":"10.1609\/aaai.v35i6.16688"},{"key":"4_CR25","doi-asserted-by":"crossref","unstructured":"Jain, P., Sornat, K., Talmon, N.: Participatory budgeting with project interactions. In: IJCAI, pp. 386\u2013392 (2020)","DOI":"10.24963\/ijcai.2020\/54"},{"key":"4_CR26","doi-asserted-by":"crossref","unstructured":"Jain, P., Sornat, K., Talmon, N., Zehavi, M.: Participatory budgeting with project groups. In: IJCAI, pp. 276\u2013282 (2021)","DOI":"10.24963\/ijcai.2021\/39"},{"key":"4_CR27","unstructured":"Jain, P., Talmon, N., Bulteau, L.: Partition aggregation for participatory budgeting. In: AAMAS, pp. 665\u2013673 (2021)"},{"key":"4_CR28","doi-asserted-by":"publisher","unstructured":"Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack problems. Springer (2010). https:\/\/doi.org\/10.1007\/978-3-540-24777-7","DOI":"10.1007\/978-3-540-24777-7"},{"key":"4_CR29","doi-asserted-by":"crossref","unstructured":"Moenck, R.T.: Practical fast polynomial multiplication. In: SYMSAC86, pp. 136\u2013148 (1976)","DOI":"10.1145\/800205.806332"},{"key":"4_CR30","doi-asserted-by":"crossref","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter algorithms. Oxford University Press (2006)","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001"},{"key":"4_CR31","unstructured":"Pierczy\u0144ski, G., Skowron, P., Peters, D.: Proportional participatory budgeting with additive utilities. In: Advances in Neural Information Processing Systems 34 (2021)"},{"key":"4_CR32","doi-asserted-by":"crossref","unstructured":"Procaccia, A.D., Rosenschein, J.S.: The distortion of cardinal preferences in voting. In: Proceedings of the 10th International Conference on Cooperative Information Agents, pp. 317\u2013331. CIA2006 (2006)","DOI":"10.1007\/11839354_23"},{"key":"4_CR33","doi-asserted-by":"crossref","unstructured":"Gilman, H.R.: Transformative deliberations: participatory budgeting in the United States. J. Public Deliberation 8(2), 1\u201320 (2012)","DOI":"10.16997\/jdd.139"},{"issue":"1","key":"4_CR34","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1111\/j.1468-2427.2008.00777.x","volume":"32","author":"Y Sintomer","year":"2008","unstructured":"Sintomer, Y., Herzberg, C., R\u00f6cke, A.: Participatory budgeting in Europe: potentials and challenges. Int. J. Urban Reg. Res. 32(1), 164\u2013178 (2008)","journal-title":"Int. J. Urban Reg. Res."},{"key":"4_CR35","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.artint.2016.09.003","volume":"241","author":"P Skowron","year":"2016","unstructured":"Skowron, P., Faliszewski, P., Lang, J.: Finding a collective set of items: from proportional multirepresentation to group recommendation. Artif. Intell. 241, 191\u2013216 (2016)","journal-title":"Artif. Intell."},{"issue":"1","key":"4_CR36","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/S0167-6377(03)00062-2","volume":"32","author":"M Sviridenko","year":"2004","unstructured":"Sviridenko, M.: A note on maximizing a submodular set function subject to a knapsack constraint. Oper. Res. Lett. 32(1), 41\u201343 (2004)","journal-title":"Oper. Res. Lett."},{"key":"4_CR37","doi-asserted-by":"crossref","unstructured":"Talmon, N., Faliszewski, P.: A framework for approval-based budgeting methods. In: AAAI, pp. 2181\u20132188 (2019)","DOI":"10.1609\/aaai.v33i01.33012181"},{"key":"4_CR38","unstructured":"Wampler, B.: Participatory budgeting in brazil: contestation, cooperation, and accountability. Penn State Press (2010)"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2023: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-23101-8_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,7]],"date-time":"2023-01-07T00:05:11Z","timestamp":1673049911000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-23101-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031231001","9783031231018"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-23101-8_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"1 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nov\u00fd Smokovec","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Slovakia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 January 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 January 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"48","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ics.science.upjs.sk\/sofsem2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"43","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"60% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3+","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6-7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}