ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2002.11880
  4. Cited By
Stochastic Matching with Few Queries: $(1-\varepsilon)$ Approximation

Stochastic Matching with Few Queries: (1−ε)(1-\varepsilon)(1−ε) Approximation

27 February 2020
Soheil Behnezhad
Mahsa Derakhshan
Mohammadtaghi Hajiaghayi
ArXiv (abs)PDFHTML

Papers citing "Stochastic Matching with Few Queries: $(1-\varepsilon)$ Approximation"

2 / 2 papers shown
Title
An Asymptotically Optimal Batched Algorithm for the Dueling Bandit
  Problem
An Asymptotically Optimal Batched Algorithm for the Dueling Bandit Problem
Arpit Agarwal
R. Ghuge
V. Nagarajan
69
2
0
25 Sep 2022
Batched Dueling Bandits
Batched Dueling Bandits
Arpit Agarwal
R. Ghuge
V. Nagarajan
181
10
0
22 Feb 2022
1