{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,26]],"date-time":"2025-06-26T04:10:45Z","timestamp":1750911045218,"version":"3.41.0"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319675039"},{"type":"electronic","value":"9783319675046"}],"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_20","type":"book-chapter","created":{"date-parts":[[2017,9,23]],"date-time":"2017-09-23T02:03:20Z","timestamp":1506132200000},"page":"284-299","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Obtaining a Proportional Allocation by Deleting Items"],"prefix":"10.1007","author":[{"given":"Britta","family":"Dorn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ronald","family":"de Haan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ildik\u00f3","family":"Schlotter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,9,24]]},"reference":[{"key":"20_CR1","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.artint.2015.06.002","volume":"227","author":"H Aziz","year":"2015","unstructured":"Aziz, H., Gaspers, S., Mackenzie, S., Walsh, T.: Fair assignment of indivisible objects under ordinal preferences. Artif. Intell. 227, 71\u201392 (2015)","journal-title":"Artif. Intell."},{"key":"20_CR2","unstructured":"Aziz, H., Schlotter, I., Walsh, T.: Control of fair division. In: IJCAI 2016, Proceedings of the 25th International Joint Conference on Artificial Intelligence, pp. 67\u201373 (2016)"},{"issue":"8\u20139","key":"20_CR3","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0895-7177(92)90085-Y","volume":"16","author":"JJ Bartholdi","year":"1992","unstructured":"Bartholdi, J.J., Tovey, C.A., Trick, M.A.: How hard is it to control an election? Math. Comput. Model. 16(8\u20139), 27\u201340 (1992)","journal-title":"Math. Comput. Model."},{"issue":"2","key":"20_CR4","first-page":"130","volume":"61","author":"SJ Brams","year":"2014","unstructured":"Brams, S.J., Kilgour, D.M., Klamler, C.: Two-person fair division of indivisible items: An efficient, envy-free algorithm. Not. AMS 61(2), 130\u2013141 (2014)","journal-title":"Not. AMS"},{"issue":"8","key":"20_CR5","doi-asserted-by":"publisher","first-page":"1346","DOI":"10.1016\/j.jcss.2006.04.007","volume":"72","author":"J Chen","year":"2006","unstructured":"Chen, J., Huang, X., Kanj, I.A., Xia, G.: Strong computational lower bounds via parameterized complexity. J. Comput. Syst. Sci. 72(8), 1346\u20131367 (2006)","journal-title":"J. Comput. Syst. Sci."},{"key":"20_CR6","series-title":"Texts in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5559-1","volume-title":"Fundamentals of Parameterized Complexity","author":"RG Downey","year":"2013","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. Texts in Computer Science. Springer, London (2013)"},{"key":"20_CR7","series-title":"Texts in Theoretical Computer Science. An EATCS Series","volume-title":"Parameterized Complexity Theory","author":"J Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series, vol. XIV. Springer, Berlin (2006)"},{"issue":"4","key":"20_CR8","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1006\/jcss.2001.1774","volume":"63","author":"R Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity? J. Comput. Syst. Sci. 63(4), 512\u2013530 (2001)","journal-title":"J. Comput. Syst. Sci."},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Lipton, R.J., Markakis, E., Mossel, E., Saberi, A.: On approximately fair allocations of indivisible goods. In: EC 2004, Proceedings of the 5th ACM Conference on Electronic Commerce, pp. 125\u2013131 (2004)","DOI":"10.1145\/988772.988792"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"Mucha, M., Sankowski, P.: Maximum matchings via gaussian elimination. In: FOCS 2014, Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, pp. 248\u2013255 (2004)","DOI":"10.1109\/FOCS.2004.40"},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"Nguyen, T., Vohra, R.: Near feasible stable matchings. In: EC 2015, Proceedings of the Sixteenth ACM Conference on Economics and Computation, pp. 41\u201342 (2015)","DOI":"10.1145\/2764468.2764471"},{"key":"20_CR12","unstructured":"Schlotter, I., Dorn, B., de Haan, R.: Obtaining a proportional allocation by deleting items. CoRR, abs\/1705.11060 (2017)"},{"key":"20_CR13","unstructured":"Segal-Halevi, E., Hassidim, A., Aumann, Y.: Waste makes haste: Bounded time protocols for envy-free cake cutting with free disposal. In: AAMAS 2014, Proceedings of the 14th International Conference on Autonomous Agents and Multi-Agent Systems, pp. 901\u2013908 (2015)"},{"key":"20_CR14","series-title":"Chapman & Hall\/CRC Computer and Information Science Series","volume-title":"Handbook of Graph Theory, Combinatorial Optimization, and Algorithms","author":"K Thulasiraman","year":"2015","unstructured":"Thulasiraman, K., Arumugam, S., Brandst\u00e4dt, A., Nishizeki, T.: Handbook of Graph Theory, Combinatorial Optimization, and Algorithms. Chapman & Hall\/CRC Computer and Information Science Series. CRC Press, Boca Raton (2015)"}],"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_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T21:39:41Z","timestamp":1750887581000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-67504-6_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319675039","9783319675046"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-67504-6_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"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"}}]}}