Results 31 to 40 of about 963,583 (273)
Maintaining Stability for a Matching Problem Under Dynamic Preference
IEEE Access, 2023 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]
Games and Economic Behavior, 2020 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 International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2020 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
Applied Sciences, 2022 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
Matching-Updating Mechanism: A Solution for the Stable Marriage Problem with Dynamic Preferences
Entropy, 2022 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
Counting Houses of Pareto Optimal Matchings in the House Allocation Problem [PDF]
, 2016 Let $A,B$ with $|A| = m$ and $|B| = n\ge m$ be two sets. We assume that every element $a\in A$ has a reference list over all elements from $B$. We call an injective mapping $\tau$ from $A$ to $B$ a matching. A blocking coalition of $\tau$ is a subset $A'$
Asinowski, Andrei +2 more
core +2 more sources
Utility-Based Stable Matching For Large Scale EH Relay Networks With Finite-Alphabet Inputs
IEEE Access, 2019 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
Social Choice and WelfareGale and Shapley introduced a matching problem between two sets of agents where each agent on one side has an exogenous preference ordering over the agents on the other side. They defined a matching as stable if no unmatched pair can both improve their utility by forming a new pair.
Felipe Garrido-Lucero, Rida Laraki
openaire +2 more sources
Constrainedness in Stable Matching
2018 IEEE 30th International Conference on Tools with Artificial Intelligence (ICTAI), 2018 In constraint satisfaction problems, constrainedness provides a way to predict the number of solutions: for instances of a same size, the number of constraints is inversely correlated with the number of solutions. However, there is no obvious equivalent metric for stable matching problems.
Escamocher, Guillaume, O'Sullivan, Barry
openaire +2 more sources
Tạp chí Khoa họcThis 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