arXiv Machine Learning July 14, 2026 By Jung-hun Kim, Milan Vojnovic

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

Read the original on arXiv Machine Learning →

arXiv:2112. 06362v5 Announce Type: replace Abstract: We consider the problem of scheduling in multi-class, parallel-server queuing systems with uncertain rewards from job-server assignments.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning

4d ago

Nonpreemptive Scheduling While Learning Context-Dependent Service Rates

arXiv:2609.37660v1 Announce Type: new Abstract: We study nonpreemptive contextual queueing bandits in a single-server system. Each job is represented by a $d$-dimensional context vector; in each roun...

By Wansoo Choi, Seoungbin Bae, Dabeen Lee

arXiv Machine Learning

Jun 2

Online Packet Scheduling with Deadlines and Learning

arXiv:2606. 00835v1 Announce Type: new Abstract: Network routers that enforce Quality-of-Service (QoS) guarantees must decide, at every clock cycle, which expiring packet of information to transmit, even when the value of the packet is unknown until it is processed.

By Gianmarco Genalti, Achraf Azize, Vianney Perchet

reinforcement-learning

arXiv Machine Learning

Jun 9

Algorithm for Contextual Queueing Bandits with Rate-Optimal Queue Length Regret

arXiv:2606. 09668v1 Announce Type: new Abstract: Contextual queueing bandits provide a framework for learning to schedule heterogeneous jobs under unknown context-dependent service rates.

By Seoungbin Bae, Dabeen Lee

arXiv Machine Learning

Sep 15

High-Probability Nash Regret for Decentralized Learning in Markov $\alpha$-Potential Games: Episodic and Fully Online Asynchronous Algorithms with Applications to Markov Congestion Games

arXiv:2609. 14959v1 Announce Type: new Abstract: We study decentralized learning of Nash equilibria (NE) in infinite-horizon discounted Markov games under bandit feedback, focusing on Markov $\alpha$-potential games.

By S. Rasoul Etesami

reinforcement-learning safety

arXiv Machine Learning

Aug 20

Online Bipartite Matching with Reusable Capacity under Non-Stationary Rewards

arXiv:2608. 18130v1 Announce Type: cross Abstract: We study online bipartite matching with reusable server capacity and non-stationary rewards.

By Xi Chen, Shixin Wang, Bingkun Zhou, Yuan Zhou

arXiv Machine Learning

Jul 31

Real-Time Hard Peak Age-of-Information Safety with No-Regret Learning

arXiv:2607. 27626v1 Announce Type: new Abstract: Safety-critical IoT systems such as industrial closed-loop control, V2X coordination, and remote teleoperation require every sensor's peak Age of Information (peak AoI, also abbreviated PAoI) to stay below a hard per-slot deadline, not merely an average bound.

By Wentao Zhang, Wentao Mo

reinforcement-learning safety

One email a morning, machine-written

Related stories

Nonpreemptive Scheduling While Learning Context-Dependent Service Rates

Online Packet Scheduling with Deadlines and Learning

Algorithm for Contextual Queueing Bandits with Rate-Optimal Queue Length Regret

High-Probability Nash Regret for Decentralized Learning in Markov $\alpha$-Potential Games: Episodic and Fully Online Asynchronous Algorithms with Applications to Markov Congestion Games

Online Bipartite Matching with Reusable Capacity under Non-Stationary Rewards

Real-Time Hard Peak Age-of-Information Safety with No-Regret Learning