{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T01:53:35Z","timestamp":1780624415520,"version":"3.54.1"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031157134","type":"print"},{"value":"9783031157141","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-15714-1_30","type":"book-chapter","created":{"date-parts":[[2022,9,13]],"date-time":"2022-09-13T17:26:44Z","timestamp":1663090004000},"page":"526-543","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Online Max-min Fair Allocation"],"prefix":"10.1007","author":[{"given":"Yasushi","family":"Kawase","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hanna","family":"Sumita","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,9,14]]},"reference":[{"key":"30_CR1","unstructured":"Aleksandrov, M., Aziz, H., Gaspers, S., Walsh, T.: Online fair division: analysing a food bank problem. In: Proceedings of IJCAI, pp. 2540\u20132546 (2015)"},{"key":"30_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":"30_CR3","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/978-3-030-29908-8_42","volume-title":"PRICAI 2019: Trends in Artificial Intelligence","author":"M Aleksandrov","year":"2019","unstructured":"Aleksandrov, M., Walsh, T.: Strategy-proofness, envy-freeness and pareto efficiency in online fair division with additive utilities. In: Nayak, A.C., Sharma, A. (eds.) PRICAI 2019. LNCS (LNAI), vol. 11670, pp. 527\u2013541. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-29908-8_42"},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"Aleksandrov, M., Walsh, T.: Online fair division a survey. In: Proceedings of AAAI, vol. 34, pp. 13557\u201313562 (2020)","DOI":"10.1609\/aaai.v34i09.7081"},{"issue":"1","key":"30_CR5","doi-asserted-by":"publisher","first-page":"121","DOI":"10.4086\/toc.2012.v008a006","volume":"8","author":"S Arora","year":"2012","unstructured":"Arora, S., Hazan, E., Kale, S.: The multiplicative weights update method: a meta algorithm and applications. Theory Comput. 8(1), 121\u2013164 (2012)","journal-title":"Theory Comput."},{"issue":"7","key":"30_CR6","doi-asserted-by":"publisher","first-page":"2970","DOI":"10.1137\/080723491","volume":"39","author":"A Asadpour","year":"2010","unstructured":"Asadpour, A., Saberi, A.: An approximation algorithm for max-min fair allocation of indivisible goods. SIAM J. Comput. 39(7), 2970\u20132989 (2010)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"30_CR7","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1002\/(SICI)1099-1425(199808)1:2<67::AID-JOS6>3.0.CO;2-Y","volume":"1","author":"Y Azar","year":"1998","unstructured":"Azar, Y., Epstein, L.: On-line machine covering. J. Sched. 1(2), 67\u201377 (1998)","journal-title":"J. Sched."},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"Banerjee, S., Gkatzelis, V., Gorokh, A., Jin, B.: Online Nash social welfare maximization with predictions. In: Proceedings SODA, pp. 1\u201319 (2022)","DOI":"10.1137\/1.9781611977073.1"},{"key":"30_CR9","doi-asserted-by":"crossref","unstructured":"Bansal, N., Sviridenko, M.: The Santa Claus problem. In: Proceedings of STOC, pp. 31\u201340 (2006)","DOI":"10.1145\/1132516.1132522"},{"key":"30_CR10","doi-asserted-by":"publisher","unstructured":"Barman, S., Khan, A., Maiti, A.: Universal and tight online algorithms for generalized-mean welfare (2021). https:\/\/doi.org\/10.48550\/ARXIV.2109.00874","DOI":"10.48550\/ARXIV.2109.00874"},{"issue":"1","key":"30_CR11","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/BF01294260","volume":"11","author":"S Ben-David","year":"1994","unstructured":"Ben-David, S., Borodin, A., Karp, R., Tardos, G., Wigderson, A.: On the power of randomization in on-line algorithms. Algorithmica 11(1), 2\u201314 (1994)","journal-title":"Algorithmica"},{"key":"30_CR12","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 EC, pp. 593\u2013610 (2018)","DOI":"10.1145\/3219166.3219179"},{"issue":"3","key":"30_CR13","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/1120680.1120683","volume":"5","author":"I Bez\u00e1kov\u00e1","year":"2005","unstructured":"Bez\u00e1kov\u00e1, I., Dani, V.: Allocating indivisible goods. SIGecom Exchanges 5(3), 11\u201318 (2005)","journal-title":"SIGecom Exchanges"},{"key":"30_CR14","doi-asserted-by":"publisher","first-page":"1174","DOI":"10.1287\/mnsc.2021.3973","volume":"68","author":"A Bogomolnaia","year":"2021","unstructured":"Bogomolnaia, A., Moulin, H., Sandomirskiy, F.: On the fair division of a random object. Manag. Sci. 68, 1174\u20131194 (2021)","journal-title":"Manag. Sci."},{"key":"30_CR15","unstructured":"Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge (1998)"},{"key":"30_CR16","doi-asserted-by":"crossref","unstructured":"Bouveret, S., Chevaleyre, Y., Maudet, N.: Fair allocation of indivisible goods. In: Brandt, F., Conitzer, V., Endriss, U., Lang, J., Procaccia, A.D. (eds.) Handbook of Computational Social Choice, chap. 12, pp. 284\u2013310. Cambridge University Press (2016)","DOI":"10.1017\/CBO9781107446984.013"},{"key":"30_CR17","doi-asserted-by":"crossref","unstructured":"Chakrabarty, D., Chuzhoy, J., Khanna, S.: On allocating goods to maximize fairness. In: Proceedings of FOCS, pp. 107\u2013116 (2009)","DOI":"10.1109\/FOCS.2009.51"},{"issue":"2","key":"30_CR18","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1137\/0603019","volume":"3","author":"BL Deuermeyer","year":"1982","unstructured":"Deuermeyer, B.L., Friesen, D.K., Langston, M.A.: Scheduling to maximize the minimum processor finish time in a multiprocessor system. SIAM J. Algebraic Discret. Methods 3(2), 190\u2013196 (1982)","journal-title":"SIAM J. Algebraic Discret. Methods"},{"key":"30_CR19","doi-asserted-by":"crossref","unstructured":"Devanur, N.R., Jain, K., Sivan, B., Wilkens, C.A.: Near optimal online algorithms and fast approximation algorithms for resource allocation problems. J. ACM 66(1) (2019)","DOI":"10.1145\/3284177"},{"key":"30_CR20","doi-asserted-by":"publisher","unstructured":"Dubhashi, D.P., Panconesi, A.: Concentration of Measure for the Analysis of Randomized Algorithms. Cambridge University Press (2009). https:\/\/doi.org\/10.1017\/CBO9780511581274","DOI":"10.1017\/CBO9780511581274"},{"key":"30_CR21","unstructured":"Feige, U.: On allocations that maximize fairness. In: Proceedings of SODA, vol. 8, pp. 287\u2013293 (2008)"},{"key":"30_CR22","unstructured":"G\u00e1lvez, W., Soto, J.A., Verschae, J.: Improved online algorithms for the machine covering problem with bounded migration. In: Proceedings of Workshop on Models and Algorithms for Planning and Scheduling Problems, vol. 21 (2015)"},{"issue":"4","key":"30_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3397535","volume":"16","author":"W G\u00e1lvez","year":"2020","unstructured":"G\u00e1lvez, W., Soto, J.A., Verschae, J.: Symmetry exploitation for online machine covering with bounded migration. ACM Trans. Algorithms 16(4), 1\u201322 (2020)","journal-title":"ACM Trans. Algorithms"},{"key":"30_CR24","unstructured":"Golovin, D.: Max-min fair allocation of indivisible goods. Technical Report CMU-CS-05-144, Carnegie Mellon University (2005)"},{"key":"30_CR25","doi-asserted-by":"crossref","unstructured":"Haeupler, B., Saha, B., Srinivasan, A.: New constructive aspects of the Lov\u00e1sz local lemma. J. ACM 58(6), 28:1\u201328:28 (2011)","DOI":"10.1145\/2049697.2049702"},{"key":"30_CR26","doi-asserted-by":"crossref","unstructured":"Kawase, Y., Sumita, H.: On the max-min fair stochastic allocation of indivisible goods. In: Proceedings of AAAI, vol. 34, pp. 2070\u20132078 (2020)","DOI":"10.1609\/aaai.v34i02.5580"},{"key":"30_CR27","doi-asserted-by":"publisher","unstructured":"Kawase, Y., Sumita, H.: Online max-min fair allocation (2021). https:\/\/doi.org\/10.48550\/ARXIV.2111.07235","DOI":"10.48550\/ARXIV.2111.07235"},{"issue":"1","key":"30_CR28","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/BF01585745","volume":"46","author":"JK Lenstra","year":"1990","unstructured":"Lenstra, J.K., Shmoys, D.B., Tardos, \u00c9.: Approximation algorithms for scheduling unrelated parallel machines. Math. Program. 46(1), 259\u2013271 (1990)","journal-title":"Math. Program."},{"key":"30_CR29","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/j.eswa.2019.01.071","volume":"124","author":"Y Li","year":"2019","unstructured":"Li, Y., et al.: Max-min fair allocation for resources with hybrid divisibilities. Expert Syst. Appl. 124, 325\u2013340 (2019)","journal-title":"Expert Syst. Appl."},{"key":"30_CR30","unstructured":"Ma, W., Xu, P., Xu, Y.: Fairness maximization among offline agents in online-matching markets. In: Proceedings of WINE, p. 547 (2021)"},{"key":"30_CR31","doi-asserted-by":"crossref","unstructured":"Mattei, N., Saffidine, A., Walsh, T.: Mechanisms for online organ matching. In: Proceedings of IJCAI, pp. 345\u2013351 (2017)","DOI":"10.24963\/ijcai.2017\/49"},{"key":"30_CR32","doi-asserted-by":"publisher","first-page":"2191","DOI":"10.1007\/978-1-4419-7997-1_2","volume-title":"Handbook of Combinatorial Optimization","author":"Z Tan","year":"2013","unstructured":"Tan, Z., Zhang, A.: Online and semi-online scheduling. In: Pardalos, P.M., Du, D.-Z., Graham, R.L. (eds.) Handbook of Combinatorial Optimization, pp. 2191\u20132252. Springer, New York (2013). https:\/\/doi.org\/10.1007\/978-1-4419-7997-1_2"},{"issue":"4","key":"30_CR33","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0167-6377(96)00055-7","volume":"20","author":"GJ Woeginger","year":"1997","unstructured":"Woeginger, G.J.: A polynomial-time approximation scheme for maximizing the minimum machine completion time. Oper. Res. Lett. 20(4), 149\u2013154 (1997)","journal-title":"Oper. Res. Lett."},{"key":"30_CR34","doi-asserted-by":"crossref","unstructured":"Zeng, D., Psomas, A.: Fairness-efficiency tradeoffs in dynamic fair division. In: Proceedings of EC, pp. 911\u2013912 (2020)","DOI":"10.1145\/3391403.3399467"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-15714-1_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,13]],"date-time":"2022-09-13T17:30:40Z","timestamp":1663090240000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-15714-1_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031157134","9783031157141"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-15714-1_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"14 September 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAGT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithmic Game Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Colchester","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sagt2022","order":10,"name":"conference_id","label":"Conference ID","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":"83","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":"34","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":"41% - 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.01","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.9","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)"}}]}}