Results 1 to 10 of about 7,398,457 (268)

Matching-Updating Mechanism: A Solution for the Stable Marriage Problem with Dynamic Preferences [PDF]

open access: yesEntropy, 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   +4 more sources

Pairwise Preferences in the Stable Marriage Problem [PDF]

open access: yesACM Transactions on Economics and Computation, 2021
We study the classical, two-sided stable marriage problem under pairwise preferences. In the most general setting, agents are allowed to express their preferences as comparisons of any two of their edges, and they also have the right to declare a draw or even withdraw from such a comparison.
Ágnes Cseh, Attila Juhos
openaire   +6 more sources

A scenario-based parametric analysis of the army personnel-to-assignment matching problem [PDF]

open access: yesJournal of Defense Analytics and Logistics, 2020
Purpose – This study aims to compare linear programming and stable marriage approaches to the personnel assignment problem under conditions of uncertainty.
Matthew D. Ferguson   +2 more
doaj   +1 more source

ظاهرة تأخر سن الزواج وعلاقته بالسحر والشعوذة دراسة تحليلية [PDF]

open access: yesمجلة القراءة والمعرفة, 2023
    تعد الأسرة أهم الوحدات الاجتماعية التى تلعب الدور الرئيسى فى المحافظة على استمرار الحياة الاجتماعية، وهى أساس المجتمع، فمنها يبدأ وعليها يعتمد، وبقدر ما تكون الأسرة مترابطة بقدر مايكون المجتمع قويا ومترابطا، والزواج هو الوسيلة المثلى لبناء مجتمع قوى ...
د/ اسمهان أحمد الفضيل العشيبى
doaj   +1 more source

A Note on the Stable Marriage Problem [PDF]

open access: yesSN Computer Science, 2020
Since the pioneering work of Gale and Shapley, the stable marriage problem has received wide treatment by researchers due to its elegance and applicability. The original problem has been generalized and well studied from different angles, and many algorithms have been proposed for the solution of many variants of the traditional formulation. This short
openaire   +1 more source

Die Unauflöslichkeit der Ehe nach Amoris laetitia: Versuch einer theologischen Auseinandersetzung mit Bedenken mancher polnischer Moraltheologen

open access: yesActa Universitatis Carolinae Theologica, 2020
The publication of Amoris laetitia initiated numerous discussions in the circles of theologians who focus on the question of the possibility of sacraments for remarried divorced couples.
Konrad Glombik
doaj   +1 more source

The Unsplittable Stable Marriage Problem [PDF]

open access: yes, 2006
The Gale-Shapley “propose/reject” algorithm is a well-known procedure for solving the classical stable marriage problem. In this paper we study this algorithm in the context of the many-to-many stable marriage problem, also known as the stable allocation or ordinal transportation problem.
Brian C. Dean   +2 more
openaire   +2 more sources

Adaptive Data Collection and Offloading in Multi-UAV-Assisted Maritime IoT Systems: A Deep Reinforcement Learning Approach

open access: yesRemote Sensing, 2023
This paper studies the integration of data collection and offloading for maritime Internet of Things (IoT) systems with multiple unmanned aerial vehicles (UAVs). In the considered multi-UAV maritime IoT system, the UAVs act as the aerial base stations to
Ziyi Liang   +3 more
doaj   +1 more source

Beauty and distance in the stable marriage problem [PDF]

open access: yesPhysica A: Statistical Mechanics and its Applications, 2001
The stable marriage problem has been introduced in order to describe a complex system where individuals attempt to optimise their own satisfaction, subject to mutually conflicting constraints. Due to the potential large applicability of such model to describe all the situation where different objects has to be matched pairwise, the statistical ...
Caldarelli G., Capocci A.
openaire   +5 more sources

Editorial: Special Issue on Matching under Preferences

open access: yesAlgorithms, 2014
This special issue of Algorithms is devoted to the study of matching problems involving ordinal preferences from the standpoint of algorithms and complexity.
Péter Biró, David F. Manlove
doaj   +1 more source

Home - About - Disclaimer - Privacy