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 36 for “"Stable Marriage"”.

  1. Integer and stable marriage models for assignments to preschools

    Á hverju vori lýkur stór hópur barna leikskólavist á höfuðborgarsvæðinu til að hefja grunnskólagöngu þá um haustið. Um það leyti stendur Reykjavíkurborg frammi fyrir ákvörðunartökuvandamáli um hvernig úthluta eigi lausum plássum leikskóla, sem staðsettir eru víðsvegar um borgina. Í þessari ritgerð …

    reykjavik Repository record for Integer and stable marriage models for assignments to preschools (opens in a new tab)

  2. Structure of the Stable Marriage and Stable Roommate Problems and Applications

    … Gale-Shapley algorithm is a solution to the stable marriage problem, but always results in the same stable marriage, regardless of how the algorithm is executed. Robert Irving and Paul Leather constructed the rotation poset, whose downward closed sets are in one-to-one correspondence with the …

    south-carolina Repository record for Structure of the Stable Marriage and Stable Roommate Problems and Applications (opens in a new tab)

  3. An approach to robustness in stable marriage and stable roommates problems

    … matching problems. Our robustness notion for the stable matching framework is motivated by the unforeseen events that may occur after a matching is computed. We define the notion of (a,b)-supermatches as a measure of robustness of a matching. An (a,b)-supermatch characterizes a stable matching …

    cork Repository record for An approach to robustness in stable marriage and stable roommates problems (opens in a new tab)

  4. Batch Testing, Adaptive Algorithms, and Heuristic Applications for Stable Marriage Problems

    … we focus on different variations of the stable matching (marriage) problem, initially posed by Gale and Shapley in 1962. In this problem, preference lists are used to match n men with n women in such a way that no (man, woman) pair exists that would both prefer each other over their …

    clemson Repository record for Batch Testing, Adaptive Algorithms, and Heuristic Applications for Stable Marriage Problems (opens in a new tab)

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

    … 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 projects (SPA). Primarily we are interested in finding matchings …

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

  6. A generalization of the stable marriage algorithms involving group preferences in resource allocation problems

    … for a given linear objective function and are stable with regard to preferences of the resources and activities. The concept of a stable matching comes from the stable marriage problem. Given an equal number of men and women, and, for each person, a strictly ordered preference list containing …

    hawaii Repository record for A generalization of the stable marriage algorithms involving group preferences in resource allocation problems (opens in a new tab)

  7. Unit-demand auctions : fast algorithms for special cases and a connection to stable marriage with indifferences

    … connection between unit-demand auctions and the stable marriage model (and more generally, the college admissions model). We present a framework based on two variants of unit-demand auctions: the first variant, a unit-demand auction with priorities (UAP), extends a unit-demand auction by …

    texas Repository record for Unit-demand auctions : fast algorithms for special cases and a connection to stable marriage with indifferences (opens in a new tab)

  8. Matchings and games on networks

    … 4 we propose a generalization of the classical stable marriage problem. In our model the preferences on one side of the partition are given in terms of arbitrary binary relations, that need not be transitive nor acyclic. This generalization is practically well-motivated, and as we show, …

    waterloo Repository record for Matchings and games on networks (opens in a new tab)

  9. A structural approach to matching problems with preferences

    … algorithm for the problem of finding a maximum stable matching for an instance of the stable marriage problem with ties and incomplete lists (MAX-SMTI). Our polynomial time approximation algorithm provides a performance guarantee of 3/2 for the general version of MAX-SMTI, improving upon the …

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

  10. The effects of military assignments and duties on the marital status of Navy officers

    … if military duties and assignments affect the marriage and divorce decisions of United States Navy officers. Previous studies suggest that a stable marriage can have a positive influence on a military member's performance. However, no previous research has looked specifically at how duties and …

    nps Repository record for The effects of military assignments and duties on the marital status of Navy officers (opens in a new tab)

  11. Deep Learning for Graph Matching

    … and negative-informative. We demonstrate that stable matching algorithms, adapted from the stable marriage problem, can achieve optimal matching for both node sets in a contrastive learning setting. Second, we address a critical gap in partial graph matching: the lack of an optimization …

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

  12. Efficient algorithms for bipartite matching problems with preferences

    … problem (HR), a generalisation of the classical Stable Marriage problem. For each of these problems, we obtain a characterisation of Pareto optimal matchings, and then use this to obtain a polynomial-time algorithm for finding a maximum Pareto optimal matching. The next optimality criterion that …

    glasgow Download PDF for Efficient algorithms for bipartite matching problems with preferences (opens in a new tab)

  13. Automated reasoning and machine learning

    … zebra problem, the pigeonhole problem, and the stable marriage problem. The case analysis technique we use is the first to be fully compatible with resolution and rewriting and powerful enough to solve these problems. Our primary new theorem-proving strategies generate subgoals and efficient …

    hawaii Repository record for Automated reasoning and machine learning (opens in a new tab)

  14. Sufficient conditions for the existence of specified subgraphs in graphs

    … of finding a matching in a graph. The stable marriage problem was introduced by Gale and Shapley in 1962 and the generalization to multiple dimensions was first mentioned by Knuth in 1976. We consider a generalization of the Stable Marriage problem with s-dimensions and purely cyclic …

    uiuc Repository record for Sufficient conditions for the existence of specified subgraphs in graphs (opens in a new tab)

  15. Performant combinatorial optimization algorithms through lattice linear predicates

    … including shortest paths, breadth-first search, stable marriage, job scheduling, parallel reduction, transitive closure, and 0-1 knapsack. We test all seven with a single, stan- dardized experiment-and-results framework. The results show three regimes of performance: major acceleration (up to …

    texas Repository record for Performant combinatorial optimization algorithms through lattice linear predicates (opens in a new tab)

  16. Metalogical Contributions to the Nonmonotonic Theory of Abstract Argumentation

    … as a tool for solving well-known problems as the stable-marriage problem. This thesis is mainly concerned with the investigation of metalogical properties of Dung’s abstract theory. In particular, we provide cardinality, monotonicity and splitting results as well as characterization theorems for …

    qucosa-diss

  17. Parameterised algorithms for counting subgraphs, matchings, and monochromatic partitions

    … graphs in large host graphs with this structure. Stable matching problems arise when we wish to match together a set of agents in such a way that no pair of agents would mutually prefer to deviate from the assignment. The problem of counting stable matchings is computationally hard even in the …

    glasgow Download PDF for Parameterised algorithms for counting subgraphs, matchings, and monochromatic partitions (opens in a new tab)

Page 1 of 2