Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 69 for “"Stable matching"”.

  1. Structure in Stable Matching Problems

    … two contributions to the study of structure in stable matching problems. The first contribution is a short new proof for the integrality of Rothblum’s linear description of the convex hull of incidence vectors of stable matchings in bipartite graphs. The key feature of our proof is to show that …

    waterloo Repository record for Structure in Stable Matching Problems (opens in a new tab)

  2. Algorithms for stable matching with indifferences

    In the stable matching problem, given a two-sided matching market where each agent has ordinal preferences over the agents on the other side, we would like to find a bipartite matching such that no pair of agents prefer each other to their partners. Indifferences in preferences of the agents arise …

    texas Repository record for Algorithms for stable matching with indifferences (opens in a new tab)

  3. Algorithmic aspects of stable matching problems

    The Stable Marriage problem (SM), the Hospitals/Residents problem (HR) and the Stable Roommates problem (SR) are three classical stable matching problems that were first studied by Gale and Shapley in 1962. These problems have widespread practical application in centralised automated matching …

    glasgow Download PDF for Algorithmic aspects of stable matching problems (opens in a new tab)

  4. A specialised constraint approach for stable matching problems

    … to be represented and solved relatively easily. Stable matching problems consist of a set of participants wishing to be matched into pairs or groups in a stable manner. A matching is said to be stable if there is no pair or group of participants that would rather make a private arrangement to …

    glasgow Download PDF for A specialised constraint approach for stable matching problems (opens in a new tab)

  5. Gender and Computing Algorithms: The case of Stable Matching

    Ανάλυση επιστημονικών δημοσιεύσεων για το πρόβλημα και τους αλγορίθμους του ευσταθούς ταιριάσματος υπό το πρίσμα της Κοινωνικής πλευράς της Επιστήμης και της Τεχνολογίας (Science, Technology, Society) και της θεωρίας του Κοινωνικού Φύλου (Gender Studies).

    athens Repository record for Gender and Computing Algorithms: The case of Stable Matching (opens in a new tab)

  6. Stable Matching with Generalized Preference Assumptions: Algorithmic and Incentive Compatibility Challenges

    Matching markets are ubiquitous, including college admissions, school choice, reviewer paper matching, and various labour market matchings. Many of these matching markets run centralized matching schemes, using algorithms to determine the resulting match. An important property for the matches …

    toronto-retro Repository record for Stable Matching with Generalized Preference Assumptions: Algorithmic and Incentive Compatibility Challenges (opens in a new tab)

  7. TASK ASSIGNMENT IN VARIABLE CAPACITY DRONE SWARMS USING DYNAMICALLY STABLE MATCHING

    … this purpose. This thesis proposes the Dynamic Stable Matching (DSM) algorithm as an alternative approach to deriving task allocation solutions. The algorithm's performance is demonstrated and compared to its alternatives through the implementation of DSM-based area search behaviors for an …

    nps Repository record for TASK ASSIGNMENT IN VARIABLE CAPACITY DRONE SWARMS USING DYNAMICALLY STABLE MATCHING (opens in a new tab)

  8. An Algorithm for Stable Matching with Approximation up to the Integrality Gap

    In the stable matching problem we are given a bipartite graph G = (A ∪ B, E) where A and B represent disjoint groups of agents, each of whom has ordinal preferences over the members of the opposite group. The goal is to find an assignment of agents in one group to those in the other such that no …

    waterloo Repository record for An Algorithm for Stable Matching with Approximation up to the Integrality Gap (opens in a new tab)

  9. Towards Precise Localization in Object Detection: Stable Matching Strategies and Advanced Bounding Box Regression Loss Functions in Deep Neural Networks

    … focuses on stabilizing one-to-one bipartite matching in detection transformers, such as DETR, which streamline object detection by eliminating anchor generation and non-maximum suppression (NMS). Unlike NMS's one-to-many matching, DETR employs the Hungarian algorithm for unique assignments …

    unsw Repository record for Towards Precise Localization in Object Detection: Stable Matching Strategies and Advanced Bounding Box Regression Loss Functions in Deep Neural Networks (opens in a new tab)

  10. Distributive lattices, stable matchings, and robust solutions

    The stable matching problem, first presented by mathematical economists Gale and Shapley, has been studied extensively since its introduction. As a result, a remarkably rich literature on the problem has accumulated in both theory and practice. In this thesis we further extend our understanding on …

    gatech Repository record for Distributive lattices, stable matchings, and robust solutions (opens in a new tab)

  11. Fair and large stable matchings in the stable marriage and student-project allocation problems

    … algorithmic and complexity results for specific matching problems involving preferences. In particular we study the Stable Marriage problem (SM) and the Student-Project Allocation problem (SPA) and their variants. A matching in these scenarios is an allocation of men to women (SM) or students to …

    glasgow Download PDF for Fair and large stable matchings in the stable marriage and student-project allocation problems (opens in a new tab)

  12. Complexity results and integer programming models for hospitals / residents problem variants

    … problem (HR) is a many-to-one bipartite matching problem involving preferences, motivated by centralised matching schemes arising in entry level labour markets, the assignment of pupils to schools and higher education admissions schemes, among its many applications. The particular …

    glasgow Download PDF for Complexity results and integer programming models for hospitals / residents problem variants (opens in a new tab)

  13. An Approximation Algorithm for the Stable Marriagae Problem with Ties and Incomplete Lists

    Consider the bipartite matching problem with two sets of participants: men (L) and women (R). Each person participating has a strict and complete preference list over participants from the other set. The goal is to pair men and women such that no one can improve their partner by breaking away from …

    clemson Repository record for An Approximation Algorithm for the Stable Marriagae Problem with Ties and Incomplete Lists (opens in a new tab)

  14. Deep Learning for Graph Matching

    … nodes and their interactions as edges. The graph matching problem aims to establish correspondences between nodes across two graphs based on feature similarity and structural compatibility. This problem has two main variants: total graph matching, which assumes a total injective mapping from the …

    anu Repository record for Deep Learning for Graph Matching (opens in a new tab)

  15. A structural approach to matching problems with preferences

    This thesis is a study of a number of matching problems that seek to match together pairs or groups of agents subject to the preferences of some or all of the agents. We present a number of new algorithmic results for five specific problem domains. Each of these results is derived with the aid of …

    glasgow Download PDF for A structural approach to matching problems with preferences (opens in a new tab)

  16. Theory and algorithms for matching problems under preferences

    Matching under preferences involves matching agents to one another, subject to various optimality criteria such as stability, popularity, and Pareto-optimality, etc. Each agent expresses ordinal preferences over a subset of the others. Real-life applications include assigning graduating medical …

    texas Repository record for Theory and algorithms for matching problems under preferences (opens in a new tab)

  17. Novel uses of the Mallows model in coloring and matching

    … connections between the Mallows model and stable matching. The celebrated Gale-Shapley algorithm provided the first proof of existence of stable matchings for arbitrary preferences. This is a fundamental result in the economic theory of stable allocations, a theory which appeared in the …

    washington Repository record for Novel uses of the Mallows model in coloring and matching (opens in a new tab)

Page 1 of 4