ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2026 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2112.06362
  4. Cited By
Learning to Schedule in Parallel-Server Queues with Stochastic Bilinear Rewards
v1v2v3v4 (latest)

Learning to Schedule in Parallel-Server Queues with Stochastic Bilinear Rewards

13 December 2021
Jung-hun Kim
Milan Vojnović
ArXiv (abs)PDFHTMLGithub

Papers citing "Learning to Schedule in Parallel-Server Queues with Stochastic Bilinear Rewards"

1 / 1 papers shown
Doubly High-Dimensional Contextual Bandits: An Interpretable Model for
  Joint Assortment-Pricing
Doubly High-Dimensional Contextual Bandits: An Interpretable Model for Joint Assortment-PricingSocial Science Research Network (SSRN), 2023
Junhui Cai
Ran Chen
Martin J. Wainwright
Linda H. Zhao
283
7
0
14 Sep 2023
1
Page 1 of 1