Distributive lattice whose elements are stable matchings
In mathematics, economics, and computer science, the lattice of stable matchings is a distributive lattice whose elements are stable matchings. For a given instance of the stable matching problem, this lattice provides an algebraic description of the family of all solutions to the problem. It was originally described in the 1970s by John Horton Conway and Donald Knuth.[1][2]
By Birkhoff's representation theorem, this lattice can be represented as the lower sets of an underlying partially ordered set. The elements of this set can be given a concrete structure as rotations, with cycle graphs describing the changes between adjacent stable matchings in the lattice. The family of all rotations and their partial order can be constructed in polynomial time, leading to polynomial time solutions for other problems on stable matching including the minimum or maximum weight stable matching. The Gale–Shapley algorithm can be used to construct two special lattice elements, its top and bottom element.
Every finite distributive lattice can be represented as a lattice of stable matchings.
The number of elements in the lattice can vary from an average case of to a worst-case of exponential.
Computing the number of elements is #P-complete.
^Cite error: The named reference knuth was invoked but never defined (see the help page).
^Cite error: The named reference hwang was invoked but never defined (see the help page).
and 22 Related for: Lattice of stable matchings information
science, the latticeofstablematchings is a distributive lattice whose elements are stablematchings. For a given instance of the stablematching problem...
stable matching problem. The stablematching polytope is the convex hull of the indicator vectors of the stablematchingsof the given problem. It has a...
Gale and Lloyd Shapley finds a stable matching in their setting; moreover, the set ofstablematchings forms a lattice, and similar vacancy chain dynamics...
super-stablematching else no strongly stablematching exists In many problems, there can be several different stablematchings. The set ofstable matchings...
Bloom filters being the case of the Boolean two-element lattice). Instead of a bit array, they have an array oflattice elements. When adding a new association...
certain range of the lattice parameters. More accurate lattice parameters allow a narrower range and, thus, a better match. Latticematching is useful in...
Equivalently, its vertices can be thought of as describing all perfect matchings in a complete bipartite graph, and a linear optimization problem on this...
unimodular lattice. As a lattice, it holds the optimal structure for the densest packing of 240 spheres in eight dimensions, whose lattice points also...
The distributive polytopes all of whose vertex coordinates are 0 or 1 are exactly the order polytopes. Stablematching polytope, a convex polytope that...
can be also grown in a semi-insulating form, which is suitable as a lattice-matching insulating substrate for GaAs devices. Conversely, silicon is robust...
discovery. The change and sharpness of the electron backscatter patterns (EBSPs) provide information about lattice distortion in the diffracting volume...
is cooled, a lattice mismatch strain arises between TGO and the top coat (TC) due to differing thermal expansion coefficients. Lattice mismatch strain...
automaton consists of a regular grid of cells, each in one of a finite number of states, such as on and off (in contrast to a coupled map lattice). The grid can...
many pores of uniform size because the boundary diffusion distance is smallest. during the latter portions of the process, boundary and lattice diffusion...
can be emitted by using the process of sound amplification based on stimulated emission of phonons. Sound (or lattice vibration) can be described by a phonon...
perfect 1-factorization is a partition of the edges of a graph into perfect matchings so that each two matchings form a Hamiltonian cycle. peripheral 1...
lattice, ytterbium crystallizes in the face-centered cubic system. Ytterbium has a density of 6.973 g/cm3, which is significantly lower than those of...
the nodes of a lattice and deforming the object with the lattice. However, explicit solutions to these systems are not very numerically stable and are extremely...
these tiles can only exhibit a hierarchy of square lattices: the centre of any orange square is also a corner of a larger orange square, ad infinitum. Any...
repeating structure. This is known as the lattice structure, which is responsible for the regular arrangement of the atoms in the crystal. Optical anisotropy:...
the lattice, of 20 to 25% depending on the specific GeSbTe compound. Hence, Te has an extra lone pair of electrons, which are important for many of the...
Global Information