Results 261 to 270 of about 2,510,319 (291)
Some of the next articles are maybe not open access.
2006
Stable matching is one of the oldest problems studied from an algorithmic point of view, whose original version is defined as follows: An instance consists of N men, N women, and each person's preference list. A preference list is a totally ordered list including all members of the opposite sex depending on his/her preference.
openaire +2 more sources
Stable matching is one of the oldest problems studied from an algorithmic point of view, whose original version is defined as follows: An instance consists of N men, N women, and each person's preference list. A preference list is a totally ordered list including all members of the opposite sex depending on his/her preference.
openaire +2 more sources
2017
The maximum stable matching problem (Max-SMP) and the minimum stable matching problem (Min-SMP) have been known to be NP-hard for subcubic bipartite graphs, while Max-SMP can be solved in polynomal time for a bipartite graph G with a bipartition (X, Y) such that \(\mathrm{deg}_{G}(v)\le 2\) for any \(v\in X\). This paper shows that both Max-SMP and Min-
Satoshi Tayu, Shuichi Ueno
openaire +1 more source
The maximum stable matching problem (Max-SMP) and the minimum stable matching problem (Min-SMP) have been known to be NP-hard for subcubic bipartite graphs, while Max-SMP can be solved in polynomal time for a bipartite graph G with a bipartition (X, Y) such that \(\mathrm{deg}_{G}(v)\le 2\) for any \(v\in X\). This paper shows that both Max-SMP and Min-
Satoshi Tayu, Shuichi Ueno
openaire +1 more source
The dynamics of stable matchings and half-matchings for the stable marriage and roommates problems
International Journal of Game Theory, 2007This paper studies the dynamics of stable marriage and stable roommates markets. The main tool of this paper is the algorithm of Roth and Vande Vate and its generalization by Tan and Hsueh. Beyond proposing alternative proofs for known results, some of them are generalized to the nonbipartite case. In particular, it is shown that the lastcomer gets his
Péter Biró 0001 +2 more
openaire +1 more source
On the Existence of Stable Roommate Matchings
Games and Economic Behavior, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Stable Matching as Transportation
Proceedings of the 25th ACM Conference on Economics and ComputationFederico Echenique +2 more
openaire +2 more sources
Three-dimensional stable matching with cyclic preferences
Optimization Letters, 2020Kanstantsin Pashkovich +1 more
exaly
Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry)
Discrete Applied Mathematics, 2000Michel Balinski
exaly
Many-to-One Stable Matching: Geometry and Fairness
Mathematics of Operations Research, 2006Chung Piaw Teo, Jay Sethuraman
exaly
A Matroid Generalization of the Super-Stable Matching Problem
SIAM Journal on Discrete Mathematics, 2022exaly