Results 31 to 40 of about 303,366 (308)
Compact Preference Representation in Stable Marriage Problems [PDF]
, 2009 The stable marriage problem has many practical applications in two-sided markets like those that assign doctors to hospitals, students to schools, or buyers to vendors. Most algorithms to find stable marriages assume that the participants explicitly expresses a preference ordering.
PILOTTO E +3 more
openaire +1 more source
Abstract argumentation and (optimal) stable marriage problems
Argument & Computation, 2019 In his pioneering work on Abstract Argumentation, P.M. Dung set a wide scenario by connecting stable models in Logic and Game Theory to simple Abstract Argumentation Frameworks ( AAF), which are essentially directed graphs in which arguments are represented as nodes, and the attack relation is represented by arrows.
Stefano Bistarelli, Francesco Santini
openalex +5 more sources
The Unsplittable Stable Marriage Problem [PDF]
, 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 +1 more source
Improving Man-Optimal Stable Matchings by Minimum Change of Preference Lists
Algorithms, 2013 In the stable marriage problem, any instance admits the so-called man-optimal stable matching, in which every man is assigned the best possible partner.
Shuichi Miyazaki +4 more
doaj +1 more source
Applied Sciences, 2023 A critical part of Automated Material Handling Systems (AMHS) is the task allocation and dispatching strategy employed. In order to better understand and investigate this component, we here present an extensive experimental evaluation of three different ...
Fabian Maas genannt Bermpohl +2 more
doaj +1 more source
Linear Time Local Approximation Algorithm for Maximum Stable Marriage
Algorithms, 2013 We consider a two-sided market under incomplete preference lists with ties, where the goal is to find a maximum size stable matching. The problem is APX-hard, and a 3/2-approximation was given by McDermid [1]. This algorithm has a non-linear running time,
Zoltán Király
doaj +1 more source
Randomized approximation of the stable marriage problem
Theoretical Computer Science, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Halldórsson, Magnús M. +3 more
openaire +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
Instability in Stable Marriage Problem: Matching Unequally Numbered Men and Women
Complexity, 2018 The goal of the stable marriage problem is to match by pair two sets composed by the same number of elements. Due to its widespread applications in the real world, especially the unique importance to the centralized matchmaker, a very large number of ...
Gui-Yuan Shi +4 more
doaj +1 more source
Научный диалог, 2020 The results of a comparative analysis of the texts of the Yakut and Tuvan epics in order to establish common features in the epic heritage of the Yakut and Tuvan peoples are presented in the article.
A. F. Koryakina
doaj +1 more source