Noncooperative Virtual Queue Coordination via Uncertainty-Aware Correlated Equilibria
Jaehan Im, David Fridovich-Keil, Ufuk Topcu
TL;DR
The study tackles airport surface congestion under CVQ by enabling a central coordinator to influence aircraft-level pushback decisions without overriding airline autonomy. It introduces a chance-constrained correlated equilibrium (CC-CE) framework that provides probabilistic incentive guarantees under uncertainty in airline costs, and develops a scalable reduced-rank CC-CE algorithm (RR-CCCE) to manage large joint-action spaces. Empirical results show that CC-CE coordination reduces accumulated delay by up to 8–9% compared with FCFS and remains tractable up to about 210 eligible pushbacks per hour, with a clear trade-off between confidence level, deviation robustness, and cost efficiency. The work advances practical, incentive-aligned CVQ deployment by balancing system-level performance with airline autonomy and computational feasibility.
Abstract
Collaborative virtual queueing has been proposed as a mechanism to mitigate airport surface congestion while preserving airline autonomy over aircraft-level pushback decisions. A central coordinator can regulate aggregate pushback capacity but cannot directly control which specific aircraft are released, limiting its ability to steer system-level performance. We propose a noncooperative coordination mechanism for collaborative virtual queueing based on the correlated equilibrium concept, which enables the coordinator to provide incentive-compatible recommendations on aircraft-level pushback decisions without overriding airline autonomy. To account for uncertainty in airlines' internal cost assessments, we introduce chance constraints into the correlated equilibrium formulation. This formulation provides explicit probabilistic guarantees on incentive compatibility, allowing the coordinator to adjust the confidence level with which airlines are expected to follow the recommended actions. We further propose a scalable algorithm for computing chance-constrained correlated equilibria by exploiting a reduced-rank structure. Numerical experiments demonstrate that the proposed method scales to realistic traffic levels up to 210 eligible pushbacks per hour, reduces accumulated delay by up to approximately 8.9% compared to current first-come-first-served schemes, and reveals a trade-off between confidence level, deviation robustness, and achievable cost efficiency.
