{"total":13,"rows":[{"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":"2102.06246","title":"Regret, stability & fairness in matching markets with bandit learners","created":"2021-02-11","cited_by_count":20,"area":null},{"id":"2211.16275","title":"A survey on multi-player bandits","created":"2022-11-29","cited_by_count":19,"area":null},{"id":"2110.14622","title":"Heterogeneous Multi-player Multi-armed Bandits: Closing the Gap and Generalization","created":"2021-10-27","cited_by_count":18,"area":null},{"id":"2204.13502","title":"Multi-Player Multi-Armed Bandits with Finite Shareable Resources Arms: Learning Algorithms & Applications","created":"2022-04-28","cited_by_count":10,"area":null},{"id":"2106.04228","title":"Decentralized Learning in Online Queuing Systems","created":"2021-06-08","cited_by_count":8,"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":"2211.07817","title":"Multi-Player Bandits Robust to Adversarial Collisions","created":"2022-11-15","cited_by_count":1,"area":null},{"id":"2312.15549","title":"Finite-Time Frequentist Regret Bounds of Multi-Agent Thompson Sampling on Sparse Hypergraphs","created":"2023-12-24","cited_by_count":1,"area":null},{"id":"2305.19691","title":"Constant or logarithmic regret in asynchronous multiplayer bandits","created":"2023-05-31","cited_by_count":0,"area":null},{"id":"2311.01698","title":"Adversarial Attacks on Cooperative Multi-agent Bandits","created":"2023-11-03","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":"2503.20975","title":"Competitive Multi-armed Bandit Games for Resource Sharing","created":"2025-03-26","cited_by_count":0,"area":null}],"next_cursor":null}