TY - JOUR
T1 - An incentive compatible, efficient market for air traffic flow management
AU - Mehta, Ruta
AU - Vazirani, Vijay V.
N1 - Funding Information:
Supported by NSF Grant CCF-1216019.
Funding Information:
Supported by NSF Grant CCF-1833617.Supported by NSF Grant CCF-1216019.
Publisher Copyright:
© 2018 Elsevier B.V.
PY - 2020/5/24
Y1 - 2020/5/24
N2 - 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.
AB - 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.
KW - Incentive compatible
KW - Market equilibrium
KW - Matching market
KW - Strongly polynomial-time algorithm
KW - VCG
UR - http://www.scopus.com/inward/record.url?scp=85055041587&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85055041587&partnerID=8YFLogxK
U2 - 10.1016/j.tcs.2018.09.006
DO - 10.1016/j.tcs.2018.09.006
M3 - Article
AN - SCOPUS:85055041587
SN - 0304-3975
VL - 818
SP - 41
EP - 50
JO - Theoretical Computer Science
JF - Theoretical Computer Science
ER -