Related papers: On a Generalization of the Marriage Problem
In 1976, Knuth asked if the stable marriage problem (SMP) can be generalized to marriages consisting of 3 genders. In 1988, Alkan showed that the natural generalization of SMP to 3 genders ($3$GSM) need not admit a stable marriage. Three…
We study generalized monogamy and polygamy relations for concurrence of assistance and negativity of assistance using parametrized bounds in general multi-partite quantum systems. The new method overcomes the shortcomings of previous…
An effective method for generating linear equations of maximal symmetry in their much general normal form is obtained. In the said normal form, the coefficients of the equation are differential functions of the coefficient of the term of…
Why bother with fully rigorous proofs when one can very quickly get semi-rigorous ones? Yes, yes, we know how to get a "rigorous" proof of the result stated in the title of this article. One way is the boring, human one, citing some heavy…
The great innovation of the Generalized Theorem is that it gives us the philosophy to work out the knowledge that the number of roots of an equation depends on the subfields of the functional terms of the equation they generate. Thus, the…
The matching problem plays a basic role in combinatorial optimization and in statistical mechanics. In its stochastic variants, optimization decisions have to be taken given only some probabilistic information about the instance. While the…
In this paper, we prove the Gallai-Edmonds structure theorem for the most general matching polynomial. Our result implies the Parter-Wiener theorem and its recent generalization about the existence of principal submatrices of a Hermitian…
We consider a variant of socially stable marriage problem where preference lists may be incomplete, may contain ties and may have bounded length. In real world application like NRMP and Scottish medical matching scheme such restrictions…
We investigate the question as to when the members of a finite regular semigroup may be permuted in such a way that each member is mapped to one of its inverses. In general this is not possible. However we reformulate the problem in terms…
We present here a more general version of the balanced pair algorithm. This version works in the reducible case and terminates more often than the standard algorithm. We present examples to illustrate this point. Lastly, we discuss the…
We study the Reaching Stable Marriage via Divorces (DivorceSM) problem of deciding, given a Stable Marriage instance and an initial matching $M$ , whether there exists a stable matching which is reachable from $M$ by divorce operations as…
Stable marriage of a two-sided market with unit demand is a classic problem that arises in many real-world scenarios. In addition, a unique stable marriage in this market simplifies a host of downstream desiderata. In this paper, we explore…
We provide a generalized definition of polygamy relations for any quantum correlation measures. Instead of the usual polygamy inequality, a polygamy relation with equality is given by introducing the polygamy weight. From the polygamy…
In this paper, we study the strong convergence of an algorithm to solve the variational inequality problem which extends(Thong et al, Numerical Algorithms. 78, 1045-1060 (2018)). We have reduced and refined some of their algorithm's…
We study a variation of the Stable Marriage problem, where every man and every woman express their preferences as preference lists which may be incomplete and contain ties. This problem is called the Stable Marriage problem with Ties and…
We study popular matchings in three classical settings: the house allocation problem, the marriage problem, and the roommates problem. In the popular matching problem, (a subset of) the vertices in a graph have preference orderings over…
We consider the popular matching problem in a roommates instance with strict preference lists. While popular matchings always exist in a bipartite instance, they need not exist in a roommates instance. The complexity of the popular matching…
We construct a convergent family of outer approximations for the problem of optimizing polynomial functions over convex bodies subject to polynomial constraints. This is achieved by generalizing the polarization hierarchy, which has…
We consider Stable Marriage with Covering Constraints (SMC): in this variant of Stable Marriage, we distinguish a subset of women as well as a subset of men, and we seek a matching with fewest number of blocking pairs that matches all of…
Using the basic prolongation method and the infinitesimal criterion of invariance, we find the most general Lie point symmetries group of the Thomas equation. Looking the adjoint representation of the obtained symmetry group on its Lie…