mlsanityData to 7 Oct 2026

Regret, stability & fairness in matching markets with bandit learners

arXiv 2102.06246 ↗First posted 11 Feb 2021cs.LG cs.GT cs.MAcited by 19

Not on the map. Why?

Abstract (arXiv)

Making an informed decision -- for example, when choosing a career or housing -- requires knowledge about the available options. Such knowledge is generally acquired through costly trial and error, but this learning process can be disrupted by competition. In this work, we study how competition affects the long-term outcomes of individuals as they learn. We build on a line of work that models this setting as a two-sided matching market with bandit learners. A recent result in this area states that it is impossible to simultaneously guarantee two natural desiderata: stability and low optimal regret for all agents. Resource-allocating platforms can point to this result as a justification for assigning good long-term outcomes to some agents and poor ones to others. We show that this impossibility need not hold true. In particular, by modeling two additional components of competition -- namely, costs and transfers -- we prove that it is possible to simultaneously guarantee four desiderata: stability, low optimal regret, fairness in the distribution of regret, and high social welfare.

Key facts. Cited by 19 papers in the map (data through 7 Oct 2026). Builds on 10 of its 53 references that are in the map. First posted on arXiv 11 Feb 2021.

Builds on

10 of 53 references.

References · 10

  1. 2019Competing Bandits in Matching Marketscited by 54
  2. 2020Bandit Learning in Decentralized Matching Marketscited by 46
  3. 2020The Gossiping Insert-Eliminate Algorithm for Multi-Agent Banditscited by 37
  4. 2020Robust Multi-Agent Multi-Armed Banditscited by 20
  5. 2019Non-Stochastic Multi-Player Multi-Armed Bandits: Optimal Rate With Collision Information, Sublinear Withoutcited by 14
  6. 2020Selfish Robustness and Equilibria in Multi-Player Banditscited by 13
  7. 2017Competing Bandits: Learning under Competitioncited by 9
  8. 2018Multi-user Communication Networks: A Coordinated Multi-armed Bandit Approachcited by 7
  9. 2020Dominate or Delete: Decentralized Competing Bandits in Serial Dictatorshipcited by 7
  10. 2015Stable Matching Mechanisms are Not Obviously Strategy-Proofcited by 1

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 2; 2022: 5; 2023: 3; 2024: 2; 2025: 4; 2026: 3.

19 papers.

Sort:

By area:

  1. 2021Learning Equilibria in Matching Markets from Bandit Feedbackcited by 34
  2. 2022A survey on multi-player banditscited by 18
  3. 2022Learn to Match with No Regret: Reinforcement Learning in Markov Matching Marketscited by 16
  4. 2023Auditing for Human Expertisecited by 12
  5. 2023Two-sided Competing Matching Recommendation Markets With Quota and Complementary Preferences Constraintscited by 5
  6. 2022Pessimism meets VCG: Learning Dynamic Mechanism Design via Offline Reinforcement Learningcited by 4
  7. 2021Subgroup Fairness in Two-Sided Marketscited by 3
  8. 2024Active Learning for Fair and Stable Online Allocationscited by 3
  9. 2025Probably Correct Optimal Stable Matching for Two-Sided Markets Under Uncertaintycited by 3
  10. 2025Multiplayer Information Asymmetric Bandits in Metric Spacescited by 3
  11. 2025Multiplayer Information Asymmetric Contextual Banditscited by 3
  12. 2022Competing Bandits in Time Varying Matching Marketscited by 2
7 more
  1. 2023Decentralized Online Learning in Task Assignment Games for Mobile Crowdsensingcited by 1
  2. 2024Bandit Learning in Matching Markets: Utilitarian and Rawlsian Perspectivescited by 1
  3. 2022Double Auctions with Two-sided Bandit Feedbackcited by 0
  4. 2025Optimal Analysis for Bandit Learning in Matching Markets with Serial Dictatorshipcited by 0
  5. 2026A Linear Matching Bandit Approach to Online Multi-Human Multi-Robot Teamingcited by 0
  6. 2026Probably Correct Optimal Stable Matching under Two-Sided Uncertaintycited by 0
  7. 2026From Preference to Reciprocity: Decentralized Matching with Empirically Grounded LLM-agent Based Modelingcited by 0