{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:27:55Z","timestamp":1742912875671,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031157134"},{"type":"electronic","value":"9783031157141"}],"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_28","type":"book-chapter","created":{"date-parts":[[2022,9,13]],"date-time":"2022-09-13T17:26:44Z","timestamp":1663090004000},"page":"490-507","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Fairness in\u00a0Temporal Slot Assignment"],"prefix":"10.1007","author":[{"given":"Edith","family":"Elkind","sequence":"first","affiliation":[]},{"given":"Sonja","family":"Kraiczy","sequence":"additional","affiliation":[]},{"given":"Nicholas","family":"Teh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,9,14]]},"reference":[{"issue":"2","key":"28_CR1","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s12188-016-0160-3","volume":"87","author":"R Aharoni","year":"2016","unstructured":"Aharoni, R., Berger, E., Kotlar, D., Ziv, R.: On a conjecture of Stein. Abh. Math. Semin. Univ. Hambg. 87(2), 203\u2013211 (2016). https:\/\/doi.org\/10.1007\/s12188-016-0160-3","journal-title":"Abh. Math. Semin. Univ. Hambg."},{"key":"28_CR2","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0020-0190(79)90002-4","volume":"8","author":"B Aspvall","year":"1979","unstructured":"Aspvall, B., Plass, M., Tarjan, R.: A linear-time algorithm for testing the truth of certain quantified Boolean formulas. Inf. Process. Lett. 8, 121\u2013123 (1979)","journal-title":"Inf. Process. Lett."},{"unstructured":"Bampis, E., Escoffier, B., Mladenovic, S.: Fair resource allocation over time. In: Proceedings of the 17th International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), pp. 766\u2013773 (2018)","key":"28_CR3"},{"key":"28_CR4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511598975","volume-title":"Fair Division: From Cake-Cutting to Dispute Resolution","author":"S Brams","year":"1996","unstructured":"Brams, S., Taylor, A.: Fair Division: From Cake-Cutting to Dispute Resolution. Cambridge University Press, Cambridge (1996)"},{"key":"28_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107446984","volume-title":"Handbook of Computational Social Choice","author":"F Brandt","year":"2016","unstructured":"Brandt, F., Conitzer, V., Endriss, U., Lang, J., Procaccia, A.: Handbook of Computational Social Choice. Cambridge University Press, Cambridge (2016)"},{"issue":"125","key":"28_CR6","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1090\/S0025-5718-1974-0331751-8","volume":"28","author":"JR Bunch","year":"1974","unstructured":"Bunch, J.R., Hopcroft, J.E.: Triangular factorization and inversion by fast matrix multiplication. Math. Comput. 28(125), 231\u2013236 (1974)","journal-title":"Math. Comput."},{"doi-asserted-by":"crossref","unstructured":"Chakraborty, M., Igarashi, A., Suksompong, W., Zick, Y.: Weighted envy-freeness in indivisible item allocation. ACM Trans. Econ. Comput. 9(3), 18:1\u201318:39 (2021)","key":"28_CR7","DOI":"10.1145\/3457166"},{"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)","key":"28_CR8","DOI":"10.1609\/aaai.v33i01.33011853"},{"doi-asserted-by":"crossref","unstructured":"Elkind, E., Patel, N., Tsang, A., Zick, Y.: Keeping your friends close: land allocation with friends. In: Proceedings of the 29th International Joint Conference on Artificial Intelligence (IJCAI), pp. 318\u2013324 (2020)","key":"28_CR9","DOI":"10.24963\/ijcai.2020\/45"},{"doi-asserted-by":"crossref","unstructured":"Even, S., Itai, A., Shamir, A.: On the complexity of time table and multi-commodity flow problems. In: Proceedings of the 16th Symposium on Foundations of Computer Science (FOCS), pp. 184\u2013193 (1975)","key":"28_CR10","DOI":"10.1109\/SFCS.1975.21"},{"key":"28_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1613\/jair.1.11291","volume":"64","author":"A Farhadi","year":"2019","unstructured":"Farhadi, A., et al.: Fair allocation of indivisible goods to asymmetric agents. J. Artif. Intell. Res. 64, 1\u201320 (2019)","journal-title":"J. Artif. Intell. Res."},{"key":"28_CR12","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/BF02679443","volume":"30","author":"M Frances","year":"2007","unstructured":"Frances, M., Litman, A.: On covering problems of codes. Theory Comput. Syst. 30, 113\u2013119 (2007)","journal-title":"Theory Comput. Syst."},{"doi-asserted-by":"crossref","unstructured":"Freeman, R., Zahedi, S.M., Conitzer, V.: Fair and efficient social choice in dynamic settings. In: Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI), pp. 4580\u20134587 (2017)","key":"28_CR13","DOI":"10.24963\/ijcai.2017\/639"},{"issue":"1","key":"28_CR14","doi-asserted-by":"publisher","first-page":"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), 1\u201336 (2018)","journal-title":"Proc. ACM Meas. Anal. Comput. Syst."},{"issue":"4","key":"28_CR15","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1023\/A:1018981505752","volume":"12","author":"M Gasca","year":"2000","unstructured":"Gasca, M., Sauer, T.: Polynomial interpolation in several variables. Adv. Comput. Math. 12(4), 377\u2013410 (2000)","journal-title":"Adv. Comput. Math."},{"issue":"1\u20132","key":"28_CR16","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1002\/malq.19670130104","volume":"13","author":"M Krom","year":"1967","unstructured":"Krom, M.: The decision problem for a class of first-order formulas in which all disjunctions are binary. Math. Log. Q. 13(1\u20132), 15\u201320 (1967)","journal-title":"Math. Log. Q."},{"doi-asserted-by":"crossref","unstructured":"Lackner, M.: Perpetual voting: fairness in long-term decision making. In: Proceedings of the 34th AAAI Conference on Artificial Intelligence (AAAI), pp. 2103\u20132110 (2020)","key":"28_CR17","DOI":"10.1609\/aaai.v34i02.5584"},{"doi-asserted-by":"crossref","unstructured":"Lackner, M., Maly, J., Rey, S.: Fairness in long-term participatory budgeting. In: Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI), pp. 299\u2013305 (2021)","key":"28_CR18","DOI":"10.24963\/ijcai.2021\/42"},{"issue":"1","key":"28_CR19","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/S0890-5401(03)00057-9","volume":"185","author":"K Lanctot","year":"2003","unstructured":"Lanctot, K., Li, M., Ma, B., Wang, S., Zhang, L.: Distinguishing string selection problems. Inf. Comput. 185(1), 41\u201355 (2003)","journal-title":"Inf. Comput."},{"doi-asserted-by":"crossref","unstructured":"Lodi, A., Olivier, P., Pesant, G., Sankaranarayanan, S.: Fairness over time in dynamic resource allocation with an application in healthcare. arXiv preprint arXiv:2101.03716 (2022)","key":"28_CR20","DOI":"10.1007\/s10107-022-01904-6"},{"key":"28_CR21","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R Motwani","year":"1995","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)"},{"doi-asserted-by":"crossref","unstructured":"Perarnau, G., Serra, O.: Rainbow matchings: existence and counting. arXiv preprint arXiv:1104.2702 (2011)","key":"28_CR22","DOI":"10.1016\/j.endm.2011.10.019"},{"unstructured":"Scarlett, J., Teh, N., Zick, Y.: For one and all: individual and group fairness in the allocation of indivisible goods. In: Proceedings of the 8th International Workshop on Computational Social Choice (COMSOC) (2021)","key":"28_CR23"},{"key":"28_CR24","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","author":"A Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Heidelberg (2003)"},{"key":"28_CR25","first-page":"405","volume":"110","author":"A Schwarzenberg-Czerny","year":"1995","unstructured":"Schwarzenberg-Czerny, A.: On matrix factorization and efficient least squares solution. Astron. Astrophys., Suppl. Ser. 110, 405 (1995)","journal-title":"Astron. Astrophys., Suppl. Ser."},{"key":"28_CR26","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.mathsocsci.2022.03.004","volume":"117","author":"W Suksompong","year":"2022","unstructured":"Suksompong, W., Teh, N.: On maximum weighted Nash welfare for binary valuations. Math. Soc. Sci. 117, 101\u2013108 (2022)","journal-title":"Math. Soc. Sci."},{"issue":"3","key":"28_CR27","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/S0747-7171(08)80018-1","volume":"9","author":"R Zippel","year":"1990","unstructured":"Zippel, R.: Interpolating polynomials from their values. J. Symb. Comput. 9(3), 375\u2013403 (1990)","journal-title":"J. Symb. Comput."}],"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_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,18]],"date-time":"2023-02-18T23:34:12Z","timestamp":1676763252000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-15714-1_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031157134","9783031157141"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-15714-1_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"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)"}}]}}