{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,25]],"date-time":"2026-07-25T16:05:14Z","timestamp":1784995514373,"version":"3.55.0"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032036384","type":"print"},{"value":"9783032036391","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T00:00:00Z","timestamp":1756684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T00:00:00Z","timestamp":1756684800000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-03639-1_13","type":"book-chapter","created":{"date-parts":[[2025,8,31]],"date-time":"2025-08-31T13:24:15Z","timestamp":1756646655000},"page":"228-246","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A New Lower Bound for\u00a0Multicolor Discrepancy with\u00a0Applications to\u00a0Fair Division"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4918-7131","authenticated-orcid":false,"given":"Ioannis","family":"Caragiannis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8841-5929","authenticated-orcid":false,"given":"Kasper\u00a0Green","family":"Larsen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-3795-3989","authenticated-orcid":false,"given":"Sudarshan","family":"Shyam","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,9,1]]},"reference":[{"issue":"3","key":"13_CR1","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/0001-8708(87)90055-7","volume":"63","author":"N Alon","year":"1987","unstructured":"Alon, N.: Splitting necklaces. Adv. Math. 63(3), 247\u2013253 (1987)","journal-title":"Adv. Math."},{"key":"13_CR2","doi-asserted-by":"publisher","DOI":"10.1002\/0471722154","volume-title":"The Probabilistic Method","author":"N Alon","year":"2000","unstructured":"Alon, N., Spencer, J.H.: The Probabilistic Method, 2nd edn. Wiley, Hoboken (2000)","edition":"2"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Aziz, H., Rey, S.: Almost group envy-free allocation of indivisible goods and chores. In: Proceedings of the 29th International Joint Conference on Artificial Intelligence (IJCAI), pp. 39\u201345 (2020)","DOI":"10.24963\/ijcai.2020\/6"},{"issue":"6","key":"13_CR4","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."},{"key":"13_CR5","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. ACM Trans. Econ. Comput. 7(3), 12:1\u201312:32 (2019)","DOI":"10.1145\/3355902"},{"key":"13_CR6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511626371","volume-title":"The Discrepancy Method: Randomness and Complexity","author":"B Chazelle","year":"2000","unstructured":"Chazelle, B.: The Discrepancy Method: Randomness and Complexity. Cambridge University Press, Cambridge (2000)"},{"key":"13_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-04696-9","volume-title":"A Panorama of Discrepancy Theory","author":"WWL Chen","year":"2014","unstructured":"Chen, W.W.L., Srivastav, A., Travaglini, G.: A Panorama of Discrepancy Theory. Springer, Heidelberg (2014)"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Conitzer, V., Freeman, R., Shah, N.: Fair public decision making. In: Proceedings of the 18th ACM Conference on Economics and Computation (EC), pp. 629\u2013646 (2017)","DOI":"10.1145\/3033274.3085125"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Conitzer, V., Freeman, R., Shah, N., Vaughan, J.W.: Group fairness for the allocation of indivisible goods. In: Proceedings of the 33rd AAAI Conference on Artificial Intelligence (AAAI), pp. 1853\u20131860 (2019)","DOI":"10.1609\/aaai.v33i01.33011853"},{"issue":"4","key":"13_CR10","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1017\/S0963548303005662","volume":"12","author":"B Doerr","year":"2003","unstructured":"Doerr, B., Srivastav, A.: Multicolour discrepancies. Comb. Probab. Comput. 12(4), 365\u2013399 (2003)","journal-title":"Comb. Probab. Comput."},{"issue":"4","key":"13_CR11","doi-asserted-by":"publisher","first-page":"1154","DOI":"10.1137\/12087222X","volume":"44","author":"P Klein","year":"2015","unstructured":"Klein, P., Young, N.E.: On the number of iterations for Dantzig-Wolfe optimization and packing-covering approximation algorithms. SIAM J. Comput. 44(4), 1154\u20131172 (2015)","journal-title":"SIAM J. Comput."},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/j.tcs.2020.07.008","volume":"841","author":"M Kyropoulou","year":"2020","unstructured":"Kyropoulou, M., Suksompong, W., Voudouris, A.A.: Almost envy-freeness in group resource allocation. Theoret. Comput. Sci. 841, 110\u2013123 (2020)","journal-title":"Theoret. Comput. Sci."},{"key":"13_CR13","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), pp. 125\u2013131 (2004)","DOI":"10.1145\/988772.988792"},{"key":"13_CR14","unstructured":"Manurangsi, P., Meka, R.: Tight lower bound for multicolor discrepancy (2025). https:\/\/arxiv.org\/abs\/2504.18489"},{"key":"13_CR15","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.mathsocsci.2017.05.006","volume":"89","author":"P Manurangsi","year":"2017","unstructured":"Manurangsi, P., Suksompong, W.: Asymptotic existence of fair divisions for groups. Math. Soc. Sci. 89, 100\u2013108 (2017)","journal-title":"Math. Soc. Sci."},{"key":"13_CR16","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/j.tcs.2022.07.022","volume":"930","author":"P Manurangsi","year":"2022","unstructured":"Manurangsi, P., Suksompong, W.: Almost envy-freeness for groups: improved bounds via discrepancy theory. Theoret. Comput. Sci. 930, 179\u2013195 (2022)","journal-title":"Theoret. Comput. Sci."},{"key":"13_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03942-3","volume-title":"Geometric Discrepancy: An illustrated Guide","author":"J Matousek","year":"1999","unstructured":"Matousek, J.: Geometric Discrepancy: An illustrated Guide. Springer, Heidelberg (1999)"},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"Segal-Halevi, E., Suksompong, W.: Democratic fair allocation of indivisible goods. Artif. Intell. 277 (2019)","DOI":"10.1016\/j.artint.2019.103167"},{"issue":"1","key":"13_CR19","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/S0165-4896(02)00087-2","volume":"45","author":"FW Simmons","year":"2003","unstructured":"Simmons, F.W., Su, F.E.: Consensus-halving via theorems of borsuk-ulam and tucker. Math. Soc. Sci. 45(1), 15\u201325 (2003)","journal-title":"Math. Soc. Sci."},{"issue":"2","key":"13_CR20","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1090\/S0002-9947-1985-0784009-0","volume":"289","author":"J Spencer","year":"1985","unstructured":"Spencer, J.: Six standard deviations suffice. Trans. Am. Math. Soc. 289(2), 679\u2013706 (1985)","journal-title":"Trans. Am. Math. Soc."}],"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-032-03639-1_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,25]],"date-time":"2026-07-25T15:38:15Z","timestamp":1784993895000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-03639-1_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,1]]},"ISBN":["9783032036384","9783032036391"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-03639-1_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,1]]},"assertion":[{"value":"1 September 2025","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":"Bath","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":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sagt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}