{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,15]],"date-time":"2026-08-15T10:59:17Z","timestamp":1786791557736,"version":"build-2736575974"},"reference-count":62,"publisher":"Association for Computing Machinery (ACM)","issue":"2","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2022,10]]},"abstract":"<jats:p>\n            Finding a happiness maximizing set (HMS) from a database, i.e., selecting a small subset of tuples that preserves the best score with respect to any nonnegative linear utility function, is an important problem in multi-criteria decision-making. When an HMS is extracted from a set of individuals to assist data-driven algorithmic decisions such as hiring and admission, it is crucial to ensure that the HMS can fairly represent different groups of candidates without bias and discrimination. However, although the HMS problem was extensively studied in the database community, existing algorithms do not take\n            <jats:italic>group fairness<\/jats:italic>\n            into account and may provide solutions that under-represent some groups.\n          <\/jats:p>\n          <jats:p>In this paper, we propose and investigate a fair variant of HMS (FairHMS) that not only maximizes the minimum happiness ratio but also guarantees that the number of tuples chosen from each group falls within predefined lower and upper bounds. Similar to the vanilla HMS problem, we show that FairHMS is NP-hard in three and higher dimensions. Therefore, we first propose an exact interval cover-based algorithm called IntCov for FairHMS on two-dimensional databases. Then, we propose a bicriteria approximation algorithm called BiGreedy for FairHMS on multi-dimensional databases by transforming it into a submodular maximization problem under a matroid constraint. We also design an adaptive sampling strategy to improve the practical efficiency of BiGreedy. Extensive experiments on real-world and synthetic datasets confirm the efficacy and efficiency of our proposal.<\/jats:p>","DOI":"10.14778\/3565816.3565830","type":"journal-article","created":{"date-parts":[[2022,11,24]],"date-time":"2022-11-24T00:35:16Z","timestamp":1669250116000},"page":"291-303","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Happiness maximizing sets under group fairness constraints"],"prefix":"10.14778","volume":"16","author":[{"given":"Jiping","family":"Zheng","sequence":"first","affiliation":[{"name":"Nanjing University of Aeronautics and Astronautics, Nanjing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuan","family":"Ma","sequence":"additional","affiliation":[{"name":"Nanjing University of Aeronautics and Astronautics, Nanjing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wei","family":"Ma","sequence":"additional","affiliation":[{"name":"Nanjing University of Aeronautics and Astronautics, Nanjing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yanhao","family":"Wang","sequence":"additional","affiliation":[{"name":"East China Normal University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaoyang","family":"Wang","sequence":"additional","affiliation":[{"name":"The University of New South Wales, Sydney, NSW, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,11,23]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1008731.1008736"},{"key":"e_1_2_1_2_1","first-page":"1","article-title":"Efficient Algorithms for k-Regret Minimizing Sets","volume":"7","author":"Agarwal Pankaj K.","year":"2017","unstructured":"Pankaj K. Agarwal , Nirman Kumar , Stavros Sintos , and Subhash Suri . 2017 . Efficient Algorithms for k-Regret Minimizing Sets . In SEA. 7 : 1 -- 7 :23. Pankaj K. Agarwal, Nirman Kumar, Stavros Sintos, and Subhash Suri. 2017. Efficient Algorithms for k-Regret Minimizing Sets. In SEA. 7:1--7:23.","journal-title":"SEA."},{"key":"e_1_2_1_3_1","unstructured":"Nima Anari Nika Haghtalab Seffi Naor Sebastian Pokutta Mohit Singh and Alfredo Torrico. 2019. Structured Robust Submodular Maximization: Offline and Online Algorithms. In AISTATS. 3128--3137.  Nima Anari Nika Haghtalab Seffi Naor Sebastian Pokutta Mohit Singh and Alfredo Torrico. 2019. Structured Robust Submodular Maximization: Offline and Online Algorithms. In AISTATS. 3128--3137."},{"key":"e_1_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Abolfazl Asudeh H. V. Jagadish Julia Stoyanovich and Gautam Das. 2019. Designing Fair Ranking Schemes. In SIGMOD. 1259--1276.  Abolfazl Asudeh H. V. Jagadish Julia Stoyanovich and Gautam Das. 2019. Designing Fair Ranking Schemes. In SIGMOD. 1259--1276.","DOI":"10.1145\/3299869.3300079"},{"key":"e_1_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Abolfazl Asudeh Azade Nazi Nan Zhang and Gautam Das. 2017. Efficient Computation of Regret-ratio Minimizing Set: A Compact Maxima Representative. In SIGMOD. 821--834.  Abolfazl Asudeh Azade Nazi Nan Zhang and Gautam Das. 2017. Efficient Computation of Regret-ratio Minimizing Set: A Compact Maxima Representative. In SIGMOD. 821--834.","DOI":"10.1145\/3035918.3035932"},{"key":"e_1_2_1_6_1","volume-title":"RRR: Rank-Regret Representative. In SIGMOD. 263--280.","author":"Asudeh Abolfazl","year":"2019","unstructured":"Abolfazl Asudeh , Azade Nazi , Nan Zhang , Gautam Das , and H. V. Jagadish . 2019 . RRR: Rank-Regret Representative. In SIGMOD. 263--280. Abolfazl Asudeh, Azade Nazi, Nan Zhang, Gautam Das, and H. V. Jagadish. 2019. RRR: Rank-Regret Representative. In SIGMOD. 263--280."},{"key":"e_1_2_1_7_1","unstructured":"Stephan B\u00f6rzs\u00f6nyi Donald Kossmann and Konrad Stocker. 2001. The Skyline Operator. In ICDE. 421--430.  Stephan B\u00f6rzs\u00f6nyi Donald Kossmann and Konrad Stocker. 2001. The Skyline Operator. In ICDE. 421--430."},{"key":"e_1_2_1_8_1","first-page":"1","article-title":"k-Regret Minimizing Set","volume":"11","author":"Cao Wei","year":"2017","unstructured":"Wei Cao , Jian Li , Haitao Wang , Kangning Wang , Ruosong Wang , Raymond Chi-Wing Wong , and Wei Zhan . 2017 . k-Regret Minimizing Set : Efficient Algorithms and Hardness. In ICDT. 11 : 1 -- 11 :19. Wei Cao, Jian Li, Haitao Wang, Kangning Wang, Ruosong Wang, Raymond Chi-Wing Wong, and Wei Zhan. 2017. k-Regret Minimizing Set: Efficient Algorithms and Hardness. In ICDT. 11:1--11:19.","journal-title":"Efficient Algorithms and Hardness. In ICDT."},{"key":"e_1_2_1_9_1","volume-title":"Vishnoi","author":"Celis L. Elisa","year":"2018","unstructured":"L. Elisa Celis , Lingxiao Huang , and Nisheeth K . Vishnoi . 2018 . Multiwinner Voting with Fairness Constraints. In IJCAI. 144--151. L. Elisa Celis, Lingxiao Huang, and Nisheeth K. Vishnoi. 2018. Multiwinner Voting with Fairness Constraints. In IJCAI. 144--151."},{"key":"e_1_2_1_10_1","volume-title":"Vishnoi","author":"Celis L. Elisa","year":"2018","unstructured":"L. Elisa Celis , Vijay Keswani , Damian Straszak , Amit Deshpande , Tarun Kathuria , and Nisheeth K . Vishnoi . 2018 . Fair and Diverse DPP-Based Data Summarization. In ICML. 715--724. L. Elisa Celis, Vijay Keswani, Damian Straszak, Amit Deshpande, Tarun Kathuria, and Nisheeth K. Vishnoi. 2018. Fair and Diverse DPP-Based Data Summarization. In ICML. 715--724."},{"key":"e_1_2_1_11_1","first-page":"1","article-title":"Ranking with Fairness Constraints","volume":"28","author":"Celis L. Elisa","year":"2018","unstructured":"L. Elisa Celis , Damian Straszak , and Nisheeth K. Vishnoi . 2018 . Ranking with Fairness Constraints . In ICALP. 28 : 1 -- 28 :15. L. Elisa Celis, Damian Straszak, and Nisheeth K. Vishnoi. 2018. Ranking with Fairness Constraints. In ICALP. 28:1--28:15.","journal-title":"ICALP."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732269.2732275"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3376898"},{"key":"e_1_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Qi Dong and Jiping Zheng. 2019. Faster Algorithms for k-Regret Minimizing Sets via Monotonicity and Sampling. In CIKM. 2213--2216.  Qi Dong and Jiping Zheng. 2019. Faster Algorithms for k -Regret Minimizing Sets via Monotonicity and Sampling. In CIKM. 2213--2216.","DOI":"10.1145\/3357384.3358115"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.14778\/2831360.2831364"},{"key":"e_1_2_1_16_1","doi-asserted-by":"crossref","unstructured":"M. L. Fisher G. L. Nemhauser and L. A. Wolsey. 1978. An analysis of approximations for maximizing submodular set functions---II. In Polyhedral Combinatorics. 73--87.  M. L. Fisher G. L. Nemhauser and L. A. Wolsey. 1978. An analysis of approximations for maximizing submodular set functions---II. In Polyhedral Combinatorics. 73--87.","DOI":"10.1007\/BFb0121195"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/230538.230561"},{"key":"e_1_2_1_18_1","first-page":"480","article-title":"Approximation algorithms for submodular set cover with applications","volume":"83","author":"Fujito Toshihiro","year":"2000","unstructured":"Toshihiro Fujito . 2000 . Approximation algorithms for submodular set cover with applications . IEICE Trans. Inf. Syst. 83 (2000), 480 -- 487 . Toshihiro Fujito. 2000. Approximation algorithms for submodular set cover with applications. IEICE Trans. Inf. Syst. 83 (2000), 480--487.","journal-title":"IEICE Trans. Inf. Syst."},{"key":"e_1_2_1_19_1","doi-asserted-by":"crossref","unstructured":"David Garc\u00eda-Soriano and Francesco Bonchi. 2021. Maxmin-Fair Ranking: Individual Fairness under Group-Fairness Constraints. In KDD. 436--446.  David Garc\u00eda-Soriano and Francesco Bonchi. 2021. Maxmin-Fair Ranking: Individual Fairness under Group-Fairness Constraints. In KDD. 436--446.","DOI":"10.1145\/3447548.3467349"},{"key":"e_1_2_1_20_1","unstructured":"Marwa El Halabi Slobodan Mitrovic Ashkan Norouzi-Fard Jakab Tardos and Jakub Tarnawski. 2020. Fairness in Streaming Submodular Maximization: Algorithms and Hardness. In NeurIPS. 13609--13622.  Marwa El Halabi Slobodan Mitrovic Ashkan Norouzi-Fard Jakab Tardos and Jakub Tarnawski. 2020. Fairness in Streaming Submodular Maximization: Algorithms and Hardness. In NeurIPS. 13609--13622."},{"key":"e_1_2_1_21_1","volume-title":"Soliman","author":"Ilyas Ihab F.","year":"2008","unstructured":"Ihab F. Ilyas , George Beskales , and Mohamed A . Soliman . 2008 . A survey of top-k query processing techniques in relational database systems. ACM Comput. Surv . 40, 4 (2008), 11:1--11:58. Ihab F. Ilyas, George Beskales, and Mohamed A. Soliman. 2008. A survey of top-k query processing techniques in relational database systems. ACM Comput. Surv. 40, 4 (2008), 11:1--11:58."},{"key":"e_1_2_1_22_1","volume-title":"Algorithm Design","author":"Kleinberg Jon","unstructured":"Jon Kleinberg and \u00c9va Tardos . 2006. Algorithm Design . Addison Wesley . Jon Kleinberg and \u00c9va Tardos. 2006. Algorithm Design. Addison Wesley."},{"key":"e_1_2_1_23_1","unstructured":"Matth\u00e4us Kleindessner Pranjal Awasthi and Jamie Morgenstern. 2019. Fair k-Center Clustering for Data Summarization. In ICML. 3448--3457.  Matth\u00e4us Kleindessner Pranjal Awasthi and Jamie Morgenstern. 2019. Fair k-Center Clustering for Data Summarization. In ICML. 3448--3457."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24488-9"},{"key":"e_1_2_1_25_1","volume-title":"Tractability: Practical Approaches to Hard Problems","author":"Krause Andreas","unstructured":"Andreas Krause and Daniel Golovin . 2014. Submodular Function Maximization . In Tractability: Practical Approaches to Hard Problems . Cambridge University Press , 71--104. Andreas Krause and Daniel Golovin. 2014. Submodular Function Maximization. In Tractability: Practical Approaches to Hard Problems. Cambridge University Press, 71--104."},{"key":"e_1_2_1_26_1","first-page":"2761","article-title":"Robust Submodular Observation Selection","volume":"9","author":"Krause Andreas","year":"2008","unstructured":"Andreas Krause , H Brendan McMahan , Carlos Guestrin , and Anupam Gupta . 2008 . Robust Submodular Observation Selection . J. Mach. Learn. Res. 9 (2008), 2761 -- 2801 . Andreas Krause, H Brendan McMahan, Carlos Guestrin, and Anupam Gupta. 2008. Robust Submodular Observation Selection. J. Mach. Learn. Res. 9 (2008), 2761--2801.","journal-title":"J. Mach. Learn. Res."},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.14778\/3407790.3407855"},{"key":"e_1_2_1_28_1","doi-asserted-by":"crossref","unstructured":"Nirman Kumar and Stavros Sintos. 2018. Faster Approximation Algorithm for the k-Regret Minimizing Set and Related Problems. In ALENEX. 62--74.  Nirman Kumar and Stavros Sintos. 2018. Faster Approximation Algorithm for the k -Regret Minimizing Set and Related Problems. In ALENEX. 62--74.","DOI":"10.1137\/1.9781611975055.6"},{"key":"e_1_2_1_29_1","volume-title":"Yau Pun Chen, and Raymond Chi-Wing Wong","author":"Luenam Phoomraphee","year":"2021","unstructured":"Phoomraphee Luenam , Yau Pun Chen, and Raymond Chi-Wing Wong . 2021 . Approximating Happiness Maximizing Set Problems . arXiv:2102.03578 [cs.DB] Phoomraphee Luenam, Yau Pun Chen, and Raymond Chi-Wing Wong. 2021. Approximating Happiness Maximizing Set Problems. arXiv:2102.03578 [cs.DB]"},{"key":"e_1_2_1_30_1","unstructured":"Hanchao Ma Sheng Guan Christopher Toomey and Yinghui Wu. 2022. Diversified Subgraph Query Generation with Group Fairness. In WSDM. 686--694.  Hanchao Ma Sheng Guan Christopher Toomey and Yinghui Wu. 2022. Diversified Subgraph Query Generation with Group Fairness. In WSDM. 686--694."},{"key":"e_1_2_1_31_1","doi-asserted-by":"crossref","unstructured":"Anay Mehrotra and L. Elisa Celis. 2021. Mitigating Bias in Set Selection with Noisy Protected Attributes. In FAccT. 237--248.  Anay Mehrotra and L. Elisa Celis. 2021. Mitigating Bias in Set Selection with Noisy Protected Attributes. In FAccT. 237--248.","DOI":"10.1145\/3442188.3445887"},{"key":"e_1_2_1_32_1","first-page":"1","article-title":"Diverse Data Selection under Fairness Constraints","volume":"13","author":"Moumoulidou Zafeiria","year":"2021","unstructured":"Zafeiria Moumoulidou , Andrew McGregor , and Alexandra Meliou . 2021 . Diverse Data Selection under Fairness Constraints . In ICDT. 13 : 1 -- 13 :25. Zafeiria Moumoulidou, Andrew McGregor, and Alexandra Meliou. 2021. Diverse Data Selection under Fairness Constraints. In ICDT. 13:1--13:25.","journal-title":"ICDT."},{"key":"e_1_2_1_33_1","volume-title":"Atish Das Sarma, and Kazuhisa Makino","author":"Nanongkai Danupon","year":"2012","unstructured":"Danupon Nanongkai , Ashwin Lall , Atish Das Sarma, and Kazuhisa Makino . 2012 . Interactive regret minimization. In SIGMOD. 109--120. Danupon Nanongkai, Ashwin Lall, Atish Das Sarma, and Kazuhisa Makino. 2012. Interactive regret minimization. In SIGMOD. 109--120."},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920980"},{"key":"e_1_2_1_35_1","doi-asserted-by":"crossref","unstructured":"Peng Peng and Raymond Chi-Wing Wong. 2014. Geometry approach for k-regret query. In ICDE. 772--783.  Peng Peng and Raymond Chi-Wing Wong. 2014. Geometry approach for k-regret query. In ICDE. 772--783.","DOI":"10.1109\/ICDE.2014.6816699"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-021-00697-y"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3230634"},{"key":"e_1_2_1_38_1","volume-title":"Speed-Up Algorithms for Happiness-Maximizing Representative Databases. In APWeb\/WAIM Workshops. 321--335","author":"Qiu Xianhong","year":"2018","unstructured":"Xianhong Qiu , Jiping Zheng , Qi Dong , and Xingnan Huang . 2018 . Speed-Up Algorithms for Happiness-Maximizing Representative Databases. In APWeb\/WAIM Workshops. 321--335 . Xianhong Qiu, Jiping Zheng, Qi Dong, and Xingnan Huang. 2018. Speed-Up Algorithms for Happiness-Maximizing Representative Databases. In APWeb\/WAIM Workshops. 321--335."},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF03024331"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.14778\/3368289.3368291"},{"key":"e_1_2_1_41_1","doi-asserted-by":"crossref","unstructured":"Ashudeep Singh and Thorsten Joachims. 2018. Fairness of Exposure in Rankings. In KDD. 2219--2228.  Ashudeep Singh and Thorsten Joachims. 2018. Fairness of Exposure in Rankings. In KDD. 2219--2228.","DOI":"10.1145\/3219819.3220088"},{"key":"e_1_2_1_42_1","doi-asserted-by":"crossref","unstructured":"Tasuku Soma and Yuichi Yoshida. 2017. Regret Ratio Minimization in Multi-Objective Submodular Function Maximization. In AAAI. 905--911.  Tasuku Soma and Yuichi Yoshida. 2017. Regret Ratio Minimization in Multi-Objective Submodular Function Maximization. In AAAI. 905--911.","DOI":"10.1609\/aaai.v31i1.10652"},{"key":"e_1_2_1_43_1","doi-asserted-by":"crossref","unstructured":"Sabine Storandt and Stefan Funke. 2019. Algorithms for Average Regret Minimization. In AAAI. 1600--1607.  Sabine Storandt and Stefan Funke. 2019. Algorithms for Average Regret Minimization. In AAAI. 1600--1607.","DOI":"10.1609\/aaai.v33i01.33011600"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.14778\/3415478.3415570"},{"key":"e_1_2_1_45_1","unstructured":"Julia Stoyanovich Ke Yang and H. V. Jagadish. 2018. Online Set Selection with Fairness and Diversity Constraints. In EDBT. 241--252.  Julia Stoyanovich Ke Yang and H. V. Jagadish. 2018. Online Set Selection with Fairness and Diversity Constraints. In EDBT. 241--252."},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2020.0998"},{"key":"e_1_2_1_47_1","unstructured":"Rajan Udwani. 2018. Multi-objective Maximization of Monotone Submodular Functions with Cardinality Constraint. In NeurIPS. 9513--9524.  Rajan Udwani. 2018. Multi-objective Maximization of Monotone Submodular Functions with Cardinality Constraint. In NeurIPS. 9513--9524."},{"key":"e_1_2_1_48_1","doi-asserted-by":"crossref","unstructured":"Yanhao Wang Francesco Fabbri and Michael Mathioudakis. 2021. Fair and Representative Subset Selection from Data Streams. In WWW. 1340--1350.  Yanhao Wang Francesco Fabbri and Michael Mathioudakis. 2021. Fair and Representative Subset Selection from Data Streams. In WWW. 1340--1350.","DOI":"10.1145\/3442381.3449799"},{"key":"e_1_2_1_49_1","volume-title":"Raymond Chi-Wing Wong, and Kian-Lee Tan","author":"Wang Yanhao","year":"2021","unstructured":"Yanhao Wang , Yuchen Li , Raymond Chi-Wing Wong, and Kian-Lee Tan . 2021 . A Fully Dynamic Algorithm for k-Regret Minimizing Sets. In ICDE. 1631--1642. Yanhao Wang, Yuchen Li, Raymond Chi-Wing Wong, and Kian-Lee Tan. 2021. A Fully Dynamic Algorithm for k-Regret Minimizing Sets. In ICDE. 1631--1642."},{"key":"e_1_2_1_50_1","doi-asserted-by":"crossref","unstructured":"Yanhao Wang Michael Mathioudakis Yuchen Li and Kian-Lee Tan. 2021. Minimum Coresets for Maxima Representation of Multidimensional Data. In PODS. 138--152.  Yanhao Wang Michael Mathioudakis Yuchen Li and Kian-Lee Tan. 2021. Minimum Coresets for Maxima Representation of Multidimensional Data. In PODS. 138--152.","DOI":"10.1145\/3452021.3458322"},{"key":"e_1_2_1_51_1","doi-asserted-by":"crossref","unstructured":"Xingxing Xiao and Jianzhong Li. 2022. Rank-Regret Minimization. In ICDE. 1848--1860.  Xingxing Xiao and Jianzhong Li. 2022. Rank-Regret Minimization. In ICDE. 1848--1860.","DOI":"10.1109\/ICDE53745.2022.00184"},{"key":"e_1_2_1_52_1","volume-title":"Raymond Chi-Wing Wong, and Ashwin Lall","author":"Xie Min","year":"2019","unstructured":"Min Xie , Raymond Chi-Wing Wong, and Ashwin Lall . 2019 . Strongly Truthful Interactive Regret Minimization. In SIGMOD. 281--298. Min Xie, Raymond Chi-Wing Wong, and Ashwin Lall. 2019. Strongly Truthful Interactive Regret Minimization. In SIGMOD. 281--298."},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-019-00570-z"},{"key":"e_1_2_1_54_1","volume-title":"Jian Li, Cheng Long, and Ashwin Lall.","author":"Xie Min","year":"2018","unstructured":"Min Xie , Raymond Chi-Wing Wong , Jian Li, Cheng Long, and Ashwin Lall. 2018 . Efficient k-Regret Query Algorithm with Restriction-free Bound for any Dimensionality. In SIGMOD. 959--974. Min Xie, Raymond Chi-Wing Wong, Jian Li, Cheng Long, and Ashwin Lall. 2018. Efficient k-Regret Query Algorithm with Restriction-free Bound for any Dimensionality. In SIGMOD. 959--974."},{"key":"e_1_2_1_55_1","volume-title":"Peng Peng, and Vassilis J. Tsotras.","author":"Xie Min","year":"2020","unstructured":"Min Xie , Raymond Chi-Wing Wong , Peng Peng, and Vassilis J. Tsotras. 2020 . Being Happy with the Least : Achieving &alpha;-happiness with Minimum Number of Tuples. In ICDE. 1009--1020. Min Xie, Raymond Chi-Wing Wong, Peng Peng, and Vassilis J. Tsotras. 2020. Being Happy with the Least: Achieving &alpha;-happiness with Minimum Number of Tuples. In ICDE. 1009--1020."},{"key":"e_1_2_1_56_1","doi-asserted-by":"crossref","unstructured":"Meike Zehlike Francesco Bonchi Carlos Castillo Sara Hajian Mohamed Megahed and Ricardo Baeza-Yates. 2017. FA*IR: A Fair Top-k Ranking Algorithm. In CIKM. 1569--1578.  Meike Zehlike Francesco Bonchi Carlos Castillo Sara Hajian Mohamed Megahed and Ricardo Baeza-Yates. 2017. FA * IR: A Fair Top-k Ranking Algorithm. In CIKM. 1569--1578.","DOI":"10.1145\/3132847.3132938"},{"key":"e_1_2_1_57_1","unstructured":"Meike Zehlike Ke Yang and Julia Stoyanovich. 2021. Fairness in Ranking: A Survey. (2021). arXiv:2103.14000 [cs.IR]  Meike Zehlike Ke Yang and Julia Stoyanovich. 2021. Fairness in Ranking: A Survey. (2021). arXiv:2103.14000 [cs.IR]"},{"key":"e_1_2_1_58_1","doi-asserted-by":"crossref","unstructured":"Sepanta Zeighami and Raymond Chi-Wing Wong. 2019. Finding Average Regret Ratio Minimizing Set in Database. In ICDE. 1722--1725.  Sepanta Zeighami and Raymond Chi-Wing Wong. 2019. Finding Average Regret Ratio Minimizing Set in Database. In ICDE. 1722--1725.","DOI":"10.1109\/ICDE.2019.00182"},{"key":"e_1_2_1_59_1","doi-asserted-by":"crossref","unstructured":"Jiping Zheng and Chen Chen. 2020. Sorting-Based Interactive Regret Minimization. In APWeb\/WAIM. 473--490.  Jiping Zheng and Chen Chen. 2020. Sorting-Based Interactive Regret Minimization. In APWeb\/WAIM. 473--490.","DOI":"10.1007\/978-3-030-60290-1_36"},{"key":"e_1_2_1_60_1","volume-title":"echnical Report).","author":"Zheng Jiping","year":"2022","unstructured":"Jiping Zheng , Yuan Ma , Wei Ma , Yanhao Wang , and Xiaoyang Wang . 2022. Happiness Maximizing Sets under Group Fairness Constraints ( T echnical Report). ( 2022 ). arXiv:2208.06553 [cs.DB] Jiping Zheng, Yuan Ma, Wei Ma, Yanhao Wang, and Xiaoyang Wang. 2022. Happiness Maximizing Sets under Group Fairness Constraints (Technical Report). (2022). arXiv:2208.06553 [cs.DB]"},{"key":"e_1_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2022.3166835"},{"key":"e_1_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-017-0506-1"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3565816.3565830","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T09:35:51Z","timestamp":1672220151000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3565816.3565830"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10]]},"references-count":62,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["10.14778\/3565816.3565830"],"URL":"https:\/\/doi.org\/10.14778\/3565816.3565830","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2022,10]]},"assertion":[{"value":"2022-11-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}