{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T06:48:09Z","timestamp":1762325289697,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,4,25]],"date-time":"2022-04-25T00:00:00Z","timestamp":1650844800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2007164, 2133169, and 2112533"],"award-info":[{"award-number":["2007164, 2133169, and 2112533"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007126","name":"Syracuse University","doi-asserted-by":"publisher","award":["II-37-2021"],"award-info":[{"award-number":["II-37-2021"]}],"id":[{"id":"10.13039\/100007126","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,4,25]]},"DOI":"10.1145\/3485447.3512247","type":"proceedings-article","created":{"date-parts":[[2022,4,25]],"date-time":"2022-04-25T05:11:23Z","timestamp":1650863483000},"page":"3520-3530","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["End-to-End Learning for Fair Ranking Systems"],"prefix":"10.1145","author":[{"given":"James","family":"Kotary","sequence":"first","affiliation":[{"name":"Syracuse University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ferdinando","family":"Fioretto","sequence":"additional","affiliation":[{"name":"Syracuse University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascal","family":"Van Hentenryck","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ziwei","family":"Zhu","sequence":"additional","affiliation":[{"name":"Texas A&M University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,4,25]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Proceedings of the International Conference on Machine Learning (ICML).","author":"Agarwal Alekh","year":"2018","unstructured":"Alekh Agarwal, Alina Beygelzimer, Miroslav Dudik, John Langford, and Hanna Wallach. 2018. A Reductions Approach to Fair Classification. In Proceedings of the International Conference on Machine Learning (ICML)."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Aman Agarwal Ivan Zaitsev Xuanhui Wang Cheng Li Marc Najork and Thorsten Joachims. 2019. Estimating Position Bias without Intrusive Interventions. In WSDM. 474\u2013482.","DOI":"10.1145\/3289600.3291017"},{"volume-title":"Linear programming and network flows","author":"Bazaraa S","key":"e_1_3_2_1_3_1","unstructured":"Mokhtar\u00a0S Bazaraa, John\u00a0J Jarvis, and Hanis\u00a0D Sherali. 2008. Linear programming and network flows. John Wiley & Sons."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Garrett Birkhoff. 1940. Lattice theory. Vol.\u00a025. American Mathematical Soc.","DOI":"10.1090\/coll\/025"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273513"},{"key":"e_1_3_2_1_6_1","unstructured":"L\u00a0Elisa Celis Damian Straszak and Nisheeth\u00a0K Vishnoi. 2017. Ranking with fairness constraints. arXiv preprint arXiv:1704.06840(2017)."},{"key":"e_1_3_2_1_7_1","volume-title":"22nd International Conference on Extending Database Technology (EDBT).","author":"Elbassuoni Shady","year":"2019","unstructured":"Shady Elbassuoni, Sihem Amer-Yahia, Ahmad Ghizzawi, and Christine Atie. 2019. Exploring fairness of ranking in online job marketplaces. In 22nd International Conference on Extending Database Technology (EDBT)."},{"key":"e_1_3_2_1_8_1","volume-title":"\u201cpredict, then optimize\u201d. Management Science","author":"Elmachtoub N","year":"2021","unstructured":"Adam\u00a0N Elmachtoub and Paul Grigas. 2021. Smart \u201cpredict, then optimize\u201d. Management Science (2021)."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Zhichong Fang Aman Agarwal and Thorsten Joachims. 2019. Intervention Harvesting for Context-Dependent Examination-Bias Estimation. In SIGIR. 825\u2013834.","DOI":"10.1145\/3331184.3331238"},{"key":"e_1_3_2_1_10_1","volume-title":"Lagrangian Duality for Constrained Deep Learning. In Machine Learning and Knowledge Discovery in Databases - European Conference, ECML PKDD, Vol.\u00a012461","author":"Fioretto Ferdinando","year":"2020","unstructured":"Ferdinando Fioretto, Pascal\u00a0Van Hentenryck, Terrence W.\u00a0K. Mak, Cuong Tran, Federico Baldo, and Michele Lombardi. 2020. Lagrangian Duality for Constrained Deep Learning. In Machine Learning and Knowledge Discovery in Databases - European Conference, ECML PKDD, Vol.\u00a012461. Springer, 118\u2013135."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Thorsten Joachims Adith Swaminathan and Tobias Schnabel. 2017. Unbiased Learning-to-Rank with Biased Feedback. In WSDM. 781\u2013789.","DOI":"10.1145\/3018661.3018699"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021\/610"},{"key":"e_1_3_2_1_13_1","unstructured":"Heyuan Liu and Paul Grigas. 2021. Risk bounds and calibration for a smart predict-then-optimize method. arXiv preprint arXiv:2108.08887(2021)."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i02.5521"},{"key":"e_1_3_2_1_15_1","unstructured":"Laurent Perron and Vincent Furnon. [n. d.]. OR-Tools. Google. https:\/\/developers.google.com\/optimization\/"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220088"},{"key":"e_1_3_2_1_17_1","unstructured":"Ashudeep Singh and Thorsten Joachims. 2019. Policy learning for fairness in ranking. arXiv preprint arXiv:1902.04056(2019)."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.16"},{"key":"e_1_3_2_1_19_1","volume":"199","author":"Ronald\u00a0","unstructured":"Ronald\u00a0J Williams. 1992. Simple statistical gradient-following algorithms for connectionist reinforcement learning. Machine learning 8, 3 (1992), 229\u2013256.","journal-title":"J Williams."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3462953"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132847.3132938"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3366424.3380048"}],"event":{"name":"WWW '22: The ACM Web Conference 2022","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"],"location":"Virtual Event, Lyon France","acronym":"WWW '22"},"container-title":["Proceedings of the ACM Web Conference 2022"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3485447.3512247","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3485447.3512247","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3485447.3512247","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:30:14Z","timestamp":1750188614000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3485447.3512247"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,25]]},"references-count":22,"alternative-id":["10.1145\/3485447.3512247","10.1145\/3485447"],"URL":"https:\/\/doi.org\/10.1145\/3485447.3512247","relation":{},"subject":[],"published":{"date-parts":[[2022,4,25]]},"assertion":[{"value":"2022-04-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}