{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T10:13:06Z","timestamp":1770459186885,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":41,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,2,11]],"date-time":"2022-02-11T00:00:00Z","timestamp":1644537600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"ANR","award":["ANR-19-P3IA-0003"],"award-info":[{"award-number":["ANR-19-P3IA-0003"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,2,11]]},"DOI":"10.1145\/3488560.3498490","type":"proceedings-article","created":{"date-parts":[[2022,2,15]],"date-time":"2022-02-15T21:42:57Z","timestamp":1644961377000},"page":"498-507","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Introducing the Expohedron for Efficient Pareto-optimal Fairness-Utility Amortizations in Repeated Rankings"],"prefix":"10.1145","author":[{"given":"Till","family":"Kletti","sequence":"first","affiliation":[{"name":"Naver Labs Europe, Meylan, France"}]},{"given":"Jean-Michel","family":"Renders","sequence":"additional","affiliation":[{"name":"Naver Labs Europe, Meylan, France"}]},{"given":"Patrick","family":"Loiseau","sequence":"additional","affiliation":[{"name":"Univ. Grenoble Alpes, Inria, CNRS, Grenoble INP, LIG, Grenoble, France"}]}],"member":"320","published-online":{"date-parts":[[2022,2,15]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Overview of the TREC 2020 Fair Ranking Track. In The Twenty-Eighth Text REtrieval Conference (TREC 2020) Proceedings .","author":"Biega Asia J.","year":"2020","unstructured":"Asia J. Biega, Fernando Diaz, Michael D. Ekstrand, and Sebastian Kohlmeier. 2020. Overview of the TREC 2020 Fair Ranking Track. In The Twenty-Eighth Text REtrieval Conference (TREC 2020) Proceedings ."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3209978.3210063"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01449883"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526711"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-02294-4"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3411962"},{"key":"e_1_3_2_2_7_1","volume-title":"Online certification of preference-based fairness for personalized recommender systems. arXiv:2104.14527 [cs, stat] (April","author":"Do Virginie","year":"2021","unstructured":"Virginie Do, Sam Corbett-Davies, Jamal Atif, and Nicolas Usunier. 2021. Online certification of preference-based fairness for personalized recommender systems. arXiv:2104.14527 [cs, stat] (April 2021). arXiv: 2104.14527."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2016.02.023"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090255"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330691"},{"key":"e_1_3_2_2_11_1","volume-title":"Geometric Algorithms and Combinatorial Optimization 2 ed.)","author":"Gr\u00f6tschel Martin","unstructured":"Martin Gr\u00f6tschel, L\u00e1szl\u00f3 Lov\u00e1sz, and Alexander Schrijver. 1993. Geometric Algorithms and Combinatorial Optimization 2 ed.). Springer-Verlag, Berlin Heidelberg."},{"key":"e_1_3_2_2_12_1","volume-title":"Discrete Applied Mathematics","volume":"215","author":"Hoeksma Ruben","year":"2016","unstructured":"Ruben Hoeksma, Bodo Manthey, and Marc Uetz. 2016. Efficient implementation of Carath\u00e9odory's theorem for the single machine scheduling polytope. Discrete Applied Mathematics , Vol. 215 (Dec. 2016), 136--145."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/582415.582418"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1093\/qmath\/10.1.296"},{"key":"e_1_3_2_2_15_1","volume-title":"Arnold","author":"Marshall Albert W.","year":"2011","unstructured":"Albert W. Marshall, Ingram Olkin, and Barry C. Arnold. 2011. Inequalities: Theory of Majorization and Its Applications. Springer New York, New York, NY."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1416950.1416952"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401100"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5970"},{"key":"e_1_3_2_2_19_1","volume-title":"Perron and Frobenius meet Carath\u00e9odory . arXiv:1901","author":"Nasz\u00f3di M\u00e1rton","year":"2019","unstructured":"M\u00e1rton Nasz\u00f3di and Alexandr Polyanskii. 2019. Perron and Frobenius meet Carath\u00e9odory . arXiv:1901.00540 [math] (Jan. 2019). arXiv: 1901.00540."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(93)90086-N"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3462830"},{"key":"e_1_3_2_2_22_1","volume-title":"Fairness in rankings and recommendations: an overview. The VLDB Journal (Oct","author":"Pitoura Evaggelia","year":"2021","unstructured":"Evaggelia Pitoura, Kostas Stefanidis, and Georgia Koutrika. 2021. Fairness in rankings and recommendations: an overview. The VLDB Journal (Oct. 2021)."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.2307\/2346567"},{"key":"e_1_3_2_2_24_1","volume-title":"abs\/1306.2597","author":"Qin Tao","year":"2013","unstructured":"Tao Qin and Tie-Yan Liu. 2013. Introducing LETOR 4.0 Datasets. CoRR , Vol. abs\/1306.2597 (2013). http:\/\/arxiv.org\/abs\/1306.2597"},{"key":"e_1_3_2_2_25_1","volume-title":"Journal of the London Mathematical Society","author":"Rado R.","year":"1952","unstructured":"R. Rado. 1952. An Inequality . Journal of the London Mathematical Society , Vol. s1--27, 1 (1952), 1--6."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1108\/eb026647"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3319901"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2003.11.021"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220088"},{"key":"e_1_3_2_2_30_1","volume-title":"Garnett (Eds.)","volume":"32","author":"Singh Ashudeep","year":"2019","unstructured":"Ashudeep Singh and Thorsten Joachims. 2019. Policy Learning for Fairness in Ranking. In Advances in Neural Information Processing Systems, H. Wallach, H. Larochelle, A. Beygelzimer, F. d'Alch\u00e9 Buc, E. Fox, and R. Garnett (Eds.), Vol. 32. Curran Associates, Inc."},{"key":"e_1_3_2_2_31_1","volume-title":"Fairness in Ranking under Uncertainty . arXiv:2107.06720 [cs] (July","author":"Singh Ashudeep","year":"2021","unstructured":"Ashudeep Singh, David Kempe, and Thorsten Joachims. 2021. Fairness in Ranking under Uncertainty . arXiv:2107.06720 [cs] (July 2021). arXiv: 2107.06720."},{"key":"e_1_3_2_2_32_1","volume-title":"Optimizing Rankings for Recommendation in Matching Markets . arXiv:2106.01941 [cs] (June","author":"Su Yi","year":"2021","unstructured":"Yi Su, Magd Bayoumi, and Thorsten Joachims. 2021. Optimizing Rankings for Recommendation in Matching Markets . arXiv:2106.01941 [cs] (June 2021). arXiv: 2106.01941."},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401292"},{"key":"e_1_3_2_2_34_1","unstructured":"Brandon Trabucco. 2021. brandontrabucco\/bvn. https:\/\/github.com\/brandontrabucco\/bvn original-date: 2020-09--15T00:11:02Z."},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.36045\/bbms\/1074791332"},{"key":"e_1_3_2_2_37_1","volume-title":"Fairness of Exposure in Stochastic Bandits . arXiv:2103.02735 [cs] (March","author":"Wang Lequn","year":"2021","unstructured":"Lequn Wang, Yiwei Bai, Wen Sun, and Thorsten Joachims. 2021. Fairness of Exposure in Stochastic Bandits . arXiv:2103.02735 [cs] (March 2021). arXiv: 2103.02735."},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3471158.3472260"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3462882"},{"key":"e_1_3_2_2_40_1","volume-title":"Algorithms and Computation (Lecture Notes in Computer Science ), , Takao Asano, Shin-ichi Nakano","author":"Yasutake Shota","unstructured":"Shota Yasutake, Kohei Hatano, Shuji Kijima, Eiji Takimoto, and Masayuki Takeda. 2011. Online Linear Optimization over Permutations. In Algorithms and Computation (Lecture Notes in Computer Science ), , Takao Asano, Shin-ichi Nakano, Yoshio Okamoto, and Osamu Watanabe (Eds.). Springer, Berlin, Heidelberg, 534--543."},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132847.3132938"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/3366424.3380048"}],"event":{"name":"WSDM '22: The Fifteenth ACM International Conference on Web Search and Data Mining","location":"Virtual Event AZ USA","acronym":"WSDM '22","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the Fifteenth ACM International Conference on Web Search and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3488560.3498490","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3488560.3498490","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:31:19Z","timestamp":1750188679000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3488560.3498490"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,11]]},"references-count":41,"alternative-id":["10.1145\/3488560.3498490","10.1145\/3488560"],"URL":"https:\/\/doi.org\/10.1145\/3488560.3498490","relation":{},"subject":[],"published":{"date-parts":[[2022,2,11]]},"assertion":[{"value":"2022-02-15","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}