Results 121 to 130 of about 3,739,569 (169)
Some of the next articles are maybe not open access.
On the Existence of Three-Dimensional Stable Matchings with Cyclic Preferences
Theory of Computing Systems, 2019We study the three-dimensional stable matching problem with cyclic preferences. This model involves three types of agents, with an equal number of agents of each type. The types form a cyclic order such that each agent has a complete preference list over
Chi-Kit Lam, C. G. Plaxton
semanticscholar +1 more source
Approximately Stable Matchings with General Constraints
Adaptive Agents and Multi-Agent Systems, 2019This paper focuses on two-sided matching where one side (a hospital or firm) is matched to the other side (a doctor or worker) so as to maximize a cardinal objective under general feasibility constraints. In a standard model, even though multiple doctors
Yasushi Kawase, Atsushi Iwasaki
semanticscholar +1 more source
Many-to-Many Stable Matchings with Ties, Master Preference Lists, and Matroid Constraints
Adaptive Agents and Multi-Agent Systems, 2019In this paper, we consider a matroid generalization of the hospitals/residents problem with ties. Especially, we focus on the situation in which we are given a master list and the preference list of each hospital over residents is derived from this ...
Naoyuki Kamiyama
semanticscholar +1 more source
Stable matchings and stable partitions
International Journal of Computer Mathematics, 1991Recently Tan [7] defined a new structure for the stable roommates problem, called a “stable partition” which is a generalization of the notion of the stable matching. He proved that every instance of that problem contains at least one such structure, and obtained a succinct certificate of the non-existence of a stable matching. In this paper.
openaire +1 more source
Finding Stable Matchings that are Robust to Errors in the Input
Embedded Systems and Applications, 2018We study the problem of finding solutions to the stable matching problem that are robust to errors in the input and we obtain a polynomial time algorithm for a special class of errors.
Tung Mai, V. Vazirani
semanticscholar +1 more source
Stable Matching with Proportionality Constraints
Proceedings of the 2017 ACM Conference on Economics and Computation, 2017School choice programs seek to give students the option to choose their school but also close an opportunity gap. To be fair in the assignment of students, it is usually argued that the assignment of students to schools should be stable. This second concern is usually expressed in terms of proportions. As an example, in 1989, the city of White Plains,
Thành Nguyen 0001, Rakesh Vohra
openaire +1 more source
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
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 +1 more source
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 +1 more source
Stable Matching with Network Externalities
Algorithmica, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Elliot Anshelevich +2 more
openaire +2 more sources
Friendship and Stable Matching
2013We study stable matching problems in networks where players are embedded in a social context, and may incorporate friendship relations or altruism into their decisions. Each player is a node in a social network and strives to form a good match with a neighboring player.
Elliot Anshelevich +2 more
openaire +2 more sources