6 papers
General Non-Clairvoyant KV-Cache Scheduling via Regime-Aware Routing
Yiding Feng, Siyu Liu, Zonghan Yang +1
We study non-clairvoyant scheduling for batched Large Language Model (LLM) inference under a hard Key-Value (KV) cache memory budget. Each request has a known prompt length but an…
Non-Stationary Online Resource Allocation: Learning from a Single Sample
Yiding Feng, Jiashuo Jiang, Yige Wang
We study online resource allocation under non-stationary demand with a minimum offline data requirement. In this problem, a decision-maker must allocate multiple types of resources…
Pareto-Efficient Multi-Buyer Mechanisms: Characterization, Fairness and Welfare
Moshe Babaioff, Sijin Chen, Zhaohua Chen +1
A truthful mechanism for a Bayesian single-item auction results with some ex-ante revenue for the seller, and some ex-ante total surplus for the buyers. We study the Pareto frontie…
Strengthening Bulow-Klemperer-Style Results for Multi-Unit Auctions
Moshe Babaioff, Yiding Feng, Zihan Luo
The classic result of Bulow and Klemperer (1996) shows that in multi-unit auctions with units and buyers whose values are sampled i.i.d. from a regular distribution,…
Competitive Non-Clairvoyant KV-Cache Scheduling for LLM Inference
Yiding Feng, Zonghan Yang, Yuhao Zhang
Large Language Model (LLM) inference presents a unique scheduling challenge due to the Key-Value (KV) cache, where a job's memory footprint grows linearly with the number of decode…
Beyond Regularity: Simple versus Optimal Mechanisms, Revisited
Yiding Feng, Yaonan Jin
A large proportion of the Bayesian mechanism design literature is restricted to the family of regular distributions [Mye81] or the family of monotone hazard…