(T) regret for decentralized bandits in matching markets.

Soumya Basu Karthik Abinav Sankararaman Abishek Sankararaman

Published in: ICML (2021)

Keyphrases

matching algorithm
online learning
regret bounds
multi armed bandits
matching process
lower bound
worst case
pattern matching
multi armed bandit problems
electronic commerce
bandit problems
cooperative
graph matching
peer to peer
multi agent
image matching
feature matching
decision makers