{"total":19,"rows":[{"id":"2205.13026","title":"Preference Dynamics Under Personalized Recommendations","created":"2022-05-25","cited_by_count":25,"area":null},{"id":"2203.13423","title":"Modeling Attrition in Recommender Systems with Departing Bandits","created":"2022-03-25","cited_by_count":11,"area":null},{"id":"2404.12366","title":"Accounting for AI and Users Shaping One Another: The Role of Mathematical Models","created":"2024-04-18","cited_by_count":11,"area":null},{"id":"2110.11819","title":"A Last Switch Dependent Analysis of Satiation and Seasonality in Bandits","created":"2021-10-22","cited_by_count":8,"area":null},{"id":"2302.01377","title":"Learning with Exposure Constraints in Recommendation Systems","created":"2023-02-02","cited_by_count":8,"area":null},{"id":"2302.08345","title":"Linear Bandits with Memory: from Rotting to Rising","created":"2023-02-16","cited_by_count":6,"area":null},{"id":"2409.16499","title":"Learning Linear Dynamics from Bilinear Observations","created":"2024-09-24","cited_by_count":6,"area":null},{"id":"2205.14790","title":"Non-Stationary Bandits under Recharging Payoffs: Improved Planning with Sublinear Regret","created":"2022-05-29","cited_by_count":5,"area":null},{"id":"2302.06014","title":"Online Recommendations for Agents with Discounted Adaptive Preferences","created":"2023-02-12","cited_by_count":5,"area":null},{"id":"2105.10625","title":"Combinatorial Blocking Bandits with Stochastic Delays","created":"2021-05-22","cited_by_count":3,"area":null},{"id":"2211.13585","title":"Learning to Suggest Breaks: Sustainable Optimization of Long-Term User Engagement","created":"2022-11-24","cited_by_count":3,"area":null},{"id":"2307.11655","title":"Preferences Evolve And So Should Your Bandits: Bandits with Evolving States for Online Platforms","created":"2023-07-21","cited_by_count":2,"area":null},{"id":"2510.16208","title":"Explore-then-Commit for Nonstationary Linear Bandits with Latent Dynamics","created":"2025-10-17","cited_by_count":2,"area":null},{"id":"2304.09088","title":"A Field Test of Bandit Algorithms for Recommendations: Understanding the Validity of Assumptions on Human Preferences in Multi-armed Bandits","created":"2023-04-16","cited_by_count":1,"area":null},{"id":"2509.20304","title":"Ads that Stick: Near-Optimal Ad Optimization through Psychological Behavior Models","created":"2025-09-24","cited_by_count":1,"area":null},{"id":"2608.15848","title":"Generalized Linear Bandits with Memory","created":"2026-08-16","cited_by_count":1,"area":null},{"id":"2403.11520","title":"State-Separated SARSA: A Practical Sequential Decision-Making Algorithm with Recovering Rewards","created":"2024-03-18","cited_by_count":0,"area":null},{"id":"2410.13108","title":"Algorithmic Content Selection and the Impact of User Disengagement","created":"2024-10-17","cited_by_count":0,"area":null},{"id":"2610.00911","title":"Block Optimism for Nonstationary Bandits with Latent Linear Dynamics","created":"2026-10-01","cited_by_count":0,"area":null}],"next_cursor":null}