Strongly Stable Matchings under Matroid Constraints

  title={Strongly Stable Matchings under Matroid Constraints},
  author={Naoyuki Kamiyama},
We consider a many-to-one variant of the stable matching problem. More concretely, we consider the variant of the stable matching problem where one side has a matroid constraint. Furthermore, we consider the situation where the preference of each agent may contain ties. In this setting, we consider the problem of checking the existence of a strongly stable matching, and finding a strongly stable matching if a strongly stable matching exists. We propose a polynomial-time algorithm for this… 

Envy-free matchings with one-sided preferences and matroid constraints

A Matroid Generalization of the Super-Stable Matching Problem

This paper considers a matroid generalization of a super-stable matching, which is a solution concept in a variant of the stable matching problem in which the preferences may contain ties, and calls its generalization asuper-stable common independent set.

Stable Matchings with Ties, Master Preference Lists, and Matroid Constraints

A matroid generalization of the hospitals/residents problem with ties and master lists is considered, and polynomial-time algorithms for deciding whether there exist a super-stable matching and a strongly stable matching in this model are given.

On Stable Matchings with Pairwise Preferences and Matroid Constraints

This paper considers the following generalization of the stable matching problem, and focuses on the situation in which a master list is given over the doctors, and the preference list of each hospital over theDoctors is derived from this master list.

A Faster Algorithm for the Strongly Stable b-Matching Problem

The notion of strong stability is investigated and an algorithm for computing a strongly stable b-matching optimal for vertices of A is given, where m = |E|, which improves on the previous algorithm by Chen and Ghosh.

A Generalized Polymatroid Approach to Stable Matchings with Lower Quotas

A polynomial-time algorithm which finds a stable matching or reports the nonexistence is designed and it is shown that the set of stable matchings, if nonempty, forms a lattice with several significant properties.

Strongly Stable Assignment

A strongly polynomial time algorithm is given to determine the existence of a strongly stable assignment, and compute one if it exists, and the central component of this algorithm is a generalization of the notion of the critical set in bipartite matchings to the critical subgraph in bipartsite assignment.

A Fixed-Point Approach to Stable Matchings and Some Applications

A matroid-generalization of the stable marriage theorem is formulated and results of Vande Vate and Rothblum are extended on the bipartite stable matching polytope and the lattice structure of generalized stable matchings are studied.

Characterisation of Strongly Stable Matchings

It is shown that there exists a partial order with O(m) elements representing all strongly stable matchings, where m denotes the number of edges in the graph, and two algorithms are given that construct two such representations.

A Matroid Approach to Stable Matchings with Lower Quotas

A matroid-based approach to the laminar classified stable matching problem (LCSM) is proposed and it is proved that the set of stable assignments of the LCSM problem has a lattice structure similarly to the ordinary stable matching model.