Results 31 to 40 of about 236,951 (263)
Dynamically stable matching [PDF]
I introduce a stability notion,dynamic stability, for two‐sided dynamic matching markets where (i) matching opportunities arrive over time, (ii) matching is one‐to‐one, and (iii) matching is irreversible. The definition addresses two conceptual issues. First, since not all agents are available to match at the same time, one must establish which agents ...
openaire +3 more sources
A LANDMARK MATCHING ALGORITHM FOR THE GEOSTATIONARY SATELLITE IMAGES BASED ON MULTI-LEVEL GRIDS [PDF]
The resolution of geostationary satellite image is not high and the image is covered with clouds. At present, when the extracted feature points are unstable, there are some problems, such as low matching accuracy or even matching failure.
S. Y. Hou +4 more
doaj +1 more source
This paper is concerned with stable trading between the coal mining and power generation companies in China. Under the current marketized coal and planned electricity price systems, barriers to price shifting between coal and electricity are created and ...
Ruyi Shi +3 more
doaj +1 more source
Utility-Based Stable Matching For Large Scale EH Relay Networks With Finite-Alphabet Inputs
The computational complexity of utility optimization for a large scale energy harvesting (EH) relay network is extremely high, especially when inputting finite-alphabet signals.
Feng Ke +5 more
doaj +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Brian Aldershof, Olivia M. Carducci
openaire +1 more source
This paper proposes an efficient depth-first search algorithm to solve the maximum stable marriage problem with ties and incomplete preference lists. The key idea of the algorithm is to initialize an empty matching and mark all men as unmatched.
Le Quoc Anh, Hoang Huu Viet +1 more
doaj +1 more source
Stability, Optimality and Manipulation in Matching Problems with Weighted Preferences
The stable matching problem (also known as the stable marriage problem) is a well-known problem of matching men to women, so that no man and woman, who are not married to each other, both prefer each other.
Maria Silvia Pini +3 more
doaj +1 more source
Matching-Updating Mechanism: A Solution for the Stable Marriage Problem with Dynamic Preferences
We studied the stable marriage problem with dynamic preferences. The dynamic preference model allows the agent to change its preferences at any time, which may cause instability in a matching.
Akhmad Alimudin, Yoshiteru Ishida
doaj +1 more source
Stable Noncrossing Matchings [PDF]
This paper has appeared at IWOCA ...
Suthee Ruangwises, Toshiya Itoh
openaire +2 more sources
Stable matchings and preferences of couples [PDF]
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

