A Market for Air Traffic Flow Management

Vijay V. Vazirani

Home/Archive/arXiv

arXiv · 1109.5214

A Market for Air Traffic Flow Management

Vijay V. Vazirani

View original source ↗Read source document ↗Export metadata ↓

Abstract

The two somewhat conflicting requirements of efficiency and fairness make ATFM an unsatisfactorily solved problem, despite its overwhelming importance. In this paper, we present an economics motivated solution that is based on the notion of a free market. Our contention is that in fact the airlines themselves are the best judge of how to achieve efficiency and our market-based solution gives them the ability to pay, at the going rate, to buy away the desired amount of delay on a per flight basis. The issue of fairness is simply finessed away by our solution -- whoever pays gets smaller delays. We show how our solution has the potential of enabling travelers from a large spectrum of affordability and punctuality requirements to achieve an end that is most desirable to them. Our market model is particularly simple, requiring only one parameter per flight from the airline company. Furthermore, we show that it admits a combinatorial, strongly polynomial algorithm for computing an equilibrium landing schedule and prices.

Explore related subjects

cs.CC cs.GT

Keep this discovery

BibTeX RIS

Vijay V. Vazirani. 2011-09-23. A Market for Air Traffic Flow Management. https://arxiv.org/abs/1109.5214

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

The Computational Complexity of Holant Problems on 4-regular Graphs from the Stable Subgroup Sequence of $SL(2,\mathbb{C})$

The Holant framework provides a general setting for studying counting problems and includes graph homomorphisms (\#GH) and counting constraint satisfaction problems (\#CSP) as special cases. Over the past twenty years, a series of computational complexity dichotomies have been established for Holant problems, but the classification for complex-valued signatures is still open. The main obstacle is the case in which all signatures have even arity. In this paper, we establish a dichotomy for Holant problems with a complex-valued 4-ary signature, which is a key base case for the full classification of Holant problems. We present a new strategy by introducing Schur's theorem, the classification of finite subgroups of $\mathrm{SL}(2,\mathbb{C})$ and stable subgroup sequences into the proof. These new techniques are of independent interest.

cs.CC↗

arXiv2026

Max Independent Set Remains NP-hard when Excluding a Planar Induced Minor

We show that there is a fixed planar graph $H$, namely the $5 \times 5$ grid, such that Max Independent Set remains NP-hard in $H$-induced-minor-free graphs. This refutes the Dallard--Milani\v{c}--\v{S}torgel conjecture and a weakening of it by Gartland and Lokshtanov, and by Korhonen.

cs.CC↗

arXiv2026

Topology inside NC$^1$

We show that ACC$^0$ is precisely what can be computed with constant-width circuits of polynomial size and polylogarithmic genus. This extends a characterization given by Hansen, showing that planar constant-width circuits also characterize ACC$^0$. Thus polylogarithmic genus provides no additional computational power in this model. We consider other generalizations of planarity, including crossing number and thickness. We show that constant-width circuits of polynomial size and thickness two already suffice to capture all of NC$^1$.

cs.CC↗