{"total":26,"rows":[{"id":"2203.17118","title":"Doubly-Robust Estimation for Correcting Position-Bias in Click Feedback for Unbiased Learning to Rank","created":"2022-03-31","cited_by_count":18,"area":null},{"id":"2604.24977","title":"A Survey on LLM-based Conversational User Simulation","created":"2026-04-27","cited_by_count":18,"area":null},{"id":"2404.13895","title":"Optimal Design for Human Preference Elicitation","created":"2024-04-22","cited_by_count":17,"area":null},{"id":"2402.01845","title":"Multi-Armed Bandits with Interference","created":"2024-02-02","cited_by_count":10,"area":null},{"id":"2412.03727","title":"Online Experimental Design With Estimation-Regret Trade-off Under Network Interference","created":"2024-12-04","cited_by_count":9,"area":null},{"id":"2102.05990","title":"Robust Generalization and Safe Query-Specialization in Counterfactual Learning to Rank","created":"2021-02-11","cited_by_count":6,"area":null},{"id":"2206.08776","title":"Multiple-Play Stochastic Bandits with Shareable Finite-Capacity Arms","created":"2022-06-17","cited_by_count":6,"area":null},{"id":"2305.17071","title":"Adversarial Attacks on Online Learning to Rank with Click Feedback","created":"2023-05-26","cited_by_count":6,"area":null},{"id":"2305.19218","title":"Adversarial Attacks on Online Learning to Rank with Stochastic Click Models","created":"2023-05-30","cited_by_count":6,"area":null},{"id":"2503.07555","title":"Graph-Dependent Regret Bounds in Multi-Armed Bandits with Interference","created":"2025-03-10","cited_by_count":5,"area":null},{"id":"2204.13765","title":"Probabilistic Permutation Graph Search: Black-Box Optimization for Fairness in Ranking","created":"2022-04-28","cited_by_count":4,"area":null},{"id":"2207.05437","title":"Simultaneously Learning Stochastic and Adversarial Bandits under the Position-Based Model","created":"2022-07-12","cited_by_count":2,"area":null},{"id":"2210.09957","title":"Contextual bandits with concave rewards, and an application to fair ranking","created":"2022-10-18","cited_by_count":2,"area":null},{"id":"2311.04528","title":"Bandit Learning to Rank with Position-Based Click Models: Personalized and Equal Treatments","created":"2023-11-08","cited_by_count":2,"area":null},{"id":"2207.00109","title":"Ranking In Generalized Linear Bandits","created":"2022-06-30","cited_by_count":1,"area":null},{"id":"2301.10651","title":"Overcoming Prior Misspecification in Online Learning to Rank","created":"2023-01-25","cited_by_count":1,"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":"2510.07646","title":"Design-Based Bandits Under Network Interference: Trade-Off Between Regret and Statistical Inference","created":"2025-10-09","cited_by_count":1,"area":null},{"id":"2208.01515","title":"UniRank: Unimodal Bandit Algorithm for Online Ranking","created":"2022-08-02","cited_by_count":0,"area":null},{"id":"2305.01202","title":"Exploration of Unranked Items in Safe Online Learning to Re-Rank","created":"2023-05-02","cited_by_count":0,"area":null},{"id":"2406.05017","title":"Adaptively Learning to Select-Rank in Online Platforms","created":"2024-06-07","cited_by_count":0,"area":null},{"id":"2509.22855","title":"Observation-Free Attacks on Online Learning to Rank","created":"2025-09-26","cited_by_count":0,"area":null},{"id":"2511.03074","title":"Online Learning to Rank under Corruption: A Robust Cascading Bandits Approach","created":"2025-11-04","cited_by_count":0,"area":null},{"id":"2512.21626","title":"Multiple-play Stochastic Bandits with Prioritized Arm Capacity Sharing","created":"2025-12-25","cited_by_count":0,"area":null},{"id":"2606.31449","title":"Contextual Slate GLM Bandits with Limited Adaptivity","created":"2026-06-30","cited_by_count":0,"area":null},{"id":"2610.05220","title":"Ranking Bandits for Carousel Interfaces with Observable Browsing Depth","created":"2026-10-04","cited_by_count":0,"area":null}],"next_cursor":null}