{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T20:09:09Z","timestamp":1742933349403,"version":"3.40.3"},"publisher-location":"Cham","reference-count":49,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031637346"},{"type":"electronic","value":"9783031637353"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-63735-3_2","type":"book-chapter","created":{"date-parts":[[2024,7,22]],"date-time":"2024-07-22T21:02:07Z","timestamp":1721682127000},"page":"10-49","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Theory of\u00a0Learning with\u00a0Competing Objectives and\u00a0User Feedback"],"prefix":"10.1007","author":[{"given":"Pranjal","family":"Awasthi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Corinna","family":"Cortes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yishay","family":"Mansour","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mehryar","family":"Mohri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,7,23]]},"reference":[{"key":"2_CR1","unstructured":"Agarwal, A., Beygelzimer, A., Dud\u00edk, M., Langford, J., Wallach, H.: A reductions approach to fair classification. arXiv preprint arXiv:1803.02453 (2018)"},{"key":"2_CR2","unstructured":"Angwin, J., Larson, J., Mattu, S., Kirchner, L.: Machine bias: there\u2019s software used across the country to predict future criminals. and it\u2019s biased against blacks 2016 (2019). https:\/\/www.propublica.org\/article\/machine-bias-risk-assessments-in-criminal-sentencing"},{"issue":"2\u20133","key":"2_CR3","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1023\/A:1013689704352","volume":"47","author":"P Auer","year":"2002","unstructured":"Auer, P., Cesa-Bianchi, N., Fischer, P.: Finite-time analysis of the multiarmed bandit problem. Mach. Learn. 47(2\u20133), 235\u2013256 (2002)","journal-title":"Mach. Learn."},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Bastani, O., Zhang, X., Solar-Lezama, A.: Probabilistic verification of fairness properties via concentration. Proc. ACM Program. Lang. 3(OOPSLA), 1\u201327 (2019)","DOI":"10.1145\/3360544"},{"key":"2_CR5","unstructured":"Bechavod, Y., Jung, C., Wu, Z.S.: Metric-free individual fairness in online learning. arXiv preprint arXiv:2002.05474 (2020)"},{"key":"2_CR6","unstructured":"Bellamy, R.K., et\u00a0al.: Ai fairness 360: an extensible toolkit for detecting, understanding, and mitigating unwanted algorithmic bias. arXiv preprint arXiv:1810.01943 (2018)"},{"key":"2_CR7","volume-title":"Online Computation and Competitive Analysis","author":"A Borodin","year":"1998","unstructured":"Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)"},{"key":"2_CR8","unstructured":"Cesa-Bianchi, N., Dekel, O., Shamir, O.: Online learning with switching costs and other adaptive adversaries. In: Advances in Neural Information Processing Systems, pp. 1160\u20131168 (2013)"},{"issue":"1","key":"2_CR9","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s11257-011-9108-6","volume":"22","author":"L Chen","year":"2012","unstructured":"Chen, L., Pu, P.: Critiquing-based recommenders: survey and emerging trends. User Model. User-Adap. Inter. 22(1), 125\u2013150 (2012)","journal-title":"User Model. User-Adap. Inter."},{"key":"2_CR10","first-page":"20485","volume":"33","author":"C Cortes","year":"2020","unstructured":"Cortes, C., Mohri, M., Gonzalvo, J., Storcheus, D.: Agnostic learning with multiple objectives. Adv. Neural. Inf. Process. Syst. 33, 20485\u201320495 (2020)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Coston, A., et al.: Fair transfer learning with missing protected attributes. In: Proceedings of the 2019 AAAI\/ACM Conference on AI, Ethics, and Society, pp. 91\u201398 (2019)","DOI":"10.1145\/3306618.3314236"},{"key":"2_CR12","unstructured":"Cotter, A., et al.: Training well-generalizing classifiers for fairness metrics and other data-dependent constraints. arXiv preprint arXiv:1807.00028 (2018)"},{"key":"2_CR13","unstructured":"Cotter, A., Jiang, H., Sridharan, K.: Two-player games for efficient non-convex constrained optimization. arXiv preprint arXiv:1804.06500 (2018)"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Doroudi, S., Thomas, P.S., Brunskill, E.: Importance sampling for fair policy selection. Grantee Submission (2017)","DOI":"10.24963\/ijcai.2018\/729"},{"key":"2_CR15","unstructured":"Dwork, C., Immorlica, N., Kalai, A.T., Leiserson, M.: Decoupled classifiers for group-fair and efficient machine learning. In: Conference on Fairness, Accountability and Transparency, pp. 119\u2013133 (2018)"},{"key":"2_CR16","unstructured":"Feller, A., Pierson, E., Corbett-Davies, S., Goel, S.: A computer program used for bail and sentencing decisions was labeled biased against blacks. it\u2019s actually not that clear. The Washington Post (2016)"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Ghosh, B., Basu, D., Meel, K.S.: Justicia: a stochastic sat approach to formally verify fairness. arXiv preprint arXiv:2009.06516 (2020)","DOI":"10.1609\/aaai.v35i9.16925"},{"key":"2_CR18","unstructured":"Gupta, M., Cotter, A., Fard, M.M., Wang, S.: Proxy fairness. arXiv preprint arXiv:1806.11212 (2018)"},{"key":"2_CR19","unstructured":"Gupta, V., Nokhiz, P., Roy, C.D., Venkatasubramanian, S.: Equalizing recourse across groups. arXiv preprint arXiv:1909.03166 (2019)"},{"key":"2_CR20","unstructured":"Hashimoto, T.B., Srivastava, M., Namkoong, H., Liang, P.: Fairness without demographics in repeated loss minimization. arXiv preprint arXiv:1806.08010 (2018)"},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"Holstein, K., Wortman\u00a0Vaughan, J., Daum\u00e9\u00a0III, H., Dudik, M., Wallach, H.: Improving fairness in machine learning systems: what do industry practitioners need? In: Proceedings of the 2019 CHI Conference on Human Factors in Computing Systems, pp. 1\u201316 (2019)","DOI":"10.1145\/3290605.3300830"},{"key":"2_CR22","unstructured":"Jabbari, S., Joseph, M., Kearns, M., Morgenstern, J., Roth, A.: Fairness in reinforcement learning. In: Proceedings of the 34th International Conference on Machine Learning, vol. 70, pp. 1617\u20131626. JMLR.org (2017)"},{"issue":"Apr","key":"2_CR23","first-page":"1563","volume":"11","author":"T Jaksch","year":"2010","unstructured":"Jaksch, T., Ortner, R., Auer, P.: Near-optimal regret bounds for reinforcement learning. J. Mach. Learn. Res. 11(Apr), 1563\u20131600 (2010)","journal-title":"J. Mach. Learn. Res."},{"key":"2_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-33019-4","volume-title":"Multi-objective Machine Learning","author":"Y Jin","year":"2006","unstructured":"Jin, Y.: Multi-objective Machine Learning, vol. 16. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/3-540-33019-4"},{"issue":"3","key":"2_CR25","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1109\/TSMCC.2008.919172","volume":"38","author":"Y Jin","year":"2008","unstructured":"Jin, Y., Sendhoff, B.: Pareto-based multiobjective machine learning: an overview and case studies. IEEE Trans. Syst. Man Cybern. Part C (Appl. Rev.) 38(3), 397\u2013415 (2008)","journal-title":"IEEE Trans. Syst. Man Cybern. Part C (Appl. Rev.)"},{"issue":"1","key":"2_CR26","first-page":"1","volume":"7","author":"M Kaminskas","year":"2016","unstructured":"Kaminskas, M., Bridge, D.: Diversity, serendipity, novelty, and coverage: a survey and empirical analysis of beyond-accuracy objectives in recommender systems. ACM Trans. Interact. Intell. Syst. (TiiS) 7(1), 1\u201342 (2016)","journal-title":"ACM Trans. Interact. Intell. Syst. (TiiS)"},{"key":"2_CR27","doi-asserted-by":"crossref","unstructured":"Kannan, S., Roth, A., Ziani, J.: Downstream effects of affirmative action. In: Proceedings of the Conference on Fairness, Accountability, and Transparency, pp. 240\u2013248 (2019)","DOI":"10.1145\/3287560.3287578"},{"issue":"1\u20134","key":"2_CR28","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/BF01762111","volume":"3","author":"AR Karlin","year":"1988","unstructured":"Karlin, A.R., Manasse, M.S., Rudolph, L., Sleator, D.D.: Competitive snoopy caching. Algorithmica 3(1\u20134), 79\u2013119 (1988)","journal-title":"Algorithmica"},{"key":"2_CR29","unstructured":"Kearns, M., Roth, A., Sharifi-Malvajerdi, S.: Average individual fairness: algorithms, generalization and experiments. arXiv preprint arXiv:1905.10607 (2019)"},{"key":"2_CR30","doi-asserted-by":"crossref","unstructured":"Kleinberg, J., Mullainathan, S., Raghavan, M.: Inherent trade-offs in the fair determination of risk scores. In: Innovations in Theoretical Computer Science Conference (ITCS) (2017)","DOI":"10.1145\/3219617.3219634"},{"key":"2_CR31","unstructured":"Kohavi, R.: Scaling up the accuracy of naive-bayes classifiers: a decision-tree hybrid. In: KDD 1996, pp. 202\u2013207 (1996)"},{"key":"2_CR32","unstructured":"Lamy, A., Zhong, Z., Menon, A.K., Verma, N.: Noise-tolerant fair classification. In: Advances in Neural Information Processing Systems, pp. 294\u2013305 (2019)"},{"key":"2_CR33","doi-asserted-by":"crossref","unstructured":"Lin, X., et al.: A pareto-efficient algorithm for multiple objective optimization in e-commerce recommendation. In: Proceedings of the 13th ACM Conference on Recommender Systems, pp. 20\u201328 (2019)","DOI":"10.1145\/3298689.3346998"},{"key":"2_CR34","doi-asserted-by":"crossref","unstructured":"Liu, L.T., Dean, S., Rolf, E., Simchowitz, M., Hardt, M.: Delayed impact of fair machine learning. arXiv preprint arXiv:1803.04383 (2018)","DOI":"10.24963\/ijcai.2019\/862"},{"issue":"6","key":"2_CR35","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/s00158-003-0368-6","volume":"26","author":"RT Marler","year":"2004","unstructured":"Marler, R.T., Arora, J.S.: Survey of multi-objective optimization methods for engineering. Struct. Multidiscip. Optim. 26(6), 369\u2013395 (2004)","journal-title":"Struct. Multidiscip. Optim."},{"key":"2_CR36","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1007\/978-0-387-85820-3_21","volume-title":"Recommender Systems Handbook","author":"J Masthoff","year":"2011","unstructured":"Masthoff, J.: Group recommender systems: combining individual models. In: Ricci, F., Rokach, L., Shapira, B., Kantor, P.B. (eds.) Recommender Systems Handbook, pp. 677\u2013702. Springer, Boston, MA (2011). https:\/\/doi.org\/10.1007\/978-0-387-85820-3_21"},{"key":"2_CR37","unstructured":"Menon, A.K., Williamson, R.C.: The cost of fairness in binary classification. In: Conference on Fairness, Accountability and Transparency, pp. 107\u2013118 (2018)"},{"key":"2_CR38","unstructured":"Mohri, M., Sivek, G., Suresh, A.T.: Agnostic federated learning. In: International Conference on Machine Learning, pp. 4615\u20134625. PMLR (2019)"},{"key":"2_CR39","doi-asserted-by":"crossref","unstructured":"Mouzannar, H., Ohannessian, M.I., Srebro, N.: From fair decision making to social equality. In: Proceedings of the Conference on Fairness, Accountability, and Transparency, pp. 359\u2013368 (2019)","DOI":"10.1145\/3287560.3287599"},{"key":"2_CR40","unstructured":"Sener, O., Koltun, V.: Multi-task learning as multi-objective optimization. arXiv preprint arXiv:1810.04650 (2018)"},{"key":"2_CR41","unstructured":"Shah, A., Ghahramani, Z.: Pareto frontier learning with expensive correlated objectives. In: International Conference on Machine Learning, pp. 1919\u20131927. PMLR (2016)"},{"key":"2_CR42","doi-asserted-by":"crossref","unstructured":"Simchi-Levi, D., Xu, Y.: Phase transitions and cyclic phenomena in bandits with switching constraints. In: Advances in Neural Information Processing Systems, pp. 7521\u20137530 (2019)","DOI":"10.2139\/ssrn.3380783"},{"key":"2_CR43","unstructured":"Speicher, T., et al.: Potential for discrimination in online targeted advertising. In: Conference on Fairness, Accountability and Transparency, pp. 5\u201319. PMLR (2018)"},{"issue":"6468","key":"2_CR44","doi-asserted-by":"publisher","first-page":"999","DOI":"10.1126\/science.aag3311","volume":"366","author":"PS Thomas","year":"2019","unstructured":"Thomas, P.S., da Silva, B.C., Barto, A.G., Giguere, S., Brun, Y., Brunskill, E.: Preventing undesirable behavior of intelligent machines. Science 366(6468), 999\u20131004 (2019)","journal-title":"Science"},{"key":"2_CR45","unstructured":"Tsirtsis, S., Gomez-Rodriguez, M.: Decisions, counterfactual explanations and strategic behavior. arXiv preprint arXiv:2002.04333 (2020)"},{"key":"2_CR46","unstructured":"Wang, S., Guo, W., Narasimhan, H., Cotter, A., Gupta, M., Jordan, M.I.: Robust optimization for fairness with noisy protected groups. arXiv preprint arXiv:2002.09343 (2020)"},{"key":"2_CR47","unstructured":"Wen, M., Bastani, O., Topcu, U.: Fairness with dynamics. arXiv preprint arXiv:1901.08568 (2019)"},{"key":"2_CR48","doi-asserted-by":"crossref","unstructured":"Xiao, L., Min, Z., Yongfeng, Z., Zhaoquan, G., Yiqun, L., Shaoping, M.: Fairness-aware group recommendation with pareto-efficiency. In: Proceedings of the Eleventh ACM Conference on Recommender Systems, pp. 107\u2013115 (2017)","DOI":"10.1145\/3109859.3109887"},{"key":"2_CR49","doi-asserted-by":"crossref","unstructured":"Yu, B., Yuan, Y., Terveen, L., Wu, Z.S., Forlizzi, J., Zhu, H.: Keeping designers in the loop: communicating inherent algorithmic trade-offs across multiple objectives. In: Proceedings of the 2020 ACM Designing Interactive Systems Conference, pp. 1245\u20131257 (2020)","DOI":"10.1145\/3357236.3395528"}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence and Image Analysis"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-63735-3_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,22]],"date-time":"2024-07-22T21:03:24Z","timestamp":1721682204000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-63735-3_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031637346","9783031637353"],"references-count":49,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-63735-3_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"23 July 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Artificial Intelligence and Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Fort Lauderdale, FL","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 January 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 January 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"isaim2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/isaim2024.cs.ou.edu\/iwcia.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}