Results 21 to 30 of about 2,510,319 (291)
Stable marriages and search frictions [PDF]
, 2014 Stable matchings are the primary solution concept for two-sided matching markets with nontransferable utility. We investigate the strategic foundations of stability in a decentralized matching market.
Nöldeke, Georg, Lauermann, Stephan
core +1 more source
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 +1 more
openaire +3 more sources
Conditional stable matchings [PDF]
Acta Scientiarum Mathematicarum, 2013 In matching theory of contracts the substitutes condition plays an essential role to ensure the existence of stable matchings. We study many-to-many matchings where groups of individuals, of size possibly greater than two, are matched to a set of institutions.
Vilmos Komornik, Christelle Viauroux
openaire +2 more sources
The exchange-stable marriage problem [PDF]
, 2005 In this paper we consider instances of stable matching problems, namely the classical stable marriage (SM) and stable roommates (SR) problems and their variants. In such instances we consider a stability criterion that has recently been proposed, that of
Cechlarova, K., Manlove, D.F.
core +1 more source
A Note on the Uniqueness of Stable Marriage Matching
Discussiones Mathematicae Graph Theory, 2013 In this note we present some sufficient conditions for the uniqueness of a stable matching in the Gale-Shapley marriage classical model of even size. We also state the result on the existence of exactly two stable matchings in the marriage problem of odd
Drgas-Burchardt Ewa
doaj +1 more source
Faster and Simpler Approximation of Stable Matchings
Algorithms, 2014 We give a 3 2 -approximation algorithm for finding stable matchings that runs in O(m) time. The previous most well-known algorithm, by McDermid, has the same approximation ratio but runs in O(n3/2m) time, where n denotes the number of people andm ...
Katarzyna Paluch
doaj +1 more source
Blockchain-Based Decentralized Federated Learning Method in Edge Computing Environment
Applied Sciences, 2023 In recent years, federated learning has been able to provide an effective solution for data privacy protection, so it has been widely used in financial, medical, and other fields.
Song Liu +3 more
doaj +1 more source
Stability and Nash implementation in matching markets with couples [PDF]
, 2008 Haake C-J, Klaus B. Stability and Nash implementation in matching markets with couples. Working Papers. Institute of Mathematical Economics. Vol 399. Bielefeld: Universität Bielefeld; 2008.We consider two-sided matching markets with couples.
Klaus, B.E. +5 more
core +2 more sources
Multi-Attribute Crowdsourcing Task Assignment With Stability and Satisfactory
IEEE Access, 2019 Recently, crowdsourcing applications for smart cities have become more and more popular due to its higher work efficiency and lower work costs. However, the reasonable task assignment is still one of the important challenges for crowdsourcing.
Yuping Xing +3 more
doaj +1 more source
IRS-Assisted Physical Layer Security for 5G Enabled Industrial Internet of Things
IEEE Access, 2023 5G is a key enabler of Industrial Internet of Things (IIoT) that provides seamless connectivity between machines, sensors and computing servers. Security and privacy are major concerns for 5G enabled IIoT.
Bakhtiar Ali +5 more
doaj +1 more source