{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T10:02:05Z","timestamp":1780999325758,"version":"3.54.1"},"publisher-location":"Singapore","reference-count":52,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819573936","type":"print"},{"value":"9789819573943","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-981-95-7394-3_40","type":"book-chapter","created":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T00:28:28Z","timestamp":1778459308000},"page":"595-610","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Happiness Maximization Queries with\u00a0Two-Sided Fairness"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-3174-1100","authenticated-orcid":false,"given":"Jie","family":"Dong","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4378-5250","authenticated-orcid":false,"given":"Jiping","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,5,1]]},"reference":[{"key":"40_CR1","doi-asserted-by":"crossref","unstructured":"Alonso, O., Baeza-Yates, R. (eds.): Information Retrieval: Advanced Topics and Techniques. Association for Computing Machinery (2024)","DOI":"10.1145\/3674127"},{"key":"40_CR2","doi-asserted-by":"crossref","unstructured":"Borzsony, S., Kossmann, D., Stocker, K.: The skyline operator. In: Proceedings of the 17th International Conference on Data Engineering (ICDE), pp. 421\u2013430 (2001)","DOI":"10.1109\/ICDE.2001.914855"},{"issue":"6","key":"40_CR3","doi-asserted-by":"publisher","first-page":"1740","DOI":"10.1137\/080733991","volume":"40","author":"G Calinescu","year":"2011","unstructured":"Calinescu, G., Chekuri, C., P\u00e1l, M., Vondr\u00e1k, J.: Maximizing a monotone submodular function subject to a matroid constraint. SIAM J. Comput. (SICOMP) 40(6), 1740\u20131766 (2011)","journal-title":"SIAM J. Comput. (SICOMP)"},{"key":"40_CR4","unstructured":"Celis, E., Keswani, V., Straszak, D., Deshpande, A., Kathuria, T., Vishnoi, N.: Fair and diverse dpp-based data summarization. In: Proceedings of the International Conference on Machine Learning (ICML), pp. 716\u2013725 (2018)"},{"key":"40_CR5","unstructured":"Do, V., Corbett-Davies, S., Atif, J., Usunier, N.: Two-sided fairness in rankings via lorenz dominance. In: Proceedings of the Advances in Neural Information Processing Systems (NeurIPS), pp. 8596\u20138608 (2021)"},{"issue":"10","key":"40_CR6","doi-asserted-by":"publisher","first-page":"10583","DOI":"10.1109\/TKDE.2023.3265598","volume":"35","author":"Y Dong","year":"2023","unstructured":"Dong, Y., Ma, J., Wang, S., Chen, C., Li, J.: Fairness in graph mining: a survey. IEEE Trans. Knowl. Data Eng. (TKDE) 35(10), 10583\u201310602 (2023)","journal-title":"IEEE Trans. Knowl. Data Eng. (TKDE)"},{"key":"40_CR7","doi-asserted-by":"crossref","unstructured":"Dwork, C., Hardt, M., Pitassi, T., Reingold, O., Zemel, R.: Fairness through awareness. In: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference (ITCS), pp. 214\u2013226 (2012)","DOI":"10.1145\/2090236.2090255"},{"key":"40_CR8","unstructured":"El\u00a0Halabi, M., Fusco, F., Norouzi-Fard, A., Tardos, J., Tarnawski, J.: Fairness in streaming submodular maximization over a matroid constraint. In: Proceedings of the International Conference on Machine Learning (ICML), pp. 9150\u20139171 (2023)"},{"key":"40_CR9","unstructured":"El\u00a0Halabi, M., Mitrovi\u0107, S., Norouzi-Fard, A., Tardos, J., Tarnawski, J.M.: Fairness in streaming submodular maximization: Algorithms and hardness. In: Proceedings of the Advances in Neural Information Processing Systems (NeurIPS), pp. 13609\u201313622 (2020)"},{"key":"40_CR10","doi-asserted-by":"crossref","unstructured":"Fagin, R.: Combining fuzzy information from multiple systems. In: Proceedings of the 15th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS), pp. 216\u2013226 (1996)","DOI":"10.1145\/237661.237715"},{"key":"40_CR11","unstructured":"Fazzone, A., Wang, Y., Bonchi, F.: Fair representation in submodular subset selection: A pareto optimization approach. Trans. Mach. Learn. Res. (TMLR) 1\u201326 (2024)"},{"key":"40_CR12","doi-asserted-by":"crossref","unstructured":"Feng, C., Qian, C.: Multi-objective submodular maximization by regret ratio minimization with theoretical guarantee. In: Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), pp. 12302\u201312310 (2021)","DOI":"10.1609\/aaai.v35i14.17460"},{"key":"40_CR13","doi-asserted-by":"crossref","unstructured":"Fu, X., Bhatt, R.R., Basu, S., Pavan, A.: Multi-objective submodular optimization with approximate oracles and influence maximization. In: Proceedings of the 2021 IEEE International Conference on Big Data (Big Data), pp. 328\u2013334 (2021)","DOI":"10.1109\/BigData52589.2021.9671756"},{"issue":"3","key":"40_CR14","first-page":"480","volume":"83","author":"T Fujito","year":"2000","unstructured":"Fujito, T.: Approximation algorithms for submodular set cover with applications. IEICE Trans. Inf. Syst. 83(3), 480\u2013487 (2000)","journal-title":"IEICE Trans. Inf. Syst."},{"key":"40_CR15","doi-asserted-by":"crossref","unstructured":"Garc\u00eda-Soriano, D., Bonchi, F.: Maxmin-fair ranking: individual fairness under group-fairness constraints. In: Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (SIGKDD), pp. 436\u2013446 (2021)","DOI":"10.1145\/3447548.3467349"},{"issue":"4","key":"40_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1391729.1391730","volume":"40","author":"IF Ilyas","year":"2008","unstructured":"Ilyas, I.F., Beskales, G., Soliman, M.A.: A survey of top-k query processing techniques in relational database systems. ACM Comput. Sur. (CSUR) 40(4), 1\u201358 (2008)","journal-title":"ACM Comput. Sur. (CSUR)"},{"key":"40_CR17","unstructured":"Jain, P., Jha, P., Solanki, S.: Fairness and efficiency in two-sided matching markets. arXiv preprint arXiv:2504.10232 (2025)"},{"key":"40_CR18","unstructured":"Kleindessner, M., Awasthi, P., Morgenstern, J.: Fair k-center clustering for data summarization. In: Proceedings of the International Conference on Machine Learning (ICML), pp. 3448\u20133457 (2019)"},{"key":"40_CR19","unstructured":"Korte, B., Vygen, J.: Combinatorial optimization: theory and algorithms. Springer (2008)"},{"key":"40_CR20","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1017\/CBO9781139177801.004","volume":"3","author":"A Krause","year":"2014","unstructured":"Krause, A., Golovin, D.: Submodular function maximization. Tractability 3, 71\u2013104 (2014)","journal-title":"Tractability"},{"issue":"12","key":"40_CR21","first-page":"2761","volume":"9","author":"A Krause","year":"2008","unstructured":"Krause, A., McMahan, H.B., Guestrin, C., Gupta, A.: Robust submodular observation selection. J. Mach. Learn. Res. (JMLR) 9(12), 2761\u20132801 (2008)","journal-title":"J. Mach. Learn. Res. (JMLR)"},{"issue":"6","key":"40_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3457607","volume":"54","author":"N Mehrabi","year":"2021","unstructured":"Mehrabi, N., Morstatter, F., Saxena, N., Lerman, K., Galstyan, A.: A survey on bias and fairness in machine learning. ACM Comput. Surv. (CSUR) 54(6), 1\u201335 (2021)","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"40_CR23","doi-asserted-by":"crossref","unstructured":"Nanongkai, D., Sarma, A.D., Lall, A., Lipton, R.J., Xu, J.: Regret-minimizing representative databases. In: Proceedings of the VLDB Endowment (PVLDB), pp. 1114\u20131124 (2010)","DOI":"10.14778\/1920841.1920980"},{"issue":"3","key":"40_CR24","first-page":"1","volume":"55","author":"D Pessach","year":"2022","unstructured":"Pessach, D., Shmueli, E.: A review on fairness in machine learning. ACM Comput. Sur. (CSUR) 55(3), 1\u201344 (2022)","journal-title":"ACM Comput. Sur. (CSUR)"},{"key":"40_CR25","doi-asserted-by":"crossref","unstructured":"Pradhan, R., Zhu, J., Glavic, B., Salimi, B.: Interpretable data-based explanations for fairness debugging. In: Proceedings of the 2022 International Conference on Management of Data (SIGMOD), pp. 247\u2013261 (2022)","DOI":"10.1145\/3514221.3517886"},{"key":"40_CR26","doi-asserted-by":"crossref","unstructured":"Qiu, X., Zheng, J., Dong, Q., Huang, X.: Speed-up algorithms for happiness-maximizing representative databases. In: Proceedings of the APWeb-WAIM 2018 International Workshops: MWDA, BAH, KGMA, DMMOOC, DS (APWebWAIM DS Workshop), pp. 321\u2013335 (2018)","DOI":"10.1007\/978-3-030-01298-4_27"},{"key":"40_CR27","doi-asserted-by":"crossref","unstructured":"Qu, M., Ren, X., Han, J.: Automatic synonym discovery with knowledge bases. In: Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (SIGKDD), pp. 997\u20131005 (2017)","DOI":"10.1145\/3097983.3098185"},{"key":"40_CR28","doi-asserted-by":"crossref","unstructured":"Raj, A., Ekstrand, M.D.: Measuring fairness in ranked results: An analytical and empirical comparison. In: Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR), pp. 726\u2013736 (2022)","DOI":"10.1145\/3477495.3532018"},{"key":"40_CR29","doi-asserted-by":"crossref","unstructured":"Serbos, D., Qi, S., Mamoulis, N., Pitoura, E., Tsaparas, P.: Fairness in package-to-group recommendations. In: Proceedings of the 26th International Conference on World Wide Web (WWW), pp. 371\u2013379 (2017)","DOI":"10.1145\/3038912.3052612"},{"key":"40_CR30","doi-asserted-by":"crossref","unstructured":"Soma, T., Yoshida, Y.: Regret ratio minimization in multi-objective submodular function maximization. In: Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), pp. 905\u2013911 (2017)","DOI":"10.1609\/aaai.v31i1.10652"},{"key":"40_CR31","unstructured":"Stoyanovich, J., Yang, K., Jagadish, H.: Online set selection with fairness and diversity constraints. In: Proceedings of the 21st International Conference on Extending Database Technology (EDBT), pp. 241\u2013252 (2018)"},{"key":"40_CR32","unstructured":"Udwani, R.: Multi-objective maximization of monotone submodular functions with cardinality constraint. In: Proceedings of the Advances in Neural Information Processing Systems (NeurIPS), pp. 9513\u20139524 (2018)"},{"key":"40_CR33","doi-asserted-by":"crossref","unstructured":"Wang, L., Joachims, T.: User fairness, item fairness, and diversity for rankings in two-sided markets. In: Proceedings of the ACM SIGIR International Conference on Theory of Information Retrieval (ICTIR), pp. 23\u201341 (2021)","DOI":"10.1145\/3471158.3472260"},{"key":"40_CR34","doi-asserted-by":"crossref","unstructured":"Wang, Y., Fabbri, F., Mathioudakis, M.: Fair and representative subset selection from data streams. In: Proceedings of the Web Conference 2021 (WWW), pp. 1340\u20131350 (2021)","DOI":"10.1145\/3442381.3449799"},{"key":"40_CR35","unstructured":"Wang, Y., Li, Y., Bonchi, F., Wang, Y.: Balancing utility and fairness in submodular maximization. In: Proceedings of the 27th International Conference on Extending Database Technology (EDBT), pp. 1\u201314 (2024)"},{"key":"40_CR36","doi-asserted-by":"crossref","unstructured":"Wang, Y., Zheng, J., Meng, F.: Improved algorithm for regret ratio minimization in multi-objective submodular maximization. In: Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), pp. 12500\u201312508 (2023)","DOI":"10.1609\/aaai.v37i10.26472"},{"key":"40_CR37","doi-asserted-by":"crossref","unstructured":"Wang, Y., Sun, P., Ma, W., Zhang, M., Zhang, Y., Jiang, P., Ma, S.: Intersectional two-sided fairness in recommendation. In: Proceedings of the ACM Web Conference 2024 (WWW), pp. 3609\u20133620 (2024)","DOI":"10.1145\/3589334.3645518"},{"issue":"2","key":"40_CR38","first-page":"1","volume":"41","author":"H Wu","year":"2023","unstructured":"Wu, H., Ma, C., Mitra, B., Diaz, F., Liu, X.: A multi-objective optimization framework for multi-stakeholder fairness-aware recommendation. ACM Trans. Inf. Syst. (TOIS) 41(2), 1\u201347 (2023)","journal-title":"ACM Trans. Inf. Syst. (TOIS)"},{"key":"40_CR39","doi-asserted-by":"crossref","unstructured":"Wu, Y., Cao, J., Xu, G., Tan, Y.: Tfrom: A two-sided fairness-aware recommendation model for both customers and providers. In: Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR), pp. 1013\u20131022 (2021)","DOI":"10.1145\/3404835.3462882"},{"issue":"1","key":"40_CR40","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/s00778-019-00570-z","volume":"29","author":"M Xie","year":"2020","unstructured":"Xie, M., Wong, R.C.W., Lall, A.: An experimental survey of regret minimization query and variants: bridging the best worlds between top-k query and skyline query. VLDB J. 29(1), 147\u2013175 (2020)","journal-title":"VLDB J."},{"key":"40_CR41","doi-asserted-by":"crossref","unstructured":"Xie, M., Wong, R.C.W., Li, J., Long, C., Lall, A.: Efficient k-regret query algorithm with restriction-free bound for any dimensionality. In: Proceedings of the 2018 International Conference on Management of Data (SIGMOD), pp. 959\u2013974 (2018)","DOI":"10.1145\/3183713.3196903"},{"issue":"88","key":"40_CR42","first-page":"1","volume":"45","author":"J Yuan","year":"2023","unstructured":"Yuan, J., Tang, S.: Group fairness in non-monotone submodular maximization. J. Comb. Optim. 45(88), 1\u201315 (2023)","journal-title":"J. Comb. Optim."},{"issue":"6","key":"40_CR43","first-page":"1","volume":"55","author":"M Zehlike","year":"2022","unstructured":"Zehlike, M., Yang, K., Stoyanovich, J.: Fairness in ranking, part i: Score-based ranking. ACM Comput. Sur. (CSUR) 55(6), 1\u201336 (2022)","journal-title":"ACM Comput. Sur. (CSUR)"},{"key":"40_CR44","doi-asserted-by":"crossref","unstructured":"Zheng, J., Chen, C.: Sorting-based interactive regret minimization. In: Proceedings of the 4th Asia Pacific Web (APWeb) and Web-Age Information Management (WAIM) Joint International Conference on Web and Big Data (APWeb-WAIM), pp. 473\u2013490 (2020)","DOI":"10.1007\/978-3-030-60290-1_36"},{"issue":"6","key":"40_CR45","doi-asserted-by":"publisher","DOI":"10.1007\/s11704-020-0178-7","volume":"15","author":"J Zheng","year":"2021","unstructured":"Zheng, J., Dong, Q., Qiu, X., Huang, X.: Accelerated algorithms for maximizing average happiness ratio in databases. Front. Comput. Sci. (FCS) 15(6), 156618 (2021)","journal-title":"Front. Comput. Sci. (FCS)"},{"key":"40_CR46","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.ins.2021.11.080","volume":"586","author":"J Zheng","year":"2022","unstructured":"Zheng, J., Dong, Q., Wang, X., Zhang, Y., Ma, W., Ma, Y.: Efficient processing of k-regret minimization queries with theoretical guarantees. Inf. Sci. 586, 99\u2013118 (2022)","journal-title":"Inf. Sci."},{"issue":"6","key":"40_CR47","doi-asserted-by":"publisher","first-page":"5680","DOI":"10.1109\/TKDE.2022.3166835","volume":"35","author":"J Zheng","year":"2023","unstructured":"Zheng, J., Ma, W., Wang, Y., Wang, X.: Continuous $$ k $$-regret minimization queries: a dynamic coreset approach. IEEE Trans. Knowl. Data Eng. (TKDE) 35(6), 5680\u20135694 (2023)","journal-title":"IEEE Trans. Knowl. Data Eng. (TKDE)"},{"key":"40_CR48","doi-asserted-by":"crossref","unstructured":"Zheng, J., Ma, Y., Ma, W., Wang, Y., Wang, X.: Happiness maximizing sets under group fairness constraints. In: Proceedings of the VLDB Endowment (PVLDB), pp. 291\u2013303 (2022)","DOI":"10.14778\/3565816.3565830"},{"issue":"7","key":"40_CR49","doi-asserted-by":"publisher","first-page":"3151","DOI":"10.1109\/TKDE.2023.3328596","volume":"36","author":"J Zheng","year":"2024","unstructured":"Zheng, J., et al.: Hybrid regret minimization: a submodular approach. IEEE Trans. Knowl. Data Eng. (TKDE) 36(7), 3151\u20133165 (2024)","journal-title":"IEEE Trans. Knowl. Data Eng. (TKDE)"},{"key":"40_CR50","doi-asserted-by":"crossref","unstructured":"Zhu, J., Pradhan, R., Glavic, B., Salimi, B.: Generating interpretable data-based explanations for fairness debugging using gopher. In: Proceedings of the 2022 International Conference on Management of Data (SIGMOD), pp. 2433\u20132436 (2022)","DOI":"10.1145\/3514221.3520170"},{"key":"40_CR51","doi-asserted-by":"crossref","unstructured":"Zhu, K., Zheng, J., Yang, Z., Dong, J.: Identifying rank-happiness maximizing sets under group fairness constraints. In: Proceedings of the 8th Asia-Pacific Web and Web-Age Information Management Joint International Conference on Web and Big Data (APWeb-WAIM), pp. 325\u2013341 (2024)","DOI":"10.1007\/978-981-97-7238-4_21"},{"key":"40_CR52","unstructured":"Zliobaite, I.: On the relation between accuracy and fairness in binary classification. In: Proceedings of the 2nd workshop on Fairness, Accountability, and Transparency in Machine Learning (FATML) at ICML\u201915, pp.\u00a01\u20135 (2015)"}],"container-title":["Lecture Notes in Computer Science","Web Information Systems Engineering - WISE 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-7394-3_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T09:43:38Z","timestamp":1780998218000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-7394-3_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819573936","9789819573943"],"references-count":52,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-7394-3_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"1 May 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WISE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web Information Systems Engineering","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Marrakech","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Morocco","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wise2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/wise2025.ficloud.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}