{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T21:31:31Z","timestamp":1757539891924},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030301781"},{"type":"electronic","value":"9783030301798"}],"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-30179-8_5","type":"book-chapter","created":{"date-parts":[[2019,9,8]],"date-time":"2019-09-08T23:03:18Z","timestamp":1567983798000},"page":"60-75","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Monotone and Online Fair Division"],"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,24]]},"reference":[{"key":"5_CR1","unstructured":"Aleksandrov, M., Aziz, H., Gaspers, S., Walsh, T.: Online fair division: analysing a food bank problem. In: Proceedings of the Twenty-Fourth IJCAI 2015, Buenos Aires, Argentina, 25\u201331 July 2015, pp. 2540\u20132546 (2015)"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-319-67190-1_3","volume-title":"KI 2017: Advances in Artificial Intelligence","author":"M Aleksandrov","year":"2017","unstructured":"Aleksandrov, M., Walsh, T.: Expected outcomes and manipulations in online fair division. In: Kern-Isberner, G., F\u00fcrnkranz, J., Thimm, M. (eds.) KI 2017. LNCS (LNAI), vol. 10505, pp. 29\u201343. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-67190-1_3"},{"key":"5_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":"5_CR4","doi-asserted-by":"crossref","unstructured":"Aleksandrov, M., Walsh, T.: Pure Nash equilibria in online fair division. In: Sierra, C. (ed.) Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence (IJCAI 2017), pp. 42\u201348 (2017)","DOI":"10.24963\/ijcai.2017\/7"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Amanatidis, G., Birmpas, G., Markakis, V.: Comparing approximate relaxations of envy-freeness. In: Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI 2018, Stockholm, Sweden, 13\u201319 July 2018, pp. 42\u201348 (2018)","DOI":"10.24963\/ijcai.2018\/6"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Aziz, H., Bouveret, S., Caragiannis, I., Giagkousi, I., Lang, J.: Knowledge, fairness, and social constraints. In: AAAI, pp. 4638\u20134645. AAAI Press (2018)","DOI":"10.1609\/aaai.v32i1.11590"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Barman, S., Biswas, A., Murthy, S.K.K., Narahari, Y.: Groupwise maximin fair allocation of indivisible goods. In: AAAI, pp. 917\u2013924. AAAI Press (2018)","DOI":"10.1609\/aaai.v32i1.11463"},{"key":"5_CR8","unstructured":"Barman, S., Krishnamurthy, S.K., Vaish, R.: Greedy algorithms for maximizing nash social welfare. In: Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, AAMAS 2018, Stockholm, Sweden, 10\u201315 July 2018, pp. 7\u201313 (2018)"},{"key":"5_CR9","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":"4","key":"5_CR10","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? Ration. Soc. 17(4), 387\u2013421 (2005)","journal-title":"Ration. Soc."},{"issue":"6","key":"5_CR11","doi-asserted-by":"publisher","first-page":"1061","DOI":"10.1086\/664613","volume":"119","author":"E Budish","year":"2011","unstructured":"Budish, E.: The combinatorial assignment problem: approximate competitive equilibrium from equal incomes. J. Polit. Econ. 119(6), 1061\u20131103 (2011)","journal-title":"J. Polit. Econ."},{"issue":"5","key":"5_CR12","doi-asserted-by":"publisher","first-page":"2237","DOI":"10.1257\/aer.102.5.2237","volume":"102","author":"E Budish","year":"2012","unstructured":"Budish, E., Cantillon, E.: The multi-unit assignment problem: theory and evidence from course allocation at Harvard. Am. Econ. Rev. 102(5), 2237\u20132271 (2012)","journal-title":"Am. Econ. Rev."},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Caragiannis, I., Kurokawa, D., Moulin, H., Procaccia, A.D., Shah, N., Wang, J.: The unreasonable fairness of maximum nash welfare. In: Proceedings of the 2016 ACM Conference on EC 2016, Maastricht, The Netherlands, 24\u201328 July 2016, pp. 305\u2013322 (2016)","DOI":"10.1145\/2940716.2940726"},{"issue":"1","key":"5_CR14","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."},{"issue":"1","key":"5_CR15","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.mathsocsci.2011.12.003","volume":"64","author":"Y Chevaleyre","year":"2012","unstructured":"Chevaleyre, Y., Lang, J., Maudet, N., Monnot, J., Xia, L.: New candidates welcome! Possible winners with respect to the addition of new candidates. Math. Soc. Sci. 64(1), 74\u201388 (2012)","journal-title":"Math. Soc. Sci."},{"key":"5_CR16","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":"5_CR17","doi-asserted-by":"crossref","unstructured":"Dickerson, J.P., Procaccia, A.D., Sandholm, T.: Failure-aware kidney exchange. In: ACM Conference on Electronic Commerce, EC 2013, pp. 323\u2013340 (2013)","DOI":"10.1145\/2492002.2482596"},{"issue":"1","key":"5_CR18","doi-asserted-by":"publisher","first-page":"3:1","DOI":"10.1145\/3179406","volume":"2","author":"R Freeman","year":"2018","unstructured":"Freeman, R., Zahedi, S.M., Conitzer, V., Lee, B.C.: Dynamic proportional sharing: a game-theoretic approach. Proc. ACM Meas. Anal. Comput. Syst. 2(1), 3:1\u20133:36 (2018)","journal-title":"Proc. ACM Meas. Anal. Comput. Syst."},{"issue":"4","key":"5_CR19","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":"5_CR20","unstructured":"Greenwald, A., Boyan, J.: Bidding under uncertainty: theory and experiments. In: Proceedings of the 20th Conference on Uncertainty in Artificial Intelligence, UAI 2004, pp. 209\u2013216. AUAI Press, Arlington (2004)"},{"key":"5_CR21","unstructured":"Hosseini, H., Larson, K., Cohen, R.: Matching with dynamic ordinal preferences. In: Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, Austin, Texas, USA, 25\u201330 January, AAAI 2015, pp. 936\u2013943. AAAI Press (2015)"},{"key":"5_CR22","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":"5_CR23","doi-asserted-by":"crossref","unstructured":"Lipton, R.J., Markakis, E., Mossel, E., Saberi, A.: On approximately fair allocations of indivisible goods. In: Proceedings of the 5th ACM Conference on Electronic Commerce (EC-2004), New York, NY, USA, 17\u201320 May 2004, pp. 125\u2013131 (2004)","DOI":"10.1145\/988772.988792"},{"issue":"2","key":"5_CR24","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":"2","key":"5_CR25","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/s10458-013-9224-2","volume":"28","author":"N Nguyen","year":"2014","unstructured":"Nguyen, N., Nguyen, T.T., Roos, M., Rothe, J.: Computational complexity and approximability of social welfare optimization in multiagent resource allocation. Auton. Agent. Multi-Agent Syst. 28(2), 256\u2013289 (2014)","journal-title":"Auton. Agent. Multi-Agent Syst."},{"key":"5_CR26","doi-asserted-by":"crossref","unstructured":"Plaut, B., Roughgarden, T.: Almost envy-freeness with general valuations. In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, 7\u201310 January 2018, pp. 2584\u20132603 (2018)","DOI":"10.1137\/1.9781611975031.165"},{"key":"5_CR27","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":"5_CR28","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":"5_CR29","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"}],"container-title":["Lecture Notes in Computer Science","KI 2019: Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-30179-8_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,27]],"date-time":"2022-09-27T21:40:16Z","timestamp":1664314816000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-30179-8_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030301781","9783030301798"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-30179-8_5","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":"24 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"KI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint German\/Austrian Conference on Artificial Intelligence (K\u00fcnstliche Intelligenz)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kassel","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","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":"23 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"42","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ki2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.ki2019.de\/","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":"82","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":"16","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":"13","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":"20% - 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":"5","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)"}}]}}