Responsible RecSys by Design: Approximation Algorithms for Calibrated Recommendations with Sponsored Items
Uloženo v:
| Název: | Responsible RecSys by Design: Approximation Algorithms for Calibrated Recommendations with Sponsored Items |
|---|---|
| Autoři: | Jing Yuan, Shaojie Tang, Shuzhang Cai, Yao Wang |
| Zdroj: | Proceedings of the International AAAI Conference on Web and Social Media. 19:2197-2209 |
| Informace o vydavateli: | Association for the Advancement of Artificial Intelligence (AAAI), 2025. |
| Rok vydání: | 2025 |
| Popis: | Calibrated Recommendation Systems (CRS) balance user preferences with constraints like diversity, fairness, and novelty to create inclusive recommendation lists. However, existing research often overlooks the mandatory inclusion of sponsored items, assuming unrestricted product selection. In practice, sponsored items, paid for by advertisers, must be included, which can conflict with CRS goals when advertisers' priorities misalign with system objectives. This paper addresses this gap by formulating CRS with sponsored items as a combinatorial optimization problem. We develop efficient approximation algorithms to generate the most calibrated recommendation lists while meeting sponsorship requirements. |
| Druh dokumentu: | Article |
| ISSN: | 2334-0770 2162-3449 |
| DOI: | 10.1609/icwsm.v19i1.35928 |
| Přístupové číslo: | edsair.doi...........aab83d039da21661e80885a2829d75d3 |
| Databáze: | OpenAIRE |
Nájsť tento článok vo Web of Science | Abstrakt: | Calibrated Recommendation Systems (CRS) balance user preferences with constraints like diversity, fairness, and novelty to create inclusive recommendation lists. However, existing research often overlooks the mandatory inclusion of sponsored items, assuming unrestricted product selection. In practice, sponsored items, paid for by advertisers, must be included, which can conflict with CRS goals when advertisers' priorities misalign with system objectives. This paper addresses this gap by formulating CRS with sponsored items as a combinatorial optimization problem. We develop efficient approximation algorithms to generate the most calibrated recommendation lists while meeting sponsorship requirements. |
|---|---|
| ISSN: | 23340770 21623449 |
| DOI: | 10.1609/icwsm.v19i1.35928 |