{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T15:41:10Z","timestamp":1742917270896,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030299071"},{"type":"electronic","value":"9783030299088"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-29908-8_42","type":"book-chapter","created":{"date-parts":[[2019,8,23]],"date-time":"2019-08-23T01:03:32Z","timestamp":1566522212000},"page":"527-541","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Strategy-Proofness, Envy-Freeness and Pareto Efficiency in Online Fair Division with Additive Utilities"],"prefix":"10.1007","author":[{"given":"Martin","family":"Aleksandrov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toby","family":"Walsh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,8,23]]},"reference":[{"issue":"3","key":"42_CR1","doi-asserted-by":"publisher","first-page":"689","DOI":"10.2307\/2998580","volume":"66","author":"A Abdulkadiroglu","year":"1998","unstructured":"Abdulkadiroglu, A., S\u00f6nmez, T.: Random serial dictatorship and the core from random endowments in house allocation problems. Econometrica 66(3), 689\u2013702 (1998)","journal-title":"Econometrica"},{"key":"42_CR2","unstructured":"Aleksandrov, M., Aziz, H., Gaspers, S., Walsh, T.: Online fair division: analysing a food bank problem. In: Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence (IJCAI 2015), Buenos Aires, Argentina, 25\u201331 July 2015, pp. 2540\u20132546 (2015)"},{"key":"42_CR3","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/978-3-319-67190-1_4","volume-title":"KI 2017: Advances in Artificial Intelligence","author":"M Aleksandrov","year":"2017","unstructured":"Aleksandrov, M., Walsh, T.: Most competitive mechanisms in online fair division. In: Kern-Isberner, G., F\u00fcrnkranz, J., Thimm, M. (eds.) KI 2017. LNCS (LNAI), vol. 10505, pp. 44\u201357. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-67190-1_4"},{"key":"42_CR4","doi-asserted-by":"crossref","unstructured":"Benade, G., Kazachkov, A.M., Procaccia, A.D., Psomas, C.A.: How to make envy vanish over time. In: Proceedings of the 2018 ACM Conference on Economics and Computation, EC 2018, pp. 593\u2013610. ACM, New York (2018)","DOI":"10.1145\/3219166.3219179"},{"issue":"2","key":"42_CR5","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1006\/jeth.2000.2710","volume":"100","author":"A Bogomolnaia","year":"2001","unstructured":"Bogomolnaia, A., Moulin, H.: A new solution to the random assignment problem. J. Econ. Theory 100(2), 295\u2013328 (2001)","journal-title":"J. Econ. Theory"},{"issue":"4","key":"42_CR6","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1177\/1043463105058317","volume":"17","author":"SJ Brams","year":"2005","unstructured":"Brams, S.J., King, D.L.: Efficient fair division: help the worst off or avoid envy? Rat. Soc. 17(4), 387\u2013421 (2005)","journal-title":"Rat. Soc."},{"issue":"1","key":"42_CR7","doi-asserted-by":"publisher","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(1), 49\u201362 (2008)","journal-title":"Ann. Oper. Res."},{"key":"42_CR8","unstructured":"Dickerson, J.P., Procaccia, A.D., Sandholm, T.: Dynamic matching via weighted myopia with application to kidney exchange. In: Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence (2012)"},{"key":"42_CR9","doi-asserted-by":"crossref","unstructured":"Dickerson, J.P., Sandholm, T.: Futurematch: combining human value judgments and machine learning to match in dynamic environments. In: Proceedings of the Twenty-Ninth AAAI Conference, pp. 622\u2013628 (2015)","DOI":"10.1609\/aaai.v29i1.9239"},{"key":"42_CR10","doi-asserted-by":"crossref","unstructured":"Freeman, R., Zahedi, S.M., Conitzer, V., Lee, B.C.: Dynamic proportional sharing: a game-theoretic approach. In: Proceedings of the ACM on Measurement and Analysis of Computing Systems - SIGMETRICS, vol. 2, no. 1, pp. 3:1\u20133:36, April 2018","DOI":"10.1145\/3179406"},{"issue":"4","key":"42_CR11","doi-asserted-by":"publisher","first-page":"587","DOI":"10.2307\/1914083","volume":"41","author":"A Gibbard","year":"1973","unstructured":"Gibbard, A.: Manipulation of voting schemes: a general result. Econometrica 41(4), 587\u2013601 (1973)","journal-title":"Econometrica"},{"key":"42_CR12","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1613\/jair.4405","volume":"51","author":"IA Kash","year":"2014","unstructured":"Kash, I.A., Procaccia, A.D., Shah, N.: No agent left behind: dynamic fair division of multiple resources. JAIR 51, 579\u2013603 (2014). https:\/\/doi.org\/10.1613\/jair.4405","journal-title":"JAIR"},{"key":"42_CR13","unstructured":"Lian, J.W., Mattei, N., Noble, R., Walsh, T.: The conference paper assignment problem: using order weighted averages to assign indivisible goods. In: Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, (AAAI-18), New Orleans, Louisiana, USA, 2\u20137 February 2018, pp. 1138\u20131145 (2018)"},{"issue":"2","key":"42_CR14","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1016\/j.geb.2007.01.003","volume":"61","author":"M Manea","year":"2007","unstructured":"Manea, M.: Serial dictatorship and pareto optimality. Games Econ. Behav. 61(2), 316\u2013330 (2007). https:\/\/doi.org\/10.1016\/j.geb.2007.01.003","journal-title":"Games Econ. Behav."},{"issue":"4","key":"42_CR15","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/s003550050160","volume":"16","author":"LG Svensson","year":"1999","unstructured":"Svensson, L.G.: Strategy-proof allocation of indivisible goods. Soc. Choice Welf. 16(4), 557\u2013567 (1999)","journal-title":"Soc. Choice Welf."},{"key":"42_CR16","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/978-3-642-24873-3_22","volume-title":"Algorithmic Decision Theory","author":"T Walsh","year":"2011","unstructured":"Walsh, T.: Online cake cutting. In: Brafman, R.I., Roberts, F.S., Tsouki\u00e0s, A. (eds.) ADT 2011. LNCS (LNAI), vol. 6992, pp. 292\u2013305. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24873-3_22"},{"key":"42_CR17","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-319-11206-0_2","volume-title":"KI 2014: Advances in Artificial Intelligence","author":"T Walsh","year":"2014","unstructured":"Walsh, T.: Allocation in practice. In: Lutz, C., Thielscher, M. (eds.) KI 2014. LNCS (LNAI), vol. 8736, pp. 13\u201324. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11206-0_2"},{"key":"42_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1007\/978-3-642-17572-5_33","volume-title":"Internet and Network Economics","author":"L Xia","year":"2010","unstructured":"Xia, L., Conitzer, V.: Strategy-proof voting rules over multi-issue domains with restricted preferences. In: Saberi, A. (ed.) WINE 2010. LNCS, vol. 6484, pp. 402\u2013414. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17572-5_33"},{"issue":"1","key":"42_CR19","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0022-0531(90)90070-Z","volume":"52","author":"L Zhou","year":"1990","unstructured":"Zhou, L.: On a conjecture by Gale about one-sided matching problems. J. Econ. Theory 52(1), 123\u2013135 (1990)","journal-title":"J. Econ. Theory"}],"container-title":["Lecture Notes in Computer Science","PRICAI 2019: Trends in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-29908-8_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T15:24:24Z","timestamp":1709825064000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-29908-8_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030299071","9783030299088"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-29908-8_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"23 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PRICAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pacific Rim International Conference on Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cuvu, Yanuka Island","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Fiji","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pricai2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.pricai.org\/2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}