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 26 for “"Stable Matchings"”.
-
Properties of Stable Matchings
Stable matchings were introduced in 1962 by David Gale and Lloyd Shapley to study the college admissions problem. The seminal work of Gale and Shapley has motivated hundreds of research papers and found applications in many areas of mathematics, computer science, economics, and even medicine. This …
-
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 …
-
Stable Matchings and Indifference: Structural and Polyhedral Properties
Ένα κλασσικό πρόβλημα στην επιστήμη της Πληροφορικής που ορίστηκε από τον Gale το 1962 είναι το πρόβλημα του ευσταθούς ταιριάσματος. Από τότε πολλές γενικεύσεις του προβλήματος αυτού έχουν μελετηθεί απο διάφορες οπτικές. Μία από αυτές είναι οτι επιτρέπονται συνθήκες αδιαφορίας. Σε αυτή την …
-
2-sided and multi-sided stable matchings: structures, algorithms, and applications
This thesis examines the Stable Matching problem (SM) and some of its most important variants, namely the Stable Admissions (SAX the many-to-many Stable Matching (MM), and the Chain Stable Network problem. In the context of the SM, a time-optimal algorithm is provided that identifies which of the …
-
A Constraint Programming Approach to Finding Stable Matchings within Airline Manpower Planning
… for APA. We show how APA can be modelled as a stable matching problem, and more specifically how it can be formulated as an instance of the hospitals/residents problem with ties and forbidden pairs. A constraint satisfaction problem model for APA is presented, which we have implemented in a …
-
Pairing Things Off: Counting Stable Matchings, Finding Your Ride, and Designing Tournaments
… we study the classical combinatorial problem of stable matchings. Stable matchings were introduced in 1962 in a seminal paper by Gale and Shapley. In this chapter, we provide a new upper bound on f(n), the maximum number of stable matchings that an instance with n men and n women can have. The …
-
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 …
-
Structure and complexity of the student-project allocation problem
… have preferences, the goal is to find a stable matching, which means an allocation of students to projects such that no student and lecturer would prefer an alternative assignment involving a different project. This thesis explores the complexity and structure of stable matchings in two …
-
The Student-Project Allocation Problem: structure and algorithms
… or over the projects that they offer. We seek stable matchings of students to projects, which guarantee that no student and lecturer have an incentive to deviate from the matching by forming a private arrangement involving some project. We present new structural and algorithmic results for four …
-
Theory and algorithms for matching problems under preferences
… two characterizations for the set of super-stable matchings. Super-stability is one of the optimality criteria when the preference lists contain ties. The first algorithm computes irreducible super-stable matchings in the super-stable matching lattice. The second algorithm takes O(mn) time, …
-
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 …
-
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 …
-
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 …
-
A Two-sided Matching System Design for Dynamic Labor Markets
… algorithm are not sufficient for producing stable matching solutions. Therefore, the central theme of this thesis is to address the effectiveness and efficiency of generating matching results in dynamic large labor markets. The main contribution of this thesis consists of three dynamic …
-
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 …
-
Coupling, matching, and equivariance
… continuum percolation model, Palm theory and stable matchings of point processes. In "Translation-Equivariant Matchings of Coin-Flips on Zd," as a factor of i.i.d. fair coin-flips on Zd, we construct perfect matchings of heads and tails and prove power law upper bounds on the expected distance …
-
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, …
-
Essays On Public Economics And Microeconomic Theory
… as the solution is interior. As for Chapter 2, stable matchings in the presence of complementarities need not exist. With a canonical form of payoff functions, the conventional sufficient condition for existence substantially restricts the range of pairwise complementarity/substitutability …
-
A generalization of the stable marriage algorithms involving group preferences in resource allocation problems
… This thesis solves the problem of finding matchings between several resources and activities which are optimal 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 …
-
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 …
Page 1 of 2