排队与截止时间：刻画两种转移规则

摘要

We study a generalization of the standard queueing problem which introduces a deadline of each agent. For the queueing problem with deadlines, or simple the deadline queueing problem, each agent should be served before her deadline. We propose two rules for the problem, called the deadline-adjusted minimal and the deadline-adjusted maximal transfer rules, which are natural modifications of two of the most well-known rules for the standard queueing problem, the minimal and the maximal transfer rules, respectively, and present their axiomatic characterizations. The deadline-adjusted minimal transfer rule is the only rule jointly satisfying constrained efficiency, Pareto indifference, equal treatment of equals, positional invariance, full compensation, and independence of preceding larger costs. On the other hand, the deadline-adjusted maximal transfer rule is the only rule jointly satisfying constrained efficiency, Pareto indifference, equal treatment of equals, positional invariance, full compensation, and independence of following smaller costs.