Results 31 to 40 of about 972,187 (291)
Local Search Approaches in Stable Matching Problems
The stable marriage (SM) problem has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools or, more generally, to any two-sided market.
Toby Walsh +4 more
doaj +1 more source
Maintaining Stability for a Matching Problem Under Dynamic Preference
This study investigates two-sided matching and considers dynamic preference. In a stable matching problem, dynamic preference is a situation that often happens in real-world situations where the agent cannot express their preference with certainty.
Akhmad Alimudin +2 more
doaj +1 more source
Essentially stable matchings [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Peter Troyan +2 more
openaire +1 more source
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
Matching Dynamics with Constraints [PDF]
We study uncoordinated matching markets with additional local constraints that capture, e.g., restricted information, visibility, or externalities in markets.
A. Bogomolnaia +22 more
core +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
Approximation algorithms for hard variants of the stable marriage and hospitals/residents problems [PDF]
When ties and incomplete preference lists are permitted in the Stable Marriage and Hospitals/Residents problems, stable matchings can have different sizes.
AE Roth +20 more
core +2 more sources
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
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
An 8/5 approximation algorithm for a hard variant of stable marriage [PDF]
When ties and incomplete preference lists are permitted in the Stable Marriage problem, stable matchings can have different sizes. The problem of finding a maximum cardinality stable matching in this context is NP-hard, even under very severe ...
Irving, R.W., Manlove, D.F.
core +1 more source

