{"total":33,"rows":[{"id":"2207.03106","title":"A Simple and Provably Efficient Algorithm for Asynchronous Federated Contextual Linear Bandits","created":"2022-07-07","cited_by_count":28,"area":null},{"id":"2211.16275","title":"A survey on multi-player bandits","created":"2022-11-29","cited_by_count":19,"area":null},{"id":"2307.10890","title":"Player-optimal Stable Regret for Bandit Learning in Matching Markets","created":"2023-07-20","cited_by_count":17,"area":null},{"id":"2203.03684","title":"Learn to Match with No Regret: Reinforcement Learning in Markov Matching Markets","created":"2022-03-07","cited_by_count":16,"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":"2303.08613","title":"Learning to Incentivize Information Acquisition: Proper Scoring Rules Meet Principal-Agent Model","created":"2023-03-15","cited_by_count":7,"area":null},{"id":"2410.04376","title":"Putting Gale & Shapley to Work: Guaranteeing Stability Through Learning","created":"2024-10-06","cited_by_count":7,"area":null},{"id":"2305.19158","title":"Competing for Shareable Arms in Multi-Player Multi-Armed Bandits","created":"2023-05-30","cited_by_count":6,"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":"2301.10230","title":"Two-sided Competing Matching Recommendation Markets With Quota and Complementary Preferences Constraints","created":"2023-01-24","cited_by_count":5,"area":null},{"id":"2302.03810","title":"Fairness in Matching under Uncertainty","created":"2023-02-08","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":"2210.11692","title":"Competing Bandits in Time Varying Matching Markets","created":"2022-10-21","cited_by_count":3,"area":null},{"id":"2503.08004","title":"Multiplayer Information Asymmetric Bandits in Metric Spaces","created":"2025-03-11","cited_by_count":3,"area":null},{"id":"2503.08961","title":"Multiplayer Information Asymmetric Contextual Bandits","created":"2025-03-11","cited_by_count":3,"area":null},{"id":"2407.05484","title":"Learning to Price Homogeneous Data","created":"2024-07-07","cited_by_count":2,"area":null},{"id":"2407.21294","title":"Decentralized and Uncoordinated Learning of Stable Matchings: A Game-Theoretic Approach","created":"2024-07-31","cited_by_count":2,"area":null},{"id":"2412.00301","title":"Bandit Learning in Matching Markets: Utilitarian and Rawlsian Perspectives","created":"2024-11-30","cited_by_count":2,"area":null},{"id":"2502.11981","title":"Welfare as a Guiding Principle for Machine Learning -- From Compass, to Lens, to Roadmap","created":"2025-02-17","cited_by_count":2,"area":null},{"id":"2603.19221","title":"Online Learning and Equilibrium Computation with Ranking Feedback","created":"2026-03-19","cited_by_count":2,"area":null},{"id":"2607.04824","title":"Probably Correct Optimal Stable Matching under Two-Sided Uncertainty","created":"2026-07-06","cited_by_count":2,"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":"2512.06758","title":"Optimal Analysis for Bandit Learning in Matching Markets with Serial Dictatorship","created":"2025-12-07","cited_by_count":1,"area":null},{"id":"2605.28290","title":"Adaptive Bandit Algorithms for Contextual Matching Markets","created":"2026-05-27","cited_by_count":1,"area":null},{"id":"2208.06536","title":"Double Auctions with Two-sided Bandit Feedback","created":"2022-08-13","cited_by_count":0,"area":null},{"id":"2403.15524","title":"PPA-Game: Characterizing and Learning Competitive Dynamics Among Online Content Creators","created":"2024-03-22","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},{"id":"2505.17379","title":"Provably Efficient Algorithm for Best Scoring Rule Identification in Online Principal-Agent Information Acquisition","created":"2025-05-23","cited_by_count":0,"area":null},{"id":"2506.03802","title":"Learning in Matching Games with Bandit Feedback","created":"2025-06-04","cited_by_count":0,"area":null},{"id":"2605.00500","title":"Scaling Federated Linear Contextual Bandits via Sketching","created":"2026-05-01","cited_by_count":0,"area":null},{"id":"2606.06744","title":"Learn to Match: Two-Sided Matching with Temporally Extended Feedback","created":"2026-06-04","cited_by_count":0,"area":null},{"id":"2606.19883","title":"Matching Markets meet Cumulative Prospect Theory: Towards Optimal and Adversarially Robust Learning","created":"2026-06-18","cited_by_count":0,"area":null},{"id":"2606.29221","title":"A Linear Matching Bandit Approach to Online Multi-Human Multi-Robot Teaming","created":"2026-06-28","cited_by_count":0,"area":null}],"next_cursor":null}