Results 41 to 50 of about 3,739,569 (169)

Stable matchings with couples

open access: yesDiscrete Applied Mathematics, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Brian Aldershof, Olivia M. Carducci
openaire   +1 more source

Stable Noncrossing Matchings [PDF]

open access: yes, 2019
This paper has appeared at IWOCA ...
Suthee Ruangwises, Toshiya Itoh
openaire   +2 more sources

Stable matchings and preferences of couples [PDF]

open access: yesJournal of Economic Theory, 2005
Couples looking for jobs in the same labor market may cause instabilities. We determine a natural preference domain, the domain of weakly responsive preferences, that guarantees stability. Under a restricted unemployment aversion condition we show that this domain is maximal for the existence of stable matchings. We illustrate how small deviations from
Bettina Klaus, Flip Klijn
openaire   +4 more sources

Characterisation of Strongly Stable Matchings [PDF]

open access: yesACM-SIAM Symposium on Discrete Algorithms, 2015
An instance of a strongly stable matching problem (SSMP) is an undirected bipartite graph G = (A∪B, E), with an adjacency list of each vertex being a linearly ordered list of ties, which are subsets of vertices equally good for a given vertex.
Adam Kunysz   +2 more
semanticscholar   +1 more source

Random stable matchings [PDF]

open access: yesJournal of Statistical Mechanics: Theory and Experiment, 2005
11 pages, 9 figures (v2: minor changes, published version)
openaire   +2 more sources

Stable matchings of teachers to schools [PDF]

open access: yesTheoretical Computer Science, 2015
Several countries successfully use centralized matching schemes for school or higher education assignment, or for entry-level labour markets. In this paper we explore the computational aspects of a possible similar scheme for assigning teachers to ...
K. Cechlárová   +3 more
semanticscholar   +1 more source

Classified Stable Matching

open access: yesProceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010
We introduce the {\sc classified stable matching} problem, a problem motivated by academic hiring. Suppose that a number of institutes are hiring faculty members from a pool of applicants. Both institutes and applicants have preferences over the other side.
openaire   +3 more sources

A study of stability and quintessence polytropic matter with thin shell wormholes in exponential gravity

open access: yesNuclear Physics B
This paper presents a feasible static and cylinder-like symmetric thin shell wormhole model within the exponential form of f(R, T) gravity with normalized Ricci scalar relative to the cosmological constant and this gravity model is coherent with local ...
M.Z. Bhatti   +3 more
doaj   +1 more source

Stable Matching with Interviews

open access: yesCoRR
In several two-sided markets, including labor and dating, agents typically have limited information about their preferences prior to mutual interactions. This issue can result in matching frictions, as arising in the labor market for medical residencies, where high application rates are followed by a large number of interviews.
Itai Ashlagi   +3 more
openaire   +4 more sources

Persuading Stable Matching

open access: yesCoRR
In bipartite matching problems, agents on two sides of a graph want to be paired according to their preferences. The stability of a matching depends on these preferences, which in uncertain environments also reflect agents' beliefs about the underlying state of the world. We investigate how a principal -- who observes the true state of the world -- can
Jonathan Shaki, Jiarui Gan, Sarit Kraus
openaire   +2 more sources

Home - About - Disclaimer - Privacy