{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T04:57:27Z","timestamp":1780721847104,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":50,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,10,30]],"date-time":"2023-10-30T00:00:00Z","timestamp":1698624000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["OAC-2018627,CCF-2028944,CNS-2112471"],"award-info":[{"award-number":["OAC-2018627,CCF-2028944,CNS-2112471"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,10,30]]},"DOI":"10.1145\/3617694.3623231","type":"proceedings-article","created":{"date-parts":[[2023,10,29]],"date-time":"2023-10-29T15:52:11Z","timestamp":1698594731000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["FairMILE: Towards an Efficient Framework for Fair Graph Representation Learning"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1365-1772","authenticated-orcid":false,"given":"Yuntian","family":"He","sequence":"first","affiliation":[{"name":"The Ohio State University, United States"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1699-5714","authenticated-orcid":false,"given":"Saket","family":"Gurukar","sequence":"additional","affiliation":[{"name":"Samsung Research America, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6062-6449","authenticated-orcid":false,"given":"Srinivasan","family":"Parthasarathy","sequence":"additional","affiliation":[{"name":"The Ohio State University, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,10,30]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"Chirag Agarwal Himabindu Lakkaraju and Marinka Zitnik. 2021. Towards a unified framework for fair and stable graph representation learning. In Uncertainty in Artificial Intelligence. PMLR 2114\u20132124. Chirag Agarwal Himabindu Lakkaraju and Marinka Zitnik. 2021. Towards a unified framework for fair and stable graph representation learning. In Uncertainty in Artificial Intelligence. PMLR 2114\u20132124."},{"key":"e_1_3_2_2_2_1","volume-title":"GOSH: Embedding big graphs on small hardware. In ICPP. 1\u201311.","author":"Akyildiz Taha\u00a0Atahan","year":"2020","unstructured":"Taha\u00a0Atahan Akyildiz , Amro\u00a0Alabsi Aljundi , and Kamer Kaya . 2020 . GOSH: Embedding big graphs on small hardware. In ICPP. 1\u201311. Taha\u00a0Atahan Akyildiz, Amro\u00a0Alabsi Aljundi, and Kamer Kaya. 2020. GOSH: Embedding big graphs on small hardware. In ICPP. 1\u201311."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"crossref","unstructured":"Abolfazl Asudeh HV Jagadish Julia Stoyanovich and Gautam Das. 2019. Designing fair ranking schemes. In SIGMOD. 1259\u20131276. Abolfazl Asudeh HV Jagadish Julia Stoyanovich and Gautam Das. 2019. Designing fair ranking schemes. In SIGMOD. 1259\u20131276.","DOI":"10.1145\/3299869.3300079"},{"key":"e_1_3_2_2_4_1","unstructured":"Tolga Bolukbasi Kai-Wei Chang James\u00a0Y Zou Venkatesh Saligrama and Adam\u00a0Tauman Kalai. 2016. Man is to Computer Programmer as Woman is to Homemaker? Debiasing Word Embeddings. In NeurIPS Vol.\u00a029. Tolga Bolukbasi Kai-Wei Chang James\u00a0Y Zou Venkatesh Saligrama and Adam\u00a0Tauman Kalai. 2016. Man is to Computer Programmer as Woman is to Homemaker? Debiasing Word Embeddings. In NeurIPS Vol.\u00a029."},{"key":"e_1_3_2_2_5_1","volume-title":"International Conference on Machine Learning. PMLR, 715\u2013724","author":"Bose Avishek","year":"2019","unstructured":"Avishek Bose and William Hamilton . 2019 . Compositional fairness constraints for graph embeddings . In International Conference on Machine Learning. PMLR, 715\u2013724 . Avishek Bose and William Hamilton. 2019. Compositional fairness constraints for graph embeddings. In International Conference on Machine Learning. PMLR, 715\u2013724."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11849"},{"key":"e_1_3_2_2_7_1","volume-title":"Efficient Candidate Screening Under Multiple Tests and Implications for Fairness. In 1st Symposium on Foundations of Responsible Computing, FORC","author":"Cohen Lee","year":"2020","unstructured":"Lee Cohen , Zachary\u00a0 C. Lipton , and Yishay Mansour . 2020 . Efficient Candidate Screening Under Multiple Tests and Implications for Fairness. In 1st Symposium on Foundations of Responsible Computing, FORC 2020, Vol.\u00a0156. 1:1\u20131:20. Lee Cohen, Zachary\u00a0C. Lipton, and Yishay Mansour. 2020. Efficient Candidate Screening Under Multiple Tests and Implications for Fairness. In 1st Symposium on Foundations of Responsible Computing, FORC 2020, Vol.\u00a0156. 1:1\u20131:20."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2849727"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"crossref","unstructured":"Sean Current Yuntian He Saket Gurukar and Srinivasan Parthasarathy. 2022. FairEGM: Fair Link Prediction and Recommendation via Emulated Graph Modification. In Equity and Access in Algorithms Mechanisms and Optimization. 1\u201314. Sean Current Yuntian He Saket Gurukar and Srinivasan Parthasarathy. 2022. FairEGM: Fair Link Prediction and Recommendation via Emulated Graph Modification. In Equity and Access in Algorithms Mechanisms and Optimization. 1\u201314.","DOI":"10.1145\/3551624.3555287"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"crossref","unstructured":"Enyan Dai and Suhang Wang. 2021. Say no to the discrimination: Learning fair graph neural networks with limited sensitive attribute information. In WSDM. 680\u2013688. Enyan Dai and Suhang Wang. 2021. Say no to the discrimination: Learning fair graph neural networks with limited sensitive attribute information. In WSDM. 680\u2013688.","DOI":"10.1145\/3437963.3441752"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512173"},{"key":"e_1_3_2_2_12_1","volume-title":"Fairness in Graph Mining: A Survey. arXiv preprint arXiv:2204.09888","author":"Dong Yushun","year":"2022","unstructured":"Yushun Dong , Jing Ma , Chen Chen , and Jundong Li. 2022. Fairness in Graph Mining: A Survey. arXiv preprint arXiv:2204.09888 ( 2022 ). Yushun Dong, Jing Ma, Chen Chen, and Jundong Li. 2022. Fairness in Graph Mining: A Survey. arXiv preprint arXiv:2204.09888 (2022)."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090255"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313488"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"crossref","unstructured":"Zuohui Fu Yikun Xian Ruoyuan Gao Jieyu Zhao Qiaoying Huang Yingqiang Ge Shuyuan Xu Shijie Geng Chirag Shah Yongfeng Zhang 2020. Fairness-aware explainable recommendation over knowledge graphs. In SIGIR. 69\u201378. Zuohui Fu Yikun Xian Ruoyuan Gao Jieyu Zhao Qiaoying Huang Yingqiang Ge Shuyuan Xu Shijie Geng Chirag Shah Yongfeng Zhang 2020. Fairness-aware explainable recommendation over knowledge graphs. In SIGIR. 69\u201378.","DOI":"10.1145\/3397271.3401051"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.14778\/3574245.3574262"},{"key":"e_1_3_2_2_18_1","volume-title":"Benchmarking and Analyzing Unsupervised Network Representation Learning and the Illusion of Progress. Transactions on Machine Learning Research","author":"Gurukar Saket","year":"2022","unstructured":"Saket Gurukar , Priyesh Vijayan , Balaraman Ravindran , Aakash Srinivasan , Goonmeet Bajaj , Chen Cai , Moniba Keymanesh , Saravana Kumar , Pranav Maneriker , Anasua Mitra , 2022. Benchmarking and Analyzing Unsupervised Network Representation Learning and the Illusion of Progress. Transactions on Machine Learning Research ( 2022 ). Saket Gurukar, Priyesh Vijayan, Balaraman Ravindran, Aakash Srinivasan, Goonmeet Bajaj, Chen Cai, Moniba Keymanesh, Saravana Kumar, Pranav Maneriker, Anasua Mitra, 2022. Benchmarking and Analyzing Unsupervised Network Representation Learning and the Illusion of Progress. Transactions on Machine Learning Research (2022)."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/3294771.3294869"},{"key":"e_1_3_2_2_20_1","volume-title":"DistMILE: A Distributed Multi-Level Framework for Scalable Graph Embedding","author":"He Yuntian","unstructured":"Yuntian He , Saket Gurukar , Pouya Kousha , Hari Subramoni , Dhabaleswar\u00a0 K Panda , and Srinivasan Parthasarathy . 2021. DistMILE: A Distributed Multi-Level Framework for Scalable Graph Embedding . In HiPC. IEEE , 282\u2013291. Yuntian He, Saket Gurukar, Pouya Kousha, Hari Subramoni, Dhabaleswar\u00a0K Panda, and Srinivasan Parthasarathy. 2021. DistMILE: A Distributed Multi-Level Framework for Scalable Graph Embedding. In HiPC. IEEE, 282\u2013291."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.14778\/3554821.3554883"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976236.69"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICMTMA50254.2020.00108"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403080"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1997.1404"},{"key":"e_1_3_2_2_26_1","volume-title":"CrossWalk: Fairness-enhanced Node Representation Learning. arXiv preprint arXiv:2105.02725","author":"Khajehnejad Ahmad","year":"2021","unstructured":"Ahmad Khajehnejad , Moein Khajehnejad , Mahmoudreza Babaei , Krishna\u00a0 P Gummadi , Adrian Weller , and Baharan Mirzasoleiman . 2021. CrossWalk: Fairness-enhanced Node Representation Learning. arXiv preprint arXiv:2105.02725 ( 2021 ). Ahmad Khajehnejad, Moein Khajehnejad, Mahmoudreza Babaei, Krishna\u00a0P Gummadi, Adrian Weller, and Baharan Mirzasoleiman. 2021. CrossWalk: Fairness-enhanced Node Representation Learning. arXiv preprint arXiv:2105.02725 (2021)."},{"key":"e_1_3_2_2_27_1","volume-title":"Kipf and Max Welling","author":"N.","year":"2016","unstructured":"Thomas\u00a0 N. Kipf and Max Welling . 2016 . Variational graph auto-encoders. arXiv preprint arXiv:1611.07308 (2016). Thomas\u00a0N. Kipf and Max Welling. 2016. Variational graph auto-encoders. arXiv preprint arXiv:1611.07308 (2016)."},{"key":"e_1_3_2_2_28_1","volume-title":"Kipf and Max Welling","author":"N.","year":"2017","unstructured":"Thomas\u00a0 N. Kipf and Max Welling . 2017 . Semi-Supervised Classification with Graph Convolutional Networks. In ICLR. Thomas\u00a0N. Kipf and Max Welling. 2017. Semi-Supervised Classification with Graph Convolutional Networks. In ICLR."},{"key":"e_1_3_2_2_29_1","volume-title":"On information and sufficiency. The annals of mathematical statistics 22, 1","author":"Kullback Solomon","year":"1951","unstructured":"Solomon Kullback and Richard\u00a0 A Leibler . 1951. On information and sufficiency. The annals of mathematical statistics 22, 1 ( 1951 ), 79\u201386. Solomon Kullback and Richard\u00a0A Leibler. 1951. On information and sufficiency. The annals of mathematical statistics 22, 1 (1951), 79\u201386."},{"key":"e_1_3_2_2_30_1","volume-title":"Counterfactual fairness. Advances in Neural Information Processing Systems 30","author":"Kusner J","year":"2017","unstructured":"Matt\u00a0 J Kusner , Joshua Loftus , Chris Russell , and Ricardo Silva . 2017. Counterfactual fairness. Advances in Neural Information Processing Systems 30 ( 2017 ). Matt\u00a0J Kusner, Joshua Loftus, Chris Russell, and Ricardo Silva. 2017. Counterfactual fairness. Advances in Neural Information Processing Systems 30 (2017)."},{"key":"e_1_3_2_2_31_1","volume-title":"Proceedings of the VLDB Endowment 13","author":"Lahoti Preethi","year":"2020","unstructured":"Preethi Lahoti , Krishna\u00a0 P Gummadi , and Gerhard Weikum . 2020 . Operationalizing Individual Fairness with Pairwise Fair Representations . Proceedings of the VLDB Endowment 13 , 4 (2020). Preethi Lahoti, Krishna\u00a0P Gummadi, and Gerhard Weikum. 2020. Operationalizing Individual Fairness with Pairwise Fair Representations. Proceedings of the VLDB Endowment 13, 4 (2020)."},{"key":"e_1_3_2_2_32_1","first-page":"120","article-title":"Pytorch-biggraph: A large scale graph embedding system","volume":"1","author":"Lerer Adam","year":"2019","unstructured":"Adam Lerer , Ledell Wu , Jiajun Shen , Timothee Lacroix , Luca Wehrstedt , Abhijit Bose , and Alex Peysakhovich . 2019 . Pytorch-biggraph: A large scale graph embedding system . Proceedings of Machine Learning and Systems 1 (2019), 120 \u2013 131 . Adam Lerer, Ledell Wu, Jiajun Shen, Timothee Lacroix, Luca Wehrstedt, Abhijit Bose, and Alex Peysakhovich. 2019. Pytorch-biggraph: A large scale graph embedding system. Proceedings of Machine Learning and Systems 1 (2019), 120\u2013131.","journal-title":"Proceedings of Machine Learning and Systems"},{"key":"e_1_3_2_2_33_1","volume-title":"On Dyadic Fairness: Exploring and Mitigating Bias in Graph Connections. In 9th International Conference on Learning Representations, ICLR","author":"Li Peizhao","year":"2021","unstructured":"Peizhao Li , Yifei Wang , Han Zhao , Pengyu Hong , and Hongfu Liu . 2021 . On Dyadic Fairness: Exploring and Mitigating Bias in Graph Connections. In 9th International Conference on Learning Representations, ICLR 2021. Peizhao Li, Yifei Wang, Han Zhao, Pengyu Hong, and Hongfu Liu. 2021. On Dyadic Fairness: Exploring and Mitigating Bias in Graph Connections. In 9th International Conference on Learning Representations, ICLR 2021."},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1609\/icwsm.v15i1.18067"},{"key":"e_1_3_2_2_35_1","volume-title":"AI and Compute: How Much Longer Can Computing Power Drive Artificial Intelligence Progress","author":"Lohn Andrew","year":"2022","unstructured":"Andrew Lohn and Micah Musser . 2022. AI and Compute: How Much Longer Can Computing Power Drive Artificial Intelligence Progress . Center for Security and Emerging Technology (CSET) ( 2022 ). Andrew Lohn and Micah Musser. 2022. AI and Compute: How Much Longer Can Computing Power Drive Artificial Intelligence Progress. Center for Security and Emerging Technology (CSET) (2022)."},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599454"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3457607"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"e_1_3_2_2_39_1","unstructured":"Jiezhong Qiu Laxman Dhulipala Jie Tang Richard Peng and Chi Wang. 2021. LightNE: A Lightweight Graph Processing System for Network Embedding. In SIGMOD. Jiezhong Qiu Laxman Dhulipala Jie Tang Richard Peng and Chi Wang. 2021. LightNE: A Lightweight Graph Processing System for Network Embedding. In SIGMOD."},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"crossref","unstructured":"Jiezhong Qiu Yuxiao Dong Hao Ma Jian Li Kuansan Wang and Jie Tang. 2018. Network embedding as matrix factorization: Unifying Deepwalk LINE PTE and Node2vec. In WSDM. 459\u2013467. Jiezhong Qiu Yuxiao Dong Hao Ma Jian Li Kuansan Wang and Jie Tang. 2018. Network embedding as matrix factorization: Unifying Deepwalk LINE PTE and Node2vec. In WSDM. 459\u2013467.","DOI":"10.1145\/3159652.3159706"},{"key":"e_1_3_2_2_41_1","volume-title":"Fairwalk: Towards Fair Graph Embedding","author":"Rahman Tahleen","year":"2019","unstructured":"Tahleen Rahman , Bartlomiej Surma , Michael Backes , and Yang Zhang . 2019 . Fairwalk: Towards Fair Graph Embedding . In IJCAI. AAAI Press , 3289\u20133295. Tahleen Rahman, Bartlomiej Surma, Michael Backes, and Yang Zhang. 2019. Fairwalk: Towards Fair Graph Embedding. In IJCAI. AAAI Press, 3289\u20133295."},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220088"},{"key":"e_1_3_2_2_43_1","volume-title":"FairDrop: Biased Edge Dropout for Enhancing Fairness in Graph Representation Learning","author":"Spinelli Indro","year":"2021","unstructured":"Indro Spinelli , Simone Scardapane , Amir Hussain , and Aurelio Uncini . 2021. FairDrop: Biased Edge Dropout for Enhancing Fairness in Graph Representation Learning . IEEE Transactions on Artificial Intelligence ( 2021 ). Indro Spinelli, Simone Scardapane, Amir Hussain, and Aurelio Uncini. 2021. FairDrop: Biased Edge Dropout for Enhancing Fairness in Graph Representation Learning. IEEE Transactions on Artificial Intelligence (2021)."},{"key":"e_1_3_2_2_44_1","volume-title":"Energy and policy considerations for deep learning in NLP. arXiv preprint arXiv:1906.02243","author":"Strubell Emma","year":"2019","unstructured":"Emma Strubell , Ananya Ganesh , and Andrew McCallum . 2019. Energy and policy considerations for deep learning in NLP. arXiv preprint arXiv:1906.02243 ( 2019 ). Emma Strubell, Ananya Ganesh, and Andrew McCallum. 2019. Energy and policy considerations for deep learning in NLP. arXiv preprint arXiv:1906.02243 (2019)."},{"key":"e_1_3_2_2_45_1","unstructured":"Sheridan Wall and Hilke Schellmann. 2021. LinkedIn\u2019s job-matching AI was biased. The company\u2019s solution? More AI.https:\/\/www.technologyreview.com\/2021\/06\/23\/1026825\/linkedin-ai-bias-ziprecruiter-monster-artificial-intelligence\/. Sheridan Wall and Hilke Schellmann. 2021. LinkedIn\u2019s job-matching AI was biased. The company\u2019s solution? More AI.https:\/\/www.technologyreview.com\/2021\/06\/23\/1026825\/linkedin-ai-bias-ziprecruiter-monster-artificial-intelligence\/."},{"key":"e_1_3_2_2_46_1","volume-title":"A semi-supervised graph attentive network for financial fraud detection","author":"Wang Daixin","unstructured":"Daixin Wang , Jianbin Lin , Peng Cui , Quanhui Jia , Zhen Wang , Yanming Fang , Quan Yu , Jun Zhou , Shuang Yang , and Yuan Qi. 2019. A semi-supervised graph attentive network for financial fraud detection . In ICDM. IEEE , 598\u2013607. Daixin Wang, Jianbin Lin, Peng Cui, Quanhui Jia, Zhen Wang, Yanming Fang, Quan Yu, Jun Zhou, Shuang Yang, and Yuan Qi. 2019. A semi-supervised graph attentive network for financial fraud detection. In ICDM. IEEE, 598\u2013607."},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"crossref","unstructured":"Jizhe Wang Pipei Huang Huan Zhao Zhibo Zhang Binqiang Zhao and Dik\u00a0Lun Lee. 2018. Billion-scale commodity embedding for e-commerce recommendation in alibaba. In KDD. 839\u2013848. Jizhe Wang Pipei Huang Huan Zhao Zhibo Zhang Binqiang Zhao and Dik\u00a0Lun Lee. 2018. Billion-scale commodity embedding for e-commerce recommendation in alibaba. In KDD. 839\u2013848.","DOI":"10.1145\/3219819.3219869"},{"key":"e_1_3_2_2_48_1","volume-title":"The 7th International Conference on Learning Representations.","author":"Xu Keyulu","year":"2019","unstructured":"Keyulu Xu , Weihua Hu , Jure Leskovec , and Stefanie Jegelka . 2019 . How Powerful are Graph Neural Networks? . In The 7th International Conference on Learning Representations. Keyulu Xu, Weihua Hu, Jure Leskovec, and Stefanie Jegelka. 2019. How Powerful are Graph Neural Networks?. In The 7th International Conference on Learning Representations."},{"key":"e_1_3_2_2_49_1","unstructured":"Muhammad\u00a0Bilal Zafar Isabel Valera Manuel\u00a0Gomez Rogriguez and Krishna\u00a0P Gummadi. 2017. Fairness constraints: Mechanisms for fair classification. In Artificial Intelligence and Statistics. PMLR 962\u2013970. Muhammad\u00a0Bilal Zafar Isabel Valera Manuel\u00a0Gomez Rogriguez and Krishna\u00a0P Gummadi. 2017. Fairness constraints: Mechanisms for fair classification. In Artificial Intelligence and Statistics. PMLR 962\u2013970."},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313508"}],"event":{"name":"EAAMO '23: Equity and Access in Algorithms, Mechanisms, and Optimization","location":"Boston MA USA","acronym":"EAAMO '23","sponsor":["SIGAI ACM Special Interest Group on Artificial Intelligence","SIGecom Special Interest Group on Economics and Computation"]},"container-title":["Equity and Access in Algorithms, Mechanisms, and Optimization"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3617694.3623231","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3617694.3623231","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:36:32Z","timestamp":1750178192000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3617694.3623231"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,30]]},"references-count":50,"alternative-id":["10.1145\/3617694.3623231","10.1145\/3617694"],"URL":"https:\/\/doi.org\/10.1145\/3617694.3623231","relation":{},"subject":[],"published":{"date-parts":[[2023,10,30]]},"assertion":[{"value":"2023-10-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}