{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,24]],"date-time":"2025-08-24T01:25:41Z","timestamp":1755998741963,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":36,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,6,10]],"date-time":"2022-06-10T00:00:00Z","timestamp":1654819200000},"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":["1942913, 2007935, 1814595, 2118458"],"award-info":[{"award-number":["1942913, 2007935, 1814595, 2118458"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N000141812838, N000142112966"],"award-info":[{"award-number":["N000141812838, N000142112966"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,6,10]]},"DOI":"10.1145\/3514221.3517865","type":"proceedings-article","created":{"date-parts":[[2022,6,12]],"date-time":"2022-06-12T02:33:49Z","timestamp":1655001229000},"page":"262-275","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["Rank Aggregation with Proportionate Fairness"],"prefix":"10.1145","author":[{"given":"Dong","family":"Wei","sequence":"first","affiliation":[{"name":"New Jersey Institute of Technology, Newark, NJ, USA"}]},{"given":"Md Mouinul","family":"Islam","sequence":"additional","affiliation":[{"name":"New Jersey Institute of Technology, Newark, NJ, USA"}]},{"given":"Baruch","family":"Schieber","sequence":"additional","affiliation":[{"name":"New Jersey Institute of Technology, Newark, NJ, USA"}]},{"given":"Senjuti","family":"Basu Roy","sequence":"additional","affiliation":[{"name":"New Jersey Institute of Technology, Newark, NJ, USA"}]}],"member":"320","published-online":{"date-parts":[[2022,6,11]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"35th International Symposium on Computational Geometry (SoCG","author":"Agrawal Akanksha","year":"2019","unstructured":"Akanksha Agrawal, Grzegorz Guspiel, Jayakrishnan Madathil, Saket Saurabh, and Meirav Zehavi. 2019. Connecting the dots (with minimum crossings). In 35th International Symposium on Computational Geometry (SoCG 2019). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-008-9211-1"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1411509.1411513"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1086\/256963"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3300079"},{"key":"e_1_3_2_2_6_1","unstructured":"Pieter Cornelis Baayen and Z Hedrlin. 1964. On the existence of well distributed sequences in compact spaces. Stichting Mathematisch Centrum. Zuivere Wiskunde."},{"key":"e_1_3_2_2_7_1","volume-title":"Voting schemes for which it can be difficult to tell who won the election. Social Choice and welfare 6, 2","author":"Bartholdi John","year":"1989","unstructured":"John Bartholdi, Craig A Tovey, and Michael A Trick. 1989. Voting schemes for which it can be difficult to tell who won the election. Social Choice and welfare 6, 2 (1989), 157--165."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01940883"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(97)00149-X"},{"key":"e_1_3_2_2_10_1","unstructured":"JC de Borda. 1784. M\u00e9moire sur les \u00e9lections au scrutin. Histoire de l'Academie Royale des Sciences pour 1781 (Paris 1784) (1784)."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.14778\/2809974.2809982"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74456-6_37"},{"key":"e_1_3_2_2_13_1","volume-title":"Ranking with fairness constraints. arXiv preprint arXiv:1704.06840","author":"Celis L Elisa","year":"2017","unstructured":"L Elisa Celis, Damian Straszak, and Nisheeth K Vishnoi. 2017. Ranking with fairness constraints. arXiv preprint arXiv:1704.06840 (2017)."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2015.02.014"},{"key":"e_1_3_2_2_15_1","volume-title":"The frontiers of fairness in machine learning. arXiv preprint arXiv:1810.08810","author":"Chouldechova Alexandra","year":"2018","unstructured":"Alexandra Chouldechova and Aaron Roth. 2018. The frontiers of fairness in machine learning. arXiv preprint arXiv:1810.08810 (2018)."},{"key":"e_1_3_2_2_16_1","first-page":"620","article-title":"Improved bounds for computing Kemeny rankings","volume":"6","author":"Conitzer Vincent","year":"2006","unstructured":"Vincent Conitzer, Andrew Davenport, and Jayant Kalagnanam. 2006. Improved bounds for computing Kemeny rankings. In AAAI, Vol. 6. 620--626.","journal-title":"AAAI"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517-6161.1977.tb01624.x"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090255"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/371920.372165"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/05063088X"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0531(70)90015-3"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330691"},{"key":"e_1_3_2_2_23_1","first-page":"577","article-title":"Mathematics without numbers","volume":"88","author":"Kemeny John G","year":"1959","unstructured":"John G Kemeny. 1959. Mathematics without numbers. Daedalus 88, 4 (1959), 577--591.","journal-title":"Daedalus"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/30.1-2.81"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.14778\/3407790.3407855"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/44.1-2.114"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(93)90090-B"},{"key":"e_1_3_2_2_28_1","volume-title":"Impossible by design? Fairness, strategy, and Arrow's impossibility theorem. Design Science 3","author":"McComb Christopher","year":"2017","unstructured":"Christopher McComb, Kosa Goucher-Lambert, and Jonathan Cagan. 2017. Impossible by design? Fairness, strategy, and Arrow's impossibility theorem. Design Science 3 (2017)."},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01560577"},{"volume-title":"Encyclopedia of mathematics. Facts On File, inc","author":"Tanton James","key":"e_1_3_2_2_30_1","unstructured":"James Tanton. 2005. Encyclopedia of mathematics. Facts On File, inc."},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(80)90269-1"},{"key":"e_1_3_2_2_32_1","volume-title":"International Workshop on Approximation and Online Algorithms. Springer, 260--273","author":"Zuylen Anke Van","year":"2007","unstructured":"Anke Van Zuylen and David P Williamson. 2007. Deterministic algorithms for rank aggregation and other ranking and clustering problems. In International Workshop on Approximation and Online Algorithms. Springer, 260--273."},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1090.0385"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3085504.3085526"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1257\/jep.9.1.51"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132847.3132938"}],"event":{"name":"SIGMOD\/PODS '22: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"Philadelphia PA USA","acronym":"SIGMOD\/PODS '22"},"container-title":["Proceedings of the 2022 International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3514221.3517865","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3514221.3517865","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3514221.3517865","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:30:36Z","timestamp":1750188636000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3514221.3517865"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,10]]},"references-count":36,"alternative-id":["10.1145\/3514221.3517865","10.1145\/3514221"],"URL":"https:\/\/doi.org\/10.1145\/3514221.3517865","relation":{},"subject":[],"published":{"date-parts":[[2022,6,10]]},"assertion":[{"value":"2022-06-11","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}