Stable Matchings for Three-Sided Systems
A sufficient condition is provided for the existence of stable matchings for three sided systems. ArticleDownload View PDF
A sufficient condition is provided for the existence of stable matchings for three sided systems. ArticleDownload View PDF
We describe a complete solution of the linear-quaratic control problem with the linear term in the objective function on a semiinfinite interval. This problem has important applications to calculation of Nesterov-Todd and other primal-dual directions in infinite-dimensional setting. CitationTechnical report, University of Notre Dame, December, 2003ArticleDownload View PDF
Several Multi-Criteria-Decision-Making methodologies assume the existence of weights associated with the different criteria, reflecting their relative importance. One of the most popular ways to infer such weights is the Analytic Hierarchy Process, which constructs first a matrix of pairwise comparisons, from which weights are derived following one out of many existing procedures, such as the … Read more
This paper is concerned with the study of envelope theorems for finite choice sets. More specifically, we consider the problem of differentiability of the value function arising out of the maximization of a parametrized objective function, when the set of alternatives is non-empty and finite. The parameter is confined to the closed interval [0,1] and … Read more
Consider a real polynomial $p$ and a semi-algebraic subset $S$ of the complex plane, defined by finitely many polynomial inequalities $g_k(z,\bar{z}) \geq 0$ for some complex polynomials $\{g_k\}$. We provide necessary and sufficient conditions on the coefficients of $p$ for the zeros of $p$ to be in $S$. CitationIEEE Trans. Automatic Control 49 (2004), pp. … Read more
We show that a simple genralization of the Deferred Acceptance Procedure with men proposing due to Gale and Shapley(1962), yeilds outcomes for a generalized marriage problem, which are necessarily stable. We also show, that any outcome of this prcedure is Weakly Pareto Optimal for Men, i.e., there is no other outcome which all men prefer … Read more
In this paper we consider the question of solving equilibrium problems—formulated as complementarity problems and, more generally, mathematical programs with equilibrium constraints (MPEC’s)—as nonlinear programs, using an interior-point approach. These problems pose theoretical difficulties for nonlinear solvers, including interior-point methods. We examine the use of penalty methods to get around these difficulties, present an example … Read more
In this paper we study the relationship between bilevel optimization and bicriteria optimization. Given a bilevel optimization problem, we introduce an order relation such that the optimal solutions of the bilevel problem are the nondominated points with respect to the order relation. In the case where the lower level problem of the bilevel optimization problem … Read more
The purpose of this paper is to obtain conditions on weak tournaments, which guarantee that every non-empty subset of alternatives admits a stable set. We show that every stable set always contains the core. We also show that there exists a unique stable set for each non-empty subset of alternatives which coincides with its core … Read more
The paper studies and designs an genetic algorithm (GA) of the bilevel linear programming problem (BLPP) by constructing the fitness function of the upper-level programming problem based on the definition of the feasible degree. This GA avoids the use of penalty function to deal with the constraints, by changing the randomly generated initial population into … Read more