{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T23:10:45Z","timestamp":1771888245718,"version":"3.50.1"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030649456","type":"print"},{"value":"9783030649463","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-64946-3_1","type":"book-chapter","created":{"date-parts":[[2020,12,5]],"date-time":"2020-12-05T09:03:39Z","timestamp":1607159019000},"page":"3-16","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Almost Envy-Free Repeated Matching in\u00a0Two-Sided Markets"],"prefix":"10.1007","author":[{"given":"Sreenivas","family":"Gollapudi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kostas","family":"Kollias","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benjamin","family":"Plaut","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,12,6]]},"reference":[{"key":"1_CR1","unstructured":"Aleksandrov, M., Walsh, T.: Online Fair Division: A Survey. arXiv preprint arXiv:1911.09488 (2019)"},{"key":"1_CR2","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"},{"key":"1_CR3","unstructured":"Bok\u00e1nyi, E., Hann\u00e1k, A.: Evaluating Algorithm Fairness in an Agent-based Taxi Simulation (2018, working paper)"},{"key":"1_CR4","unstructured":"Bok\u00e1nyi, E., Hann\u00e1k, A.: Ride-share Matching Algorithms Generate Income Inequality (2019, working paper)"},{"key":"1_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.D.: Handbook of Computational Social Choice. Cambridge University Press, Cambridge (2016)"},{"issue":"6","key":"1_CR6","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":"1_CR7","doi-asserted-by":"crossref","unstructured":"Calo, R., Rosenblat, A.: The taking economy: uber, information, and power. Columbia Law Rev. (2017)","DOI":"10.2139\/ssrn.2929643"},{"key":"1_CR8","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 Economics and Computation, pp. 305\u2013322. ACM (2016)","DOI":"10.1145\/2940716.2940726"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Chaudhury, B.R., Garg, J., Mehlhorn, K.: EFX exists for three agents. arXiv preprint arXiv:2002.05119 (2020)","DOI":"10.1145\/3391403.3399511"},{"key":"1_CR10","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.geb.2004.06.014","volume":"52","author":"E Damiano","year":"2005","unstructured":"Damiano, E., Lam, R.: Stability in dynamic matching markets. Games Econ. Behav. 52, 34\u201353 (2005)","journal-title":"Games Econ. Behav."},{"issue":"2","key":"1_CR11","first-page":"233","volume":"1","author":"F Echenique","year":"2006","unstructured":"Echenique, F., Oviedo, J.: A theory of stability in many-to-many matching markets. Theor. Econ. 1(2), 233\u2013273 (2006)","journal-title":"Theor. Econ."},{"issue":"4","key":"1_CR12","doi-asserted-by":"publisher","first-page":"987","DOI":"10.1007\/s10551-017-3607-2","volume":"156","author":"C Fieseler","year":"2019","unstructured":"Fieseler, C., Bucher, E., Hoffmann, C.P.: Unfairness by design? The perceived fairness of digital labor on crowdworking platforms. J. Bus. Ethics 156(4), 987\u20131005 (2019)","journal-title":"J. Bus. Ethics"},{"issue":"1","key":"1_CR13","first-page":"45","volume":"7","author":"DK Foley","year":"1967","unstructured":"Foley, D.K.: Resource allocation and the public sector. Yale Econ. Essays 7(1), 45\u201398 (1967)","journal-title":"Yale Econ. Essays"},{"issue":"1","key":"1_CR14","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1080\/00029890.1962.11989827","volume":"69","author":"D Gale","year":"1962","unstructured":"Gale, D., Shapley, L.S.: College admissions and the stability of marriage. Am. Math. Mon. 69(1), 9\u201315 (1962)","journal-title":"Am. Math. Mon."},{"key":"1_CR15","unstructured":"Gamow, G., Stern, M.: Puzzle-math. Viking Adult (1958). http:\/\/www.worldcat.org\/isbn\/0670583359"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Gollapudi, S., Kollias, K., Plaut, B.: Almost Envy-free Repeated Matching in Two-sided Markets. arXiv preprint arXiv:2009.09336 (2020)","DOI":"10.1007\/978-3-030-64946-3_1"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Hann\u00e1k, A., Wagner, C., Garcia, D., Mislove, A., Strohmaier, M., Wilson, C.: Bias in online freelance marketplaces: evidence from Taskrabbit and Fiverr. In: Proceedings of the 2017 ACM Conference on Computer Supported Cooperative Work and Social Computing, CSCW 2017, pp. 1914\u20131933. ACM, New York (2017)","DOI":"10.1145\/2998181.2998327"},{"issue":"2","key":"1_CR18","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1016\/j.econlet.2006.07.002","volume":"94","author":"E Haruvy","year":"2007","unstructured":"Haruvy, E., \u00dcnver, M.U.: Equilibrium selection and the role of information in repeated matching markets. Econ. Lett. 94(2), 284\u2013289 (2007)","journal-title":"Econ. Lett."},{"issue":"1","key":"1_CR19","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.jet.2005.02.001","volume":"129","author":"H Konishi","year":"2006","unstructured":"Konishi, H., \u00dcnver, M.U.: Credible group stability in many-to-many matching problems. J. Econ. Theor. 129(1), 57\u201380 (2006)","journal-title":"J. Econ. Theor."},{"key":"1_CR20","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, pp. 125\u2013131. ACM (2004)","DOI":"10.1145\/988772.988792"},{"key":"1_CR21","volume-title":"Fair Division and Collective Welfare","author":"H Moulin","year":"2004","unstructured":"Moulin, H.: Fair Division and Collective Welfare. MIT Press, Cambridge (2004)"},{"key":"1_CR22","first-page":"1194","volume":"2020","author":"GK Patro","year":"2020","unstructured":"Patro, G.K., Biswas, A., Ganguly, N., Gummadi, K.P., Chakraborty, A.: FairRec: two-sided fairness for personalized recommendations in two-sided platforms. Proc. Web Conf. 2020, 1194\u20131204 (2020)","journal-title":"Proc. Web Conf."},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"Plaut, B., Roughgarden, T.: Almost envy-freeness with general valuations. In: Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 2584\u20132603. Society for Industrial and Applied Mathematics (2018)","DOI":"10.1137\/1.9781611975031.165"},{"key":"1_CR24","doi-asserted-by":"publisher","DOI":"10.1017\/CCOL052139015X","volume-title":"Two-Sided Matching: A Study in Game-Theoretic Modeling and Analysis","author":"AE Roth","year":"1990","unstructured":"Roth, A.E., Sotomayor, M.: Two-Sided Matching: A Study in Game-Theoretic Modeling and Analysis. Cambridge University Press, Cambridge (1990)"},{"issue":"1","key":"1_CR25","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/S0165-4896(98)00048-1","volume":"38","author":"M Sotomayor","year":"1999","unstructured":"Sotomayor, M.: Three remarks on the many-to-many stable matching problem. Math. Soc. Sci. 38(1), 55\u201370 (1999)","journal-title":"Math. Soc. Sci."},{"issue":"1","key":"1_CR26","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/S0899-8256(03)00047-2","volume":"46","author":"M Sotomayor","year":"2004","unstructured":"Sotomayor, M.: Implementation in the many-to-many matching market. Games Econ. Behav. 46(1), 199\u2013212 (2004)","journal-title":"Games Econ. Behav."},{"issue":"1","key":"1_CR27","first-page":"101","volume":"16","author":"H Steinhaus","year":"1948","unstructured":"Steinhaus, H.: The problem of fair division. Econometrica 16(1), 101\u2013104 (1948)","journal-title":"Econometrica"},{"key":"1_CR28","doi-asserted-by":"crossref","unstructured":"S\u00fchr, T., Biega, A.J., Zehlike, M., Gummadi, K.P., Chakraborty, A.: Two-sided fairness for repeated matchings in two-sided markets: a case study of a ride-hailing platform. In: Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, KDD 2019, pp. 3082\u20133092. ACM, New York (2019)","DOI":"10.1145\/3292500.3330793"},{"key":"1_CR29","doi-asserted-by":"crossref","unstructured":"Wolfson, O., Lin, J.: Fairness versus optimality in ridesharing. In: 2017 18th IEEE International Conference on Mobile Data Management (MDM), pp. 118\u2013123. IEEE (2017)","DOI":"10.1109\/MDM.2017.25"}],"container-title":["Lecture Notes in Computer Science","Web and Internet Economics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-64946-3_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,5]],"date-time":"2020-12-05T17:03:11Z","timestamp":1607187791000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-64946-3_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030649456","9783030649463"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-64946-3_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"6 December 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WINE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web and Internet Economics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Beijing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 December 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 December 2020","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":"wine2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/econcs.pku.edu.cn\/wine2020\/","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":"136","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":"31","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":"11","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":"23% - 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":"10","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)"}}]}}