{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T22:21:55Z","timestamp":1772749315430,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":50,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,9,13]],"date-time":"2021-09-13T00:00:00Z","timestamp":1631491200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100002913","name":"Vlaamse Overheid","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002913","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,9,13]]},"DOI":"10.1145\/3460231.3474248","type":"proceedings-article","created":{"date-parts":[[2021,9,13]],"date-time":"2021-09-13T21:45:02Z","timestamp":1631569502000},"page":"310-320","source":"Crossref","is-referenced-by-count":20,"title":["Top-K Contextual Bandits with Equity of Exposure"],"prefix":"10.1145","author":[{"given":"Olivier","family":"Jeunen","sequence":"first","affiliation":[{"name":"University of Antwerp, Belgium"}]},{"given":"Bart","family":"Goethals","sequence":"additional","affiliation":[{"name":"University of Antwerp, Belgium"}]}],"member":"320","published-online":{"date-parts":[[2021,9,13]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11257-019-09256-1"},{"key":"e_1_3_2_2_2_1","unstructured":"S. Barocas M. Hardt and A. Narayanan. 2019. Fairness and Machine Learning. fairmlbook.org. http:\/\/www.fairmlbook.org.  S. Barocas M. Hardt and A. Narayanan. 2019. Fairness and Machine Learning. fairmlbook.org. http:\/\/www.fairmlbook.org."},{"key":"e_1_3_2_2_3_1","volume-title":"Proc. of the 14th ACM Conference on Recommender Systems(RecSys \u201920)","author":"Bendada W.","unstructured":"W. Bendada , G. Salha , and T. Bontempelli . 2020. Carousel Personalization in Music Streaming Apps with Contextual Bandits . In Proc. of the 14th ACM Conference on Recommender Systems(RecSys \u201920) . ACM, 420\u2013425. W. Bendada, G. Salha, and T. Bontempelli. 2020. Carousel Personalization in Music Streaming Apps with Contextual Bandits. In Proc. of the 14th ACM Conference on Recommender Systems(RecSys \u201920). ACM, 420\u2013425."},{"key":"e_1_3_2_2_4_1","volume-title":"Proc. of the 25th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining(KDD \u201919)","author":"Beutel A.","unstructured":"A. Beutel , J. Chen , T. Doshi , H. Qian , L. Wei , Y. Wu , L. Heldt , Z. Zhao , L. Hong , E.\u00a0 H. Chi , and C. Goodrow . 2019. Fairness in Recommendation Ranking through Pairwise Comparisons . In Proc. of the 25th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining(KDD \u201919) . ACM, 2212\u20132220. A. Beutel, J. Chen, T. Doshi, H. Qian, L. Wei, Y. Wu, L. Heldt, Z. Zhao, L. Hong, E.\u00a0H. Chi, and C. Goodrow. 2019. Fairness in Recommendation Ranking through Pairwise Comparisons. In Proc. of the 25th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining(KDD \u201919). ACM, 2212\u20132220."},{"key":"e_1_3_2_2_5_1","volume-title":"Proc. of the 41st International ACM SIGIR Conference on Research and Development in Information Retrieval(SIGIR \u201918)","author":"Biega J.","unstructured":"A.\u00a0 J. Biega , K.\u00a0 P. Gummadi , and G. Weikum . 2018. Equity of Attention: Amortizing Individual Fairness in Rankings . In Proc. of the 41st International ACM SIGIR Conference on Research and Development in Information Retrieval(SIGIR \u201918) . ACM, 405\u2013414. A.\u00a0J. Biega, K.\u00a0P. Gummadi, and G. Weikum. 2018. Equity of Attention: Amortizing Individual Fairness in Rankings. In Proc. of the 41st International ACM SIGIR Conference on Research and Development in Information Retrieval(SIGIR \u201918). ACM, 405\u2013414."},{"key":"e_1_3_2_2_6_1","volume-title":"Individually Fair Rankings. In International Conference on Learning Representations(ICLR \u201921)","author":"Bower A.","unstructured":"A. Bower , H. Eftekhari , M. Yurochkin , and Y. Sun . 2021 . Individually Fair Rankings. In International Conference on Learning Representations(ICLR \u201921) . A. Bower, H. Eftekhari, M. Yurochkin, and Y. Sun. 2021. Individually Fair Rankings. In International Conference on Learning Representations(ICLR \u201921)."},{"key":"e_1_3_2_2_7_1","unstructured":"R. Burke. 2017. Multisided Fairness for Recommendation. CoRR abs\/1707.00093(2017). arxiv:1707.00093  R. Burke. 2017. Multisided Fairness for Recommendation. CoRR abs\/1707.00093(2017). arxiv:1707.00093"},{"key":"e_1_3_2_2_8_1","volume-title":"Proc. of the 24th International Conference on Neural Information Processing Systems(NIPS\u201911)","author":"Chapelle O.","unstructured":"O. Chapelle and L. Li . 2011. An Empirical Evaluation of Thompson Sampling . In Proc. of the 24th International Conference on Neural Information Processing Systems(NIPS\u201911) . 2249\u20132257. O. Chapelle and L. Li. 2011. An Empirical Evaluation of Thompson Sampling. In Proc. of the 24th International Conference on Neural Information Processing Systems(NIPS\u201911). 2249\u20132257."},{"key":"e_1_3_2_2_9_1","volume-title":"Proc. of the 18th ACM Conference on Information and Knowledge Management(CIKM \u201909)","author":"Chapelle O.","unstructured":"O. Chapelle , D. Metlzer , Y. Zhang , and P. Grinspan . 2009. Expected Reciprocal Rank for Graded Relevance . In Proc. of the 18th ACM Conference on Information and Knowledge Management(CIKM \u201909) . ACM, 621\u2013630. O. Chapelle, D. Metlzer, Y. Zhang, and P. Grinspan. 2009. Expected Reciprocal Rank for Graded Relevance. In Proc. of the 18th ACM Conference on Information and Knowledge Management(CIKM \u201909). ACM, 621\u2013630."},{"key":"e_1_3_2_2_10_1","volume-title":"Proc. of the 18th International Conference on World Wide Web(WWW \u201909)","author":"Chapelle O.","unstructured":"O. Chapelle and Y. Zhang . 2009. A Dynamic Bayesian Network Click Model for Web Search Ranking . In Proc. of the 18th International Conference on World Wide Web(WWW \u201909) . ACM, 1\u201310. O. Chapelle and Y. Zhang. 2009. A Dynamic Bayesian Network Click Model for Web Search Ranking. In Proc. of the 18th International Conference on World Wide Web(WWW \u201909). ACM, 1\u201310."},{"key":"e_1_3_2_2_11_1","volume-title":"Proc. of the 12th ACM International Conference on Web Search and Data Mining(WSDM \u201919)","author":"Chen M.","year":"2019","unstructured":"M. Chen , A. Beutel , P. Covington , S. Jain , F. Belletti , and E.\u00a0 H. Chi . 2019 . Top-K Off-Policy Correction for a REINFORCE Recommender System . In Proc. of the 12th ACM International Conference on Web Search and Data Mining(WSDM \u201919) . ACM, 456\u2013464. M. Chen, A. Beutel, P. Covington, S. Jain, F. Belletti, and E.\u00a0H. Chi. 2019. Top-K Off-Policy Correction for a REINFORCE Recommender System. In Proc. of the 12th ACM International Conference on Web Search and Data Mining(WSDM \u201919). ACM, 456\u2013464."},{"key":"e_1_3_2_2_12_1","volume-title":"Proc. of the 36th Conference on Uncertainty in Artificial Intelligence (UAI), Vol.\u00a0124","author":"Chen Y.","unstructured":"Y. Chen , A. Cuellar , H. Luo , J. Modi , H. Nemlekar , and S. Nikolaidis . 2020. Fair Contextual Multi-Armed Bandits: Theory and Experiments . In Proc. of the 36th Conference on Uncertainty in Artificial Intelligence (UAI), Vol.\u00a0124 . PMLR, 181\u2013190. Y. Chen, A. Cuellar, H. Luo, J. Modi, H. Nemlekar, and S. Nikolaidis. 2020. Fair Contextual Multi-Armed Bandits: Theory and Experiments. In Proc. of the 36th Conference on Uncertainty in Artificial Intelligence (UAI), Vol.\u00a0124. PMLR, 181\u2013190."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"crossref","unstructured":"A. Chuklin I. Markov and M. de Rijke. 2015. Click models for web search. Synthesis lectures on information concepts retrieval and services 7 3(2015) 1\u2013115.  A. Chuklin I. Markov and M. de Rijke. 2015. Click models for web search. Synthesis lectures on information concepts retrieval and services 7 3(2015) 1\u2013115.","DOI":"10.2200\/S00654ED1V01Y201507ICR043"},{"key":"e_1_3_2_2_14_1","volume-title":"Proc. of the 13th ACM Conference on Recommender Systems(RecSys \u201919)","author":"Dacrema F.","unstructured":"M.\u00a0 F. Dacrema , P. Cremonesi , and D. Jannach . 2019. Are We Really Making Much Progress? A Worrying Analysis of Recent Neural Recommendation Approaches . In Proc. of the 13th ACM Conference on Recommender Systems(RecSys \u201919) . ACM, 101\u2013109. M.\u00a0F. Dacrema, P. Cremonesi, and D. Jannach. 2019. Are We Really Making Much Progress? A Worrying Analysis of Recent Neural Recommendation Approaches. In Proc. of the 13th ACM Conference on Recommender Systems(RecSys \u201919). ACM, 101\u2013109."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"crossref","unstructured":"Y. Deldjoo V.\u00a0W. Anelli H. Zamani A. Bellog\u00edn and T. Di Noia. 2021. A flexible framework for evaluating user and item fairness in recommender systems. User Modeling and User-Adapted Interaction(2021).  Y. Deldjoo V.\u00a0W. Anelli H. Zamani A. Bellog\u00edn and T. Di Noia. 2021. A flexible framework for evaluating user and item fairness in recommender systems. User Modeling and User-Adapted Interaction(2021).","DOI":"10.1007\/s11257-020-09285-1"},{"key":"e_1_3_2_2_16_1","volume-title":"Proc. of the 29th ACM International Conference on Information and Knowledge Management(CIKM \u201920)","author":"Diaz F.","unstructured":"F. Diaz , B. Mitra , M.\u00a0 D. Ekstrand , A.\u00a0 J. Biega , and B. Carterette . 2020. Evaluating Stochastic Rankings with Expected Exposure . In Proc. of the 29th ACM International Conference on Information and Knowledge Management(CIKM \u201920) . ACM, 275\u2013284. F. Diaz, B. Mitra, M.\u00a0D. Ekstrand, A.\u00a0J. Biega, and B. Carterette. 2020. Evaluating Stochastic Rankings with Expected Exposure. In Proc. of the 29th ACM International Conference on Information and Knowledge Management(CIKM \u201920). ACM, 275\u2013284."},{"key":"e_1_3_2_2_17_1","unstructured":"B. Dumitrascu K. Feng and B.\u00a0E. Engelhardt. 2018. PG-TS: Improved Thompson Sampling for Logistic Contextual Bandits. In Advances in Neural Information Processing Systems 30(NeurIPS\u201918). 4629\u20134638.  B. Dumitrascu K. Feng and B.\u00a0E. Engelhardt. 2018. PG-TS: Improved Thompson Sampling for Logistic Contextual Bandits. In Advances in Neural Information Processing Systems 30(NeurIPS\u201918). 4629\u20134638."},{"key":"e_1_3_2_2_18_1","volume-title":"Proc. of the 8th ACM Conference on Recommender Systems(RecSys \u201914)","author":"Garcin F.","unstructured":"F. Garcin , B. Faltings , O. Donatsch , A. Alazzawi , C. Bruttin , and A. Huber . 2014. Offline and Online Evaluation of News Recommender Systems at Swissinfo.Ch . In Proc. of the 8th ACM Conference on Recommender Systems(RecSys \u201914) . 169\u2013176. F. Garcin, B. Faltings, O. Donatsch, A. Alazzawi, C. Bruttin, and A. Huber. 2014. Offline and Online Evaluation of News Recommender Systems at Swissinfo.Ch. In Proc. of the 8th ACM Conference on Recommender Systems(RecSys \u201914). 169\u2013176."},{"key":"e_1_3_2_2_19_1","volume-title":"Proc. of the Eleventh ACM International Conference on Web Search and Data Mining(WSDM \u201918)","author":"Gilotte A.","unstructured":"A. Gilotte , C. Calauz\u00e8nes , T. Nedelec , A. Abraham , and S. Doll\u00e9 . 2018. Offline A\/B Testing for Recommender Systems . In Proc. of the Eleventh ACM International Conference on Web Search and Data Mining(WSDM \u201918) . ACM, 198\u2013206. A. Gilotte, C. Calauz\u00e8nes, T. Nedelec, A. Abraham, and S. Doll\u00e9. 2018. Offline A\/B Testing for Recommender Systems. In Proc. of the Eleventh ACM International Conference on Web Search and Data Mining(WSDM \u201918). ACM, 198\u2013206."},{"key":"e_1_3_2_2_20_1","volume-title":"Proc. of the 28th International Joint Conference on Artificial Intelligence(IJCAI \u201919)","author":"Ie E.","unstructured":"E. Ie , V. Jain , J. Wang , S. Narvekar , R. Agarwal , R. Wu , H. Cheng , T. Chandra , and C. Boutilier . 2019. SlateQ: A Tractable Decomposition for Reinforcement Learning with Recommendation Sets . In Proc. of the 28th International Joint Conference on Artificial Intelligence(IJCAI \u201919) . 2592\u20132599. E. Ie, V. Jain, J. Wang, S. Narvekar, R. Agarwal, R. Wu, H. Cheng, T. Chandra, and C. Boutilier. 2019. SlateQ: A Tractable Decomposition for Reinforcement Learning with Recommendation Sets. In Proc. of the 28th International Joint Conference on Artificial Intelligence(IJCAI \u201919). 2592\u20132599."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3298689.3347069"},{"key":"e_1_3_2_2_22_1","volume-title":"Proc. of the 15th ACM Conference on Recommender Systems(RecSys \u201921)","author":"Jeunen O.","unstructured":"O. Jeunen and B. Goethals . 2021. Pessimistic Reward Models for Off-Policy Learning in Recommendation . In Proc. of the 15th ACM Conference on Recommender Systems(RecSys \u201921) . ACM. O. Jeunen and B. Goethals. 2021. Pessimistic Reward Models for Off-Policy Learning in Recommendation. In Proc. of the 15th ACM Conference on Recommender Systems(RecSys \u201921). ACM."},{"key":"e_1_3_2_2_23_1","volume-title":"Proc. of the ACM RecSys Workshop on Reinforcement Learning and Robust Estimators for Recommendation(REVEAL \u201919)","author":"Jeunen O.","unstructured":"O. Jeunen , D. Rohde , and F. Vasile . 2019. On the Value of Bandit Feedback for Offline Recommender System Evaluation . In Proc. of the ACM RecSys Workshop on Reinforcement Learning and Robust Estimators for Recommendation(REVEAL \u201919) . O. Jeunen, D. Rohde, and F. Vasile. 2019. On the Value of Bandit Feedback for Offline Recommender System Evaluation. In Proc. of the ACM RecSys Workshop on Reinforcement Learning and Robust Estimators for Recommendation(REVEAL \u201919)."},{"key":"e_1_3_2_2_24_1","volume-title":"Proc. of the 26th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining(KDD \u201920)","author":"Jeunen O.","unstructured":"O. Jeunen , D. Rohde , F. Vasile , and M. Bompaire . 2020. Joint Policy-Value Learning for Recommendation . In Proc. of the 26th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining(KDD \u201920) . ACM, 1223\u20131233. O. Jeunen, D. Rohde, F. Vasile, and M. Bompaire. 2020. Joint Policy-Value Learning for Recommendation. In Proc. of the 26th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining(KDD \u201920). ACM, 1223\u20131233."},{"key":"e_1_3_2_2_25_1","volume-title":"Proc. of the 10th ACM International Conference on Web Search and Data Mining(WSDM \u201917)","author":"Joachims T.","unstructured":"T. Joachims , A. Swaminathan , and T. Schnabel . 2017. Unbiased Learning-to-Rank with Biased Feedback . In Proc. of the 10th ACM International Conference on Web Search and Data Mining(WSDM \u201917) . ACM, 781\u2013789. T. Joachims, A. Swaminathan, and T. Schnabel. 2017. Unbiased Learning-to-Rank with Biased Feedback. In Proc. of the 10th ACM International Conference on Web Search and Data Mining(WSDM \u201917). ACM, 781\u2013789."},{"key":"e_1_3_2_2_26_1","volume-title":"Learning: Classic and Contextual Bandits. In Advances in Neural Information Processing Systems(NeurIPS \u201916), Vol.\u00a029.","author":"Joseph M.","year":"2016","unstructured":"M. Joseph , M. Kearns , J.\u00a0 H. Morgenstern , and A. Roth . 2016 . Fairness in Learning: Classic and Contextual Bandits. In Advances in Neural Information Processing Systems(NeurIPS \u201916), Vol.\u00a029. M. Joseph, M. Kearns, J.\u00a0H. Morgenstern, and A. Roth. 2016. Fairness in Learning: Classic and Contextual Bandits. In Advances in Neural Information Processing Systems(NeurIPS \u201916), Vol.\u00a029."},{"key":"e_1_3_2_2_27_1","volume-title":"Proc. of the 14th ACM Conference on Recommender Systems(RecSys \u201920)","author":"Li C.","year":"2020","unstructured":"C. Li , H. Feng , and M. de Rijke . 2020 . Cascading Hybrid Bandits: Online Learning to Rank for Relevance and Diversity . In Proc. of the 14th ACM Conference on Recommender Systems(RecSys \u201920) . ACM, 33\u201342. C. Li, H. Feng, and M. de Rijke. 2020. Cascading Hybrid Bandits: Online Learning to Rank for Relevance and Diversity. In Proc. of the 14th ACM Conference on Recommender Systems(RecSys \u201920). ACM, 33\u201342."},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772758"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.881731"},{"key":"e_1_3_2_2_30_1","volume-title":"Proc. of the 13th ACM Conference on Recommender Systems(RecSys \u201919)","author":"Mehrotra R.","unstructured":"R. Mehrotra and B. Carterette . 2019. Recommendations in a Marketplace . In Proc. of the 13th ACM Conference on Recommender Systems(RecSys \u201919) . ACM, 580\u2013581. R. Mehrotra and B. Carterette. 2019. Recommendations in a Marketplace. In Proc. of the 13th ACM Conference on Recommender Systems(RecSys \u201919). ACM, 580\u2013581."},{"key":"e_1_3_2_2_31_1","volume-title":"Proc. of the 27th ACM International Conference on Information and Knowledge Management(CIKM \u201918)","author":"Mehrotra R.","unstructured":"R. Mehrotra , J. McInerney , H. Bouchard , M. Lalmas , and F. Diaz . 2018. Towards a Fair Marketplace: Counterfactual Evaluation of the Trade-off between Relevance, Fairness & Satisfaction in Recommendation Systems . In Proc. of the 27th ACM International Conference on Information and Knowledge Management(CIKM \u201918) . ACM, 2243\u20132251. R. Mehrotra, J. McInerney, H. Bouchard, M. Lalmas, and F. Diaz. 2018. Towards a Fair Marketplace: Counterfactual Evaluation of the Trade-off between Relevance, Fairness & Satisfaction in Recommendation Systems. In Proc. of the 27th ACM International Conference on Information and Knowledge Management(CIKM \u201918). ACM, 2243\u20132251."},{"key":"e_1_3_2_2_32_1","volume-title":"Divergent Recommendations. In Proc. of the 14th ACM Conference on Recommender Systems(RecSys \u201920)","author":"Mehrotra R.","unstructured":"R. Mehrotra , C. Shah , and B. Carterette . 2020. Investigating Listeners\u2019 Responses to Divergent Recommendations. In Proc. of the 14th ACM Conference on Recommender Systems(RecSys \u201920) . ACM, 692\u2013696. R. Mehrotra, C. Shah, and B. Carterette. 2020. Investigating Listeners\u2019 Responses to Divergent Recommendations. In Proc. of the 14th ACM Conference on Recommender Systems(RecSys \u201920). ACM, 692\u2013696."},{"key":"e_1_3_2_2_33_1","volume-title":"Proc. of the 26th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining(KDD \u201920)","author":"Mehrotra R.","unstructured":"R. Mehrotra , N. Xue , and M. Lalmas . 2020. Bandit Based Optimization of Multiple Objectives on a Music Streaming Platform . In Proc. of the 26th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining(KDD \u201920) . ACM, 3224\u20133233. R. Mehrotra, N. Xue, and M. Lalmas. 2020. Bandit Based Optimization of Multiple Objectives on a Music Streaming Platform. In Proc. of the 26th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining(KDD \u201920). ACM, 3224\u20133233."},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1416950.1416952"},{"key":"e_1_3_2_2_35_1","volume-title":"Proc. of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval(SIGIR \u201920)","author":"Morik M.","unstructured":"M. Morik , A. Singh , J. Hong , and T. Joachims . 2020. Controlling Fairness and Bias in Dynamic Learning-to-Rank . In Proc. of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval(SIGIR \u201920) . ACM, 429\u2013438. M. Morik, A. Singh, J. Hong, and T. Joachims. 2020. Controlling Fairness and Bias in Dynamic Learning-to-Rank. In Proc. of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval(SIGIR \u201920). ACM, 429\u2013438."},{"key":"e_1_3_2_2_36_1","volume-title":"Probabilistic Machine Learning: An introduction","author":"Murphy P.","unstructured":"K.\u00a0 P. Murphy . 2021. Probabilistic Machine Learning: An introduction . MIT Press . K.\u00a0P. Murphy. 2021. Probabilistic Machine Learning: An introduction. MIT Press."},{"key":"e_1_3_2_2_37_1","volume-title":"Proc. of the AAAI Conference on Artificial Intelligence 34","author":"Patil V.","year":"2020","unstructured":"V. Patil , G. Ghalme , V. Nair , and Y. Narahari . 2020. Achieving Fairness in the Stochastic Multi-Armed Bandit Problem . Proc. of the AAAI Conference on Artificial Intelligence 34 , 04 ( Apr. 2020 ), 5379\u20135386. V. Patil, G. Ghalme, V. Nair, and Y. Narahari. 2020. Achieving Fairness in the Stochastic Multi-Armed Bandit Problem. Proc. of the AAAI Conference on Artificial Intelligence 34, 04 (Apr. 2020), 5379\u20135386."},{"key":"e_1_3_2_2_38_1","volume-title":"Proc. of The Web Conference(WWW \u201920)","author":"Patro K.","unstructured":"G.\u00a0 K. Patro , A. Biswas , N. Ganguly , K.\u00a0 P. Gummadi , and A. Chakraborty . 2020. FairRec: Two-Sided Fairness for Personalized Recommendations in Two-Sided Platforms . In Proc. of The Web Conference(WWW \u201920) . ACM, 1194\u20131204. G.\u00a0K. Patro, A. Biswas, N. Ganguly, K.\u00a0P. Gummadi, and A. Chakraborty. 2020. FairRec: Two-Sided Fairness for Personalized Recommendations in Two-Sided Platforms. In Proc. of The Web Conference(WWW \u201920). ACM, 1194\u20131204."},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"crossref","unstructured":"J. Pearl. 2009. Causality. Cambridge university press.  J. Pearl. 2009. Causality. Cambridge university press.","DOI":"10.1017\/CBO9780511803161"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"crossref","unstructured":"M. Quadrana P. Cremonesi and D. Jannach. 2018. Sequence-Aware Recommender Systems. ACM Comput. Surv. Article Article 66 (July 2018) 36\u00a0pages.  M. Quadrana P. Cremonesi and D. Jannach. 2018. Sequence-Aware Recommender Systems. ACM Comput. Surv. Article Article 66 (July 2018) 36\u00a0pages.","DOI":"10.1145\/3190616"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"crossref","unstructured":"S.\u00a0E. Robertson. 1977. The probability ranking principle in IR. Journal of documentation(1977).  S.\u00a0E. Robertson. 1977. The probability ranking principle in IR. Journal of documentation(1977).","DOI":"10.1108\/eb026647"},{"key":"e_1_3_2_2_42_1","volume-title":"Proc. of the 10th ACM Conference on Recommender Systems(RecSys \u201916)","author":"Rossetti M.","unstructured":"M. Rossetti , F. Stella , and M. Zanker . 2016. Contrasting Offline and Online Results when Evaluating Recommendation Algorithms . In Proc. of the 10th ACM Conference on Recommender Systems(RecSys \u201916) . ACM, 31\u201334. M. Rossetti, F. Stella, and M. Zanker. 2016. Contrasting Offline and Online Results when Evaluating Recommendation Algorithms. In Proc. of the 10th ACM Conference on Recommender Systems(RecSys \u201916). ACM, 31\u201334."},{"key":"e_1_3_2_2_43_1","volume-title":"Proc. of the 26th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining(KDD \u201920)","author":"Sakhi O.","unstructured":"O. Sakhi , S. Bonner , D. Rohde , and F. Vasile . 2020. BLOB : A Probabilistic Model for Recommendation that Combines Organic and Bandit Signals . In Proc. of the 26th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining(KDD \u201920) . ACM, 783\u2013793. O. Sakhi, S. Bonner, D. Rohde, and F. Vasile. 2020. BLOB : A Probabilistic Model for Recommendation that Combines Organic and Bandit Signals. In Proc. of the 26th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining(KDD \u201920). ACM, 783\u2013793."},{"key":"e_1_3_2_2_44_1","volume-title":"Proc. of the 24th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining(KDD \u201918)","author":"Singh A.","unstructured":"A. Singh and T. Joachims . 2018. Fairness of Exposure in Rankings . In Proc. of the 24th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining(KDD \u201918) . ACM, 2219\u20132228. A. Singh and T. Joachims. 2018. Fairness of Exposure in Rankings. In Proc. of the 24th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining(KDD \u201918). ACM, 2219\u20132228."},{"key":"e_1_3_2_2_45_1","unstructured":"A. Singh and T. Joachims. 2019. Policy Learning for Fairness in Ranking. In Advances in Neural Information Processing Systems(NeurIPS \u201919) Vol.\u00a032.  A. Singh and T. Joachims. 2019. Policy Learning for Fairness in Ranking. In Advances in Neural Information Processing Systems(NeurIPS \u201919) Vol.\u00a032."},{"key":"e_1_3_2_2_46_1","volume-title":"Proc. of the 28th ACM Conference on User Modeling, Adaptation and Personalization(UMAP \u201920)","author":"Sonboli N.","unstructured":"N. Sonboli , F. Eskandanian , R. Burke , W. Liu , and B. Mobasher . 2020. Opportunistic Multi-Aspect Fairness through Personalized Re-Ranking . In Proc. of the 28th ACM Conference on User Modeling, Adaptation and Personalization(UMAP \u201920) . ACM, 239\u2013247. N. Sonboli, F. Eskandanian, R. Burke, W. Liu, and B. Mobasher. 2020. Opportunistic Multi-Aspect Fairness through Personalized Re-Ranking. In Proc. of the 28th ACM Conference on User Modeling, Adaptation and Personalization(UMAP \u201920). ACM, 239\u2013247."},{"key":"e_1_3_2_2_47_1","volume-title":"Proc. of the 7th ACM Conference on Recommender Systems(RecSys \u201913)","author":"Steck H.","year":"2013","unstructured":"H. Steck . 2013 . Evaluation of Recommendations: Rating-prediction and Ranking . In Proc. of the 7th ACM Conference on Recommender Systems(RecSys \u201913) . ACM, 213\u2013220. H. Steck. 2013. Evaluation of Recommendations: Rating-prediction and Ranking. In Proc. of the 7th ACM Conference on Recommender Systems(RecSys \u201913). ACM, 213\u2013220."},{"key":"e_1_3_2_2_48_1","volume-title":"Proc. of the 12th ACM Conference on Recommender Systems(RecSys \u201918)","author":"Burke R.","year":"2018","unstructured":"\u00d6. S\u00fcrer, R. Burke , and E.\u00a0 C. Malthouse . 2018 . Multistakeholder Recommendation with Provider Constraints . In Proc. of the 12th ACM Conference on Recommender Systems(RecSys \u201918) . ACM, 54\u201362. \u00d6. S\u00fcrer, R. Burke, and E.\u00a0C. Malthouse. 2018. Multistakeholder Recommendation with Provider Constraints. In Proc. of the 12th ACM Conference on Recommender Systems(RecSys \u201918). ACM, 54\u201362."},{"key":"e_1_3_2_2_49_1","volume-title":"Fairness of Exposure in Stochastic Bandits. In International Conference on Machine Learning(ICML\u201921)","author":"Wang L.","unstructured":"L. Wang , Y. Bai , W. Sun , and T. Joachims . 2021 . Fairness of Exposure in Stochastic Bandits. In International Conference on Machine Learning(ICML\u201921) . L. Wang, Y. Bai, W. Sun, and T. Joachims. 2021. Fairness of Exposure in Stochastic Bandits. In International Conference on Machine Learning(ICML\u201921)."},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3462953"}],"event":{"name":"RecSys '21: Fifteenth ACM Conference on Recommender Systems","location":"Amsterdam Netherlands","acronym":"RecSys '21","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGAI ACM Special Interest Group on Artificial Intelligence","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","SIGIR ACM Special Interest Group on Information Retrieval","SIGCHI ACM Special Interest Group on Computer-Human Interaction","SIGecom Special Interest Group on Economics and Computation"]},"container-title":["Fifteenth ACM Conference on Recommender Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3460231.3474248","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3460231.3474248","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:12:17Z","timestamp":1750191137000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3460231.3474248"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,13]]},"references-count":50,"alternative-id":["10.1145\/3460231.3474248","10.1145\/3460231"],"URL":"https:\/\/doi.org\/10.1145\/3460231.3474248","relation":{},"subject":[],"published":{"date-parts":[[2021,9,13]]}}}