299 research outputs found
COMPUTATIONALLY TRACTABLE STOCHASTIC INTEGER PROGRAMMING MODELS FOR AIR TRAFFIC FLOW MANAGEMENT
A primary objective of Air Traffic Flow Management (ATFM) is to ensure the orderly flow of aircraft through airspace, while minimizing the impact of delays and congestion on airspace users. A fundamental challenge of ATFM is the vulnerability of the airspace to changes in weather, which can lower the capacities of different regions of airspace. Considering this uncertainty along with the size of the airspace system, we arrive at a very complex problem. The development of efficient algorithms to solve ATFM problems is an important and active area of research. Responding to predictions of bad weather requires the solution of resource allocation problems that assign a combination of ground delay and route adjustments to many flights. Since there is much uncertainty associated with weather predictions, stochastic models are necessary.
We address some of these problems using integer programming (IP). In general, IP models can be difficult to solve. However, if "strong" IP formulations can be found, then problems can be solved quickly by state of the art IP solvers. We start by describing a multi-period stochastic integer program for the single airport stochastic dynamic ground holding problem. We then show that the linear programming relaxation yields integer optimal solutions. This is a fairly unusual property for IP formulations that can significantly reduce the complexity of the corresponding problems. The proof is achieved by defining a new class of matrices with the Monge property and showing that the formulation presented belongs to this class. To further improve computation times, we develop alternative compact formulations.
These formulations are extended to show that they can also be used to model different concepts of equity and fairness as well as efficiency. We explore simple rationing methods and other heuristics for these problems both to provide fast solution times, but also because these methods can embody inherent notions of fairness. The initial models address problems that seek to restrict flow into a single airport. These are extended to problems where stochastic weather affects en route traffic. Strong formulations and efficient solutions are obtained for these problems as well
LP-Duality Theory and the Cores of Games
LP-duality theory has played a central role in the study of the core, right
from its early days to the present time. The 1971 paper of Shapley and Shubik,
which gave a characterization of the core of the assignment game, has been a
paradigm-setting work in this regard. However, despite extensive follow-up
work, basic gaps still remain. We address these gaps using the following
building blocks from LP-duality theory:
1). Total unimodularity (TUM).
2). Complementary slackness conditions and strict complementarity.
TUM plays a vital role in the Shapley-Shubik theorem. We define several
generalizations of the assignment game whose LP-formulations admit TUM; using
the latter, we characterize their cores. The Hoffman-Kruskal game is the most
general of these. Its applications include matching students to schools and
medical residents to hospitals, and its core imputations provide a way of
enforcing constraints arising naturally in these applications: encouraging
diversity and discouraging over-representation.
Complementarity enables us to prove new properties of core imputations of the
assignment game and its generalizations.Comment: 30 pages. arXiv admin note: text overlap with arXiv:2202.0061
Computational Complexity of the Hylland-Zeckhauser Scheme for One-Sided Matching Markets
In 1979, Hylland and Zeckhauser \cite{hylland} gave a simple and general
scheme for implementing a one-sided matching market using the power of a
pricing mechanism. Their method has nice properties -- it is incentive
compatible in the large and produces an allocation that is Pareto optimal --
and hence it provides an attractive, off-the-shelf method for running an
application involving such a market. With matching markets becoming ever more
prevalant and impactful, it is imperative to finally settle the computational
complexity of this scheme.
We present the following partial resolution:
1. A combinatorial, strongly polynomial time algorithm for the special case
of utilities.
2. An example that has only irrational equilibria, hence proving that this
problem is not in PPAD. Furthermore, its equilibria are disconnected, hence
showing that the problem does not admit a convex programming formulation.
3. A proof of membership of the problem in the class FIXP.
We leave open the (difficult) question of determining if the problem is
FIXP-hard. Settling the status of the special case when utilities are in the
set appears to be even more difficult.Comment: 22 page
- …