{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T17:51:22Z","timestamp":1781891482069,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,4,19]],"date-time":"2021-04-19T00:00:00Z","timestamp":1618790400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,4,19]]},"DOI":"10.1145\/3442381.3449901","type":"proceedings-article","created":{"date-parts":[[2021,6,3]],"date-time":"2021-06-03T19:02:07Z","timestamp":1622746927000},"page":"137-145","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":35,"title":["Maximizing Marginal Fairness for Dynamic Learning to Rank"],"prefix":"10.1145","author":[{"given":"Tao","family":"Yang","sequence":"first","affiliation":[{"name":"University of Utah, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qingyao","family":"Ai","sequence":"additional","affiliation":[{"name":"University of Utah, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,6,3]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3331184.3331202"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3289600.3291017"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3209978.3209986"},{"key":"e_1_3_2_1_4_1","unstructured":"Qingyao Ai Tao Yang Huazheng Wang and Jiaxin Mao. 2020. Unbiased Learning to Rank: Online or Offline?arXiv preprint arXiv:2004.13574(2020).  Qingyao Ai Tao Yang Huazheng Wang and Jiaxin Mao. 2020. Unbiased Learning to Rank: Online or Offline?arXiv preprint arXiv:2004.13574(2020)."},{"key":"e_1_3_2_1_5_1","volume-title":"The 41st international acm sigir conference on research & development in information retrieval. 405\u2013414.","author":"Biega J","unstructured":"Asia\u00a0 J Biega , Krishna\u00a0 P Gummadi , and Gerhard Weikum . 2018. Equity of attention: Amortizing individual fairness in rankings . In The 41st international acm sigir conference on research & development in information retrieval. 405\u2013414. Asia\u00a0J Biega, Krishna\u00a0P Gummadi, and Gerhard Weikum. 2018. Equity of attention: Amortizing individual fairness in rankings. In The 41st international acm sigir conference on research & development in information retrieval. 405\u2013414."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/290941.291025"},{"key":"e_1_3_2_1_7_1","volume-title":"45th International Colloquium on Automata, Languages, and Programming (ICALP","author":"Celis L\u00a0Elisa","year":"2018","unstructured":"L\u00a0Elisa Celis , Damian Straszak , and Nisheeth\u00a0 K Vishnoi . 2018 . Ranking with Fairness Constraints. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik. L\u00a0Elisa Celis, Damian Straszak, and Nisheeth\u00a0K Vishnoi. 2018. Ranking with Fairness Constraints. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1341531.1341545"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390334.1390392"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"F\u00a0Maxwell Harper and Joseph\u00a0A Konstan. 2015. The movielens datasets: History and context. Acm transactions on interactive intelligent systems (tiis) 5 4(2015) 1\u201319.  F\u00a0Maxwell Harper and Joseph\u00a0A Konstan. 2015. The movielens datasets: History and context. Acm transactions on interactive intelligent systems (tiis) 5 4(2015) 1\u201319.","DOI":"10.1145\/2827872"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3077136.3080805"},{"key":"e_1_3_2_1_12_1","unstructured":"Jiarui Jin Yuchen Fang Weinan Zhang Kan Ren Guorui Zhou Jian Xu Yong Yu Jun Wang Xiaoqiang Zhu and Kun Gai. 2020. A Deep Recurrent Survival Model for Unbiased Ranking. arXiv preprint arXiv:2004.14714(2020).  Jiarui Jin Yuchen Fang Weinan Zhang Kan Ren Guorui Zhou Jian Xu Yong Yu Jun Wang Xiaoqiang Zhu and Kun Gai. 2020. A Deep Recurrent Survival Model for Unbiased Ranking. arXiv preprint arXiv:2004.14714(2020)."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775067"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1076034.1076063"},{"key":"e_1_3_2_1_15_1","volume-title":"ACM SIGIR Forum, Vol.\u00a051.","author":"Joachims Thorsten","unstructured":"Thorsten Joachims , Laura Granka , Bing Pan , Helene Hembrooke , and Geri Gay . 2017. Accurately interpreting clickthrough data as implicit feedback . In ACM SIGIR Forum, Vol.\u00a051. Acm New York, NY, USA , 4\u201311. Thorsten Joachims, Laura Granka, Bing Pan, Helene Hembrooke, and Geri Gay. 2017. Accurately interpreting clickthrough data as implicit feedback. In ACM SIGIR Forum, Vol.\u00a051. Acm New York, NY, USA, 4\u201311."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1229179.1229181"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3018661.3018699"},{"key":"e_1_3_2_1_18_1","volume-title":"Learning to rank for information retrieval","author":"Liu Tie-Yan","unstructured":"Tie-Yan Liu . 2011. Learning to rank for information retrieval . Springer Science & Business Media . Tie-Yan Liu. 2011. Learning to rank for information retrieval. Springer Science & Business Media."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3121050.3121096"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401100"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380255"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/1597348.1597412"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Stephen\u00a0E Robertson. 1977. The probability ranking principle in IR. Journal of documentation(1977).  Stephen\u00a0E Robertson. 1977. The probability ranking principle in IR. Journal of documentation(1977).","DOI":"10.1108\/eb026647"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1561\/1500000040"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220088"},{"key":"e_1_3_2_1_26_1","unstructured":"Ashudeep Singh and Thorsten Joachims. 2019. Policy learning for fairness in ranking. In Advances in Neural Information Processing Systems. 5426\u20135436.  Ashudeep Singh and Thorsten Joachims. 2019. Policy learning for fairness in ranking. In Advances in Neural Information Processing Systems. 5426\u20135436."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484028.2484036"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2911451.2911537"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3159652.3159732"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2766462.2767710"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3077136.3080775"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3085504.3085526"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772793"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132847.3132938"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3366424.3380048"}],"event":{"name":"WWW '21: The Web Conference 2021","location":"Ljubljana Slovenia","acronym":"WWW '21","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Proceedings of the Web Conference 2021"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3442381.3449901","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3442381.3449901","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:24:31Z","timestamp":1750195471000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3442381.3449901"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,19]]},"references-count":35,"alternative-id":["10.1145\/3442381.3449901","10.1145\/3442381"],"URL":"https:\/\/doi.org\/10.1145\/3442381.3449901","relation":{},"subject":[],"published":{"date-parts":[[2021,4,19]]},"assertion":[{"value":"2021-06-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}