{"total":19,"rows":[{"id":"2108.08843","title":"Learning Equilibria in Matching Markets from Bandit Feedback","created":"2021-08-19","cited_by_count":34,"area":null},{"id":"2103.07501","title":"Beyond $\\log^2(T)$ Regret for Decentralized Bandits in Matching Markets","created":"2021-03-12","cited_by_count":30,"area":null},{"id":"2206.02344","title":"Decentralized, Communication- and Coordination-free Learning in Structured Matching Markets","created":"2022-06-06","cited_by_count":11,"area":null},{"id":"2105.08769","title":"Learning and Information in Stochastic Networks and Queues","created":"2021-05-18","cited_by_count":8,"area":null},{"id":"2408.08690","title":"Explore-then-Commit Algorithms for Decentralized Two-Sided Matching Markets","created":"2024-08-16","cited_by_count":6,"area":null},{"id":"2202.04369","title":"A new perspective on classification: optimally allocating limited resources to uncertain tasks","created":"2022-02-09","cited_by_count":5,"area":null},{"id":"2206.00120","title":"Decentralized Competing Bandits in Non-Stationary Matching Markets","created":"2022-05-31","cited_by_count":5,"area":null},{"id":"2506.15926","title":"Competing Bandits in Matching Markets via Super Stability","created":"2025-06-19","cited_by_count":4,"area":null},{"id":"2106.03927","title":"Improving Social Welfare While Preserving Autonomy via a Pareto Mediator","created":"2021-06-07","cited_by_count":3,"area":null},{"id":"2412.10168","title":"Learning payoffs while routing in skill-based queues","created":"2024-12-13","cited_by_count":2,"area":null},{"id":"2110.12118","title":"Bandits with Dynamic Arm-acquisition Costs","created":"2021-10-23","cited_by_count":1,"area":null},{"id":"2209.06128","title":"A Scalable Recommendation Engine for New Users and Items","created":"2022-09-06","cited_by_count":1,"area":null},{"id":"2212.06891","title":"Interactive Learning with Pricing for Optimal and Stable Allocations in Markets","created":"2022-12-13","cited_by_count":1,"area":null},{"id":"2603.19700","title":"Regret Analysis of Sleeping Competing Bandits","created":"2026-03-20","cited_by_count":1,"area":null},{"id":"2105.02589","title":"Bandit based centralized matching in two-sided markets for peer to peer lending","created":"2021-05-06","cited_by_count":0,"area":null},{"id":"2112.06362","title":"Learning to Schedule in Parallel-Server Queues with Stochastic Bilinear Rewards","created":"2021-12-13","cited_by_count":0,"area":null},{"id":"2301.07243","title":"Complexity Analysis of a Countable-armed Bandit Problem","created":"2023-01-18","cited_by_count":0,"area":null},{"id":"2412.03983","title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","created":"2024-12-05","cited_by_count":0,"area":null},{"id":"2502.07397","title":"Linear Bandits beyond Inner Product Spaces, the case of Bandit Optimal Transport","created":"2025-02-11","cited_by_count":0,"area":null}],"next_cursor":null}