{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T06:29:07Z","timestamp":1778048947901,"version":"3.51.4"},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2020,2,4]],"date-time":"2020-02-04T00:00:00Z","timestamp":1580774400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,2,4]],"date-time":"2020-02-04T00:00:00Z","timestamp":1580774400000},"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":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2020,9]]},"DOI":"10.1007\/s10618-020-00675-y","type":"journal-article","created":{"date-parts":[[2020,2,4]],"date-time":"2020-02-04T12:04:17Z","timestamp":1580817857000},"page":"1291-1335","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Fair-by-design matching"],"prefix":"10.1007","volume":"34","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2869-9330","authenticated-orcid":false,"given":"David","family":"Garc\u00eda-Soriano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesco","family":"Bonchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,2,4]]},"reference":[{"key":"675_CR1","unstructured":"Big data: Seizing opportunities, preserving values. Technical report, US Executive Office of the President (2014). https:\/\/obamawhitehouse.archives.gov\/sites\/default\/files\/docs\/big_data_privacy_report_may_1_2014.pdf. Accessed 21 Jan 2019"},{"key":"675_CR2","unstructured":"Big data: A report on algorithmic systems, opportunity, and civil rights. Technical report, US Executive Office of the President (2016). https:\/\/obamawhitehouse.archives.gov\/blog\/2016\/05\/04\/big-risks-big-opportunities-intersection-big-data-and-civil-rights. Accessed 21 Jan 2019"},{"key":"675_CR3","doi-asserted-by":"publisher","unstructured":"Bansal N, Sviridenko M (2006) The Santa Claus problem. In: Proceedings of the thirty-eighth annual ACM symposium on theory of computing, STOC \u201906. ACM, New York, NY, USA, pp 31\u201340. https:\/\/doi.org\/10.1145\/1132516.1132522","DOI":"10.1145\/1132516.1132522"},{"issue":"9","key":"675_CR4","doi-asserted-by":"publisher","first-page":"842","DOI":"10.1073\/pnas.43.9.842","volume":"43","author":"C Berge","year":"1957","unstructured":"Berge C (1957) Two theorems in graph theory. PNAS 43(9):842\u2013844","journal-title":"PNAS"},{"key":"675_CR5","volume-title":"Data networks","author":"DP Bertsekas","year":"1992","unstructured":"Bertsekas DP, Gallager RG, Humblet P (1992) Data networks, vol 2. Prentice-Hall International, Upper Saddle River"},{"issue":"1","key":"675_CR6","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1287\/opre.1100.0865","volume":"59","author":"D Bertsimas","year":"2011","unstructured":"Bertsimas D, Farias VF, Trichakis N (2011) The price of fairness. Oper Res 59(1):17\u201331","journal-title":"Oper Res"},{"key":"675_CR7","first-page":"147","volume":"5","author":"G Birkhoff","year":"1946","unstructured":"Birkhoff G (1946) Tres observaciones sobre el \u00e1lgebra lineal. Univ Nac Tucum\u00e1n Rev Ser A 5:147\u2013151","journal-title":"Univ Nac Tucum\u00e1n Rev Ser A"},{"issue":"2","key":"675_CR8","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1006\/jeth.2000.2710","volume":"100","author":"A Bogomolnaia","year":"2001","unstructured":"Bogomolnaia A, Moulin H (2001) A new solution to the random assignment problem. J Econ Theory 100(2):295\u2013328","journal-title":"J Econ Theory"},{"issue":"1","key":"675_CR9","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1111\/j.1468-0262.2004.00483.x","volume":"72","author":"A Bogomolnaia","year":"2004","unstructured":"Bogomolnaia A, Moulin H (2004) Random matching under dichotomous preferences. Econometrica 72(1):257\u2013279","journal-title":"Econometrica"},{"issue":"11","key":"675_CR10","first-page":"1314","volume":"53","author":"SJ Brams","year":"2006","unstructured":"Brams SJ, Jones MA, Klamler C et al (2006) Better ways to cut a cake. Notices AMS 53(11):1314\u20131321","journal-title":"Notices AMS"},{"key":"675_CR11","doi-asserted-by":"crossref","unstructured":"Br\u00e2nzei S, Gkatzelis V, Mehta R (2017) Nash social welfare approximation for strategic agents. In: EC. ACM, pp 611\u2013628","DOI":"10.1145\/3033274.3085143"},{"issue":"2","key":"675_CR12","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1287\/opre.27.2.324","volume":"27","author":"JR Brown","year":"1979","unstructured":"Brown JR (1979) The sharing problem. Oper Res 27(2):324\u2013340","journal-title":"Oper Res"},{"key":"675_CR13","doi-asserted-by":"crossref","unstructured":"Caragiannis I, Kurokawa D, Moulin H, Procaccia AD, Shah N, Wang J (2016) The unreasonable fairness of maximum Nash welfare. In: EC","DOI":"10.1145\/2940716.2940726"},{"key":"675_CR14","doi-asserted-by":"crossref","unstructured":"Charikar M (2000) Greedy approximation algorithms for finding dense components in a graph. In: APPROX, pp 84\u201395","DOI":"10.1007\/3-540-44436-X_10"},{"issue":"1","key":"675_CR15","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/s00453-009-9307-2","volume":"58","author":"CT Cheng","year":"2010","unstructured":"Cheng CT (2010) Understanding the generalized median stable matchings. Algorithmica 58(1):34\u201351","journal-title":"Algorithmica"},{"issue":"4","key":"675_CR16","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/PL00009180","volume":"19","author":"BV Cherkassky","year":"1997","unstructured":"Cherkassky BV, Goldberg AV (1997) On implementing the push-relabel method for the maximum flow problem. Algorithmica 19(4):390\u2013410","journal-title":"Algorithmica"},{"key":"675_CR17","unstructured":"Cherkassky BV, Goldberg AV (2004) HIPR 3.5. Technical report, IG systems, Inc. http:\/\/www.avglab.com\/andrew\/soft.html. Accessed 21 Jan 2019"},{"issue":"1","key":"675_CR18","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s004930170002","volume":"21","author":"R Cole","year":"2001","unstructured":"Cole R, Ost K, Schirra S (2001) Edge-coloring bipartite multigraphs in O (E log D) time. Combinatorica 21(1):5\u201312","journal-title":"Combinatorica"},{"issue":"1\u20132","key":"675_CR19","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/s12243-011-0246-y","volume":"67","author":"A Coluccia","year":"2012","unstructured":"Coluccia A, D\u2019Alconzo A, Ricciato F (2012) On the optimality of max\u2013min fairness in resource allocation. Ann Telecommun 67(1\u20132):15\u201326","journal-title":"Ann Telecommun"},{"key":"675_CR20","doi-asserted-by":"crossref","unstructured":"Corbett-Davies S, Pierson E, Feller A, Goel S, Huq A (2017) Algorithmic decision making and the cost of fairness. In: KDD","DOI":"10.1145\/3097983.3098095"},{"issue":"4","key":"675_CR21","first-page":"516","volume":"10","author":"AL Dulmage","year":"1958","unstructured":"Dulmage AL, Mendelsohn NS (1958) Coverings of bipartite graphs. Can JRL Math 10(4):516\u2013534","journal-title":"Can JRL Math"},{"key":"675_CR22","doi-asserted-by":"crossref","unstructured":"Dwork C (2017) What\u2019s fair? In: KDD [Keynote]","DOI":"10.1145\/3097983.3105807"},{"key":"675_CR23","doi-asserted-by":"crossref","unstructured":"Dwork C, Hardt M, Pitassi T, Reingold O, Zemel R (2012) Fairness through awareness. In: Proceedings of the 3rd conference on innovations in theoretical computer science. ACM, pp 214\u2013226","DOI":"10.1145\/2090236.2090255"},{"issue":"3","key":"675_CR24","doi-asserted-by":"publisher","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J Edmonds","year":"1965","unstructured":"Edmonds J (1965) Paths, trees, and flowers. Can JRL Math 17(3):449\u2013467","journal-title":"Can JRL Math"},{"issue":"1","key":"675_CR25","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BF01584082","volume":"1","author":"J Edmonds","year":"1971","unstructured":"Edmonds J (1971) Matroids and the greedy algorithm. Math Prog 1(1):127\u2013136","journal-title":"Math Prog"},{"key":"675_CR26","doi-asserted-by":"publisher","first-page":"147","DOI":"10.6028\/jres.069B.016","volume":"69B","author":"J Edmonds","year":"1965","unstructured":"Edmonds J, Fulkerson D (1965) Transversals and matroid partition. J Res Nat Bur Stand 69B:147\u2013153","journal-title":"J Res Nat Bur Stand"},{"key":"675_CR27","doi-asserted-by":"crossref","unstructured":"Edmonds J, Pruhs K (2006) Cake cutting really is not a piece of cake. In: SODA. Society for Industrial and Applied Mathematics, pp 271\u2013278","DOI":"10.1145\/1109557.1109588"},{"key":"675_CR28","doi-asserted-by":"crossref","unstructured":"Feldman M, Friedler SA, Moeller J, Scheidegger C, Venkatasubramanian S (2015) Certifying and removing disparate impact. In: KDD","DOI":"10.1145\/2783258.2783311"},{"issue":"1","key":"675_CR29","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1080\/00029890.1962.11989827","volume":"69","author":"D Gale","year":"1962","unstructured":"Gale D, Shapley LS (1962) College admissions and the stability of marriage. Am Math Mon 69(1):9\u201315","journal-title":"Am Math Mon"},{"issue":"1","key":"675_CR30","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1137\/0218003","volume":"18","author":"G Gallo","year":"1989","unstructured":"Gallo G, Grigoriadis MD, Tarjan RE (1989) A fast parametric maximum flow algorithm and applications. SIAM J Comput 18(1):30\u201355","journal-title":"SIAM J Comput"},{"issue":"3","key":"675_CR31","doi-asserted-by":"publisher","first-page":"1392","DOI":"10.1137\/100812513","volume":"42","author":"A Goel","year":"2013","unstructured":"Goel A, Kapralov M, Khanna S (2013) Perfect matchings in $$O(n\\,\\log n)$$ time in regular bipartite graphs. SIAM J Comput 42(3):1392\u20131404","journal-title":"SIAM J Comput"},{"issue":"5","key":"675_CR32","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1145\/290179.290181","volume":"45","author":"AV Goldberg","year":"1998","unstructured":"Goldberg AV, Rao S (1998) Beyond the flow decomposition barrier. J ACM 45(5):783\u2013797","journal-title":"J ACM"},{"issue":"4","key":"675_CR33","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1145\/48014.61051","volume":"35","author":"AV Goldberg","year":"1988","unstructured":"Goldberg AV, Tarjan RE (1988) A new approach to the maximum-flow problem. J ACM (JACM) 35(4):921\u2013940","journal-title":"J ACM (JACM)"},{"issue":"1","key":"675_CR34","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1112\/jlms\/s1-10.37.26","volume":"1","author":"P Hall","year":"1935","unstructured":"Hall P (1935) On representatives of subsets. JRL Lond Math Soc 1(1):26\u201330","journal-title":"JRL Lond Math Soc"},{"key":"675_CR35","unstructured":"Hardy GH, Littlewood JE, P\u00f3lya G (1952) Inequalities. CUP"},{"key":"675_CR36","unstructured":"Heidari H, Ferrari C, Gummadi KP, Krause A (2018) Fairness behind a veil of ignorance: a welfare analysis for automated decision making. In: Neural and information processing systems (NeurIPS)"},{"key":"675_CR37","doi-asserted-by":"crossref","unstructured":"Heidari H, Loi M, Gummadi KP, Krause A (2019) A moral framework for understanding of fair ml through economic models of equality of opportunity. In: ACM conference on fairness, accountability, and transparency (ACM FAT*)","DOI":"10.1145\/3287560.3287584"},{"issue":"1","key":"675_CR38","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/BF01583798","volume":"23","author":"T Ichimori","year":"1982","unstructured":"Ichimori T, Ishii H, Nishida T (1982) Optimal sharing. Math Program 23(1):341\u2013348","journal-title":"Math Program"},{"key":"675_CR39","unstructured":"Joseph M, Kearns M, Morgenstern JH, Roth A (2016) Fairness in learning: classic and contextual bandits. In: Advances in neural information processing systems, pp 325\u2013333"},{"issue":"1","key":"675_CR40","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1257\/aer.20101552","volume":"105","author":"Y Kamada","year":"2015","unstructured":"Kamada Y, Kojima F (2015) Efficient matching under distributional constraints: theory and applications. Am Econ Rev 105(1):67\u201399","journal-title":"Am Econ Rev"},{"issue":"1","key":"675_CR41","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10115-011-0463-8","volume":"33","author":"F Kamiran","year":"2011","unstructured":"Kamiran F, Calders T (2011) Data preprocessing techniques for classification without discrimination. Knowl Inf Syst 33(1):1\u201333","journal-title":"Knowl Inf Syst"},{"issue":"1","key":"675_CR42","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1287\/moor.10.1.44","volume":"10","author":"N Katoh","year":"1985","unstructured":"Katoh N, Ibaraki T, Mine H (1985) An algorithm for the equipollent resource allocation problem. Math Oper Res 10(1):44\u201353","journal-title":"Math Oper Res"},{"key":"675_CR43","doi-asserted-by":"crossref","unstructured":"Kearns M (2017) Fair algorithms for machine learning. In: EC","DOI":"10.1145\/3033274.3084096"},{"key":"675_CR44","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-90-481-9097-3_12","volume-title":"Handbook of group decision and negotiation","author":"C Klamler","year":"2010","unstructured":"Klamler C (2010) Fair division. In: Kilgour DM, Eden C (eds) Handbook of group decision and negotiation. Springer, Berlin, pp 183\u2013202"},{"key":"675_CR45","volume-title":"Combinatorial optimization: networks and matroids","author":"EL Lawler","year":"1976","unstructured":"Lawler EL (1976) Combinatorial optimization: networks and matroids. Courier Corporation, North Chelmsford"},{"key":"675_CR46","volume-title":"Matching theory","author":"L Lov\u00e1sz","year":"2009","unstructured":"Lov\u00e1sz L, Plummer M (2009) Matching theory. AMS Chelsea Publishing Series, North-Holland"},{"key":"675_CR47","doi-asserted-by":"crossref","unstructured":"McElfresh DC, Dickerson JP (2018) Balancing lexicographic fairness and a utilitarian objective with application to kidney exchange. In: Thirty-second AAAI conference on artificial intelligence","DOI":"10.1609\/aaai.v32i1.11436"},{"issue":"3","key":"675_CR48","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1090\/S0002-9904-1977-14298-5","volume":"83","author":"N Megiddo","year":"1977","unstructured":"Megiddo N (1977) A good algorithm for lexicographically optimal flows in multi-terminal networks. Bull Am Math Soc 83(3):407\u2013409","journal-title":"Bull Am Math Soc"},{"key":"675_CR49","doi-asserted-by":"crossref","unstructured":"Pedreschi D, Ruggieri S, Turini F (2008) Discrimination-aware data mining. In: KDD","DOI":"10.1145\/1401890.1401959"},{"key":"675_CR50","volume-title":"Combinatorial optimization II. Mathematical programming studies","author":"JC Picard","year":"1980","unstructured":"Picard JC, Queyranne M (1980) On the structure of all minimum cuts in a network and applications. In: Rayward-Smith VJ (ed) Combinatorial optimization II. Mathematical programming studies, vol 13. Springer, Berlin, Heidelberg"},{"key":"675_CR51","doi-asserted-by":"crossref","DOI":"10.4159\/9780674042605","volume-title":"A theory of justice","author":"J Rawls","year":"1971","unstructured":"Rawls J (1971) A theory of justice. Harvard University Press, Cambridge"},{"issue":"2","key":"675_CR52","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.jet.2005.04.004","volume":"125","author":"AE Roth","year":"2005","unstructured":"Roth AE, S\u00f6nmez T, \u00dcnver MU (2005) Pairwise kidney exchange. J Econ Theory 125(2):151\u2013188","journal-title":"J Econ Theory"},{"issue":"4","key":"675_CR53","doi-asserted-by":"publisher","first-page":"874","DOI":"10.1287\/moor.23.4.874","volume":"23","author":"CP Teo","year":"1998","unstructured":"Teo CP, Sethuraman J (1998) The geometry of fractional stable matchings and its applications. Math Oper Res 23(4):874\u2013891","journal-title":"Math Oper Res"},{"issue":"2","key":"675_CR54","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/0893-9659(92)90103-G","volume":"5","author":"E Triesch","year":"1992","unstructured":"Triesch E (1992) A short proof that matching matroids are transversal. Appli Math Lett 5(2):19\u201320","journal-title":"Appli Math Lett"},{"key":"675_CR55","doi-asserted-by":"crossref","unstructured":"Zliobaite I, Kamiran F, Calders T (2011) Handling conditional discrimination. In: ICDM","DOI":"10.1109\/ICDM.2011.72"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-020-00675-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10618-020-00675-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-020-00675-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,14]],"date-time":"2022-10-14T09:27:49Z","timestamp":1665739669000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10618-020-00675-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,4]]},"references-count":55,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["675"],"URL":"https:\/\/doi.org\/10.1007\/s10618-020-00675-y","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,2,4]]},"assertion":[{"value":"21 January 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 January 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 February 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}