如何击败先来先服务（FCFS）
How to Beat FCFS
浏览论文内容
中文总结 AI 辅助
该研究针对两个相同服务率的队列，证明修改服务顺序可击败FCFS，确定了到达份额上界，还分析了有无承诺时的队列服务规则均衡情况。
中文摘要 AI 辅助
我们研究两个具有相同服务率的可观测队列，为随时间随机到达的智能体提供服务。智能体会选择加入能最小化其预期等待时间的队列。假设一个队列采用普遍使用的先来先服务（FCFS）服务规则，我们表明只需简单修改其服务顺序，另一个队列就能获得严格多数的需求。我们确定了任何规则相对于FCFS能获得的到达份额的上界。当两个队列都能设计自身的服务顺序时，我们证明在低拥塞状态下，一种新型的后到先服务（LCFS）变体是一种均衡。若缺乏承诺，情况会发生变化，此时存在一种均衡：两个队列都使用FCFS，智能体则路由到等待列表更短的队列。
英文摘要
We study two observable queues with identical service rates, serving agents who arrive stochastically over time. Agents join the queue that minimizes their expected waiting time. Assuming one queue uses the ubiquitous First-Come-First-Served (FCFS) service rule, we show that by simply modifying its service order, the other queue can capture a strict majority of the demand. We establish an upper bound on the arrival share any rule can capture against FCFS. When both queues can design their service order, we show a novel variant of Last-Come-First-Served (LCFS) is an equilibrium in a low congestion regime. Without commitment, the picture changes, and there is an equilibrium where both queues use FCFS, and agents route to the queue with the shorter waitlist.
