SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2410.10098 · NeurIPS · 2024

Queueing Matching Bandits with Preference Feedback

Min-Hwan Oh, Jung-Hun Kim

arXiv · PDF · Open in the Atlas

Code that ran

We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

Abstract

In this study, we consider multi-class multi-server asymmetric queueing systems consisting of N queues on one side and K servers on the other side, where jobs randomly arrive in queues at each time. The service rate of each job-server assignment is unknown and modeled by a feature-based Multi-nomial Logit (MNL) function. At each time, a scheduler assigns jobs to servers, and each server stochastically serves at most one job based on its preferences over the assigned jobs. The primary goal of the algorithm is to stabilize the queues in the system while learning the service rates of servers. To achieve this goal, we propose algorithms based on UCB and Thompson Sampling, which achieve system stability with an average queue length bound of O(min{N, K}/ϵ) for a large time horizon T , where ϵ is a traffic slackness of the system. Furthermore, the algorithms achieve sublinear regret bounds of O(min{ √ T Q max , T 3/4 }), where Q max represents the maximum queue length over agents and times. Lastly, we provide experimental results to demonstrate the performance of our algorithms.

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("2410.10098")
get_code_for_paper("2410.10098")
have("2410.10098")

The run record, dated, one paper per request, free:

curl https://syntology.ai/api/ran/2410.10098.json

A badge for a README (the split and the date, never a ratio):

[![Syntology run record](https://syntology.ai/api/ran/2410.10098.svg)](https://syntology.ai/paper/2410.10098)

Connect an agent — have() is free.