{"total":13,"rows":[{"id":"2104.03860","title":"Incentivizing Exploration in Linear Bandits under Information Gap","created":"2021-04-08","cited_by_count":5,"area":null},{"id":"2110.12160","title":"Multi-armed Bandit Algorithm against Strategic Replication","created":"2021-10-23","cited_by_count":5,"area":null},{"id":"2306.01990","title":"Incentivizing Exploration with Linear Contexts and Combinatorial Actions","created":"2023-06-03","cited_by_count":5,"area":null},{"id":"2110.14628","title":"(Almost) Free Incentivized Exploration from Decentralized Learning Agents","created":"2021-10-27","cited_by_count":3,"area":null},{"id":"2312.07929","title":"Robust and Performance Incentivizing Algorithms for Multi-Armed Bandits with Strategic Agents","created":"2023-12-13","cited_by_count":3,"area":null},{"id":"2403.10819","title":"Incentivized Exploration of Non-Stationary Stochastic Bandits","created":"2024-03-16","cited_by_count":3,"area":null},{"id":"2105.08869","title":"Incentivized Bandit Learning with Self-Reinforcing User Preferences","created":"2021-05-19","cited_by_count":2,"area":null},{"id":"2112.14338","title":"Socially-Optimal Mechanism Design for Incentivized Online Learning","created":"2021-12-29","cited_by_count":2,"area":null},{"id":"2508.19466","title":"Incentivized Lipschitz Bandits","created":"2025-08-26","cited_by_count":2,"area":null},{"id":"2402.14013","title":"Misalignment, Learning, and Ranking: Harnessing Users Limited Attention","created":"2024-02-21","cited_by_count":1,"area":null},{"id":"2305.02441","title":"Reward Teaching for Federated Multi-armed Bandits","created":"2023-05-03","cited_by_count":0,"area":null},{"id":"2502.15338","title":"Learning with Limited Shared Information in Multi-agent Multi-armed Bandit","created":"2025-02-21","cited_by_count":0,"area":null},{"id":"2506.01685","title":"Geometry Meets Incentives: Sample-Efficient Incentivized Exploration with Linear Contexts","created":"2025-06-02","cited_by_count":0,"area":null}],"next_cursor":null}