<?xml version="1.0" encoding="UTF-8"?><rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcq="http://purl.org/dc/terms/"><records count="1" morepages="false" start="1" end="1"><record rownumber="1"><dc:product_type>Journal Article</dc:product_type><dc:title>Minimax auc fairness: Efficient algorithm with provable convergence</dc:title><dc:creator>Yang, Zhenhuan; Ko, Yan Lok; Varshney, Kush; Ying, Yiming</dc:creator><dc:corporate_author/><dc:editor/><dc:description/><dc:publisher/><dc:date>2023-06-26</dc:date><dc:nsf_par_id>10440182</dc:nsf_par_id><dc:journal_name>Proceedings of the  AAAI Conference on Artificial Intelligence</dc:journal_name><dc:journal_volume/><dc:journal_issue/><dc:page_range_or_elocation/><dc:issn>2159-5399</dc:issn><dc:isbn/><dc:doi>https://doi.org/10.1609/aaai.v37i10.26405</dc:doi><dcq:identifierAwardId>2110546; 2110836; 2008532</dcq:identifierAwardId><dc:subject/><dc:version_number/><dc:location/><dc:rights/><dc:institution/><dc:sponsoring_org>National Science Foundation</dc:sponsoring_org></record></records></rdf:RDF>