Abstract
We present a market-based approach to the Air Traffic Flow Management (ATFM) problem. The goods in our market are delays and buyers are airline companies; the latter pay money to the Federal Aviation Administration (FAA) to buy away the desired amount of delay on a per flight basis. We give a notion of equilibrium for this market and an LP whose every optimal solution gives an equilibrium allocation of flights to landing slots as well as equilibrium prices for the landing slots. Via a reduction to matching, we show that this equilibrium can be computed combinatorially in strongly polynomial time. Moreover, there is a special set of equilibrium prices, which can be computed easily, that is identical to the VCG solution, and therefore the market is incentive compatible (truthful) in dominant strategy.
Original language | English (US) |
---|---|
Pages (from-to) | 41-50 |
Number of pages | 10 |
Journal | Theoretical Computer Science |
Volume | 818 |
DOIs | |
State | Published - May 24 2020 |
Externally published | Yes |
Keywords
- Incentive compatible
- Market equilibrium
- Matching market
- Strongly polynomial-time algorithm
- VCG
ASJC Scopus subject areas
- Theoretical Computer Science
- General Computer Science