Communities
Connect sessions
AI calendar
Organizations
Join Slack
Contact Sales
Search
Open menu
Home
Papers
2002.11880
Cited By
Stochastic Matching with Few Queries:
(
1
−
ε
)
(1-\varepsilon)
(
1
−
ε
)
Approximation
Symposium on the Theory of Computing (STOC), 2020
27 February 2020
Soheil Behnezhad
Mahsa Derakhshan
Mohammadtaghi Hajiaghayi
Re-assign community
ArXiv (abs)
PDF
HTML
Papers citing
"Stochastic Matching with Few Queries: $(1-\varepsilon)$ Approximation"
2 / 2 papers shown
An Asymptotically Optimal Batched Algorithm for the Dueling Bandit Problem
Neural Information Processing Systems (NeurIPS), 2022
Arpit Agarwal
R. Ghuge
V. Nagarajan
289
2
0
25 Sep 2022
Batched Dueling Bandits
International Conference on Machine Learning (ICML), 2022
Arpit Agarwal
R. Ghuge
V. Nagarajan
420
12
0
22 Feb 2022
1
Page 1 of 1
