(T) Regret for Decentralized Bandits in Matching Markets.
Soumya BasuKarthik Abinav SankararamanAbishek SankararamanPublished in: CoRR (2021)
Keyphrases
- regret bounds
- matching algorithm
- multi armed bandits
- pattern matching
- multi armed bandit
- online learning
- image matching
- electronic commerce
- keypoints
- matching process
- multi agent
- peer to peer
- multi armed bandit problems
- matching scheme
- graph matching
- cooperative
- feature matching
- feature points
- upper bound
- stochastic systems
- pairwise
- lower bound