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 18 of 18 for “"Stable matching"”.

  1. 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 Repository record for Algorithmic aspects of stable matching problems (opens in a new tab)

  2. 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 Repository record for A specialised constraint approach for stable matching problems (opens in a new tab)

  3. School choice : a discrete optimization approach

    … problem, school districts often utilize to stable-matching techniques which only produce stable matchings that do not incorporate these different objectives; this can be expensive and inequitable. We present a new optimization model for the Stable Matching (SM) school choice problem which …

    mit Repository record for School choice : a discrete optimization approach (opens in a new tab)

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

    … concept of robustness within the context of 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 …

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

  5. Essays on Matching With Endogenous Effort

    This thesis extends the two-sided matching literature by including an endogenous effort choice after the matching stage. We examine how different matching rules affect incentives to exert effort and the costs paid to induce various effort levels in three settings: a legal system, an education …

    penn Repository record for Essays on Matching With Endogenous Effort (opens in a new tab)

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

    … we consider a generalization 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 …

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

  7. Essays in Market Design

    … and proposes new mechanisms for two-sided matching markets, with a particular focus on the role played by diversity preferences and affirmative action. In the first chapter, "Diversity Preferences, Affirmative Action and Choice Rules'', I introduce a framework to analyze diversity …

    mit Repository record for Essays in Market Design (opens in a new tab)

  8. Bilateral exchanges in social networks and the design of public institutions

    … this thesis, I focus on exclusive exchanges or matching in bipartite networks where the matched couples perform an economic exchange with each other. This thesis makes three contributions to matching theory. First, I relax the standard assumptions of costless transfers between matched couples …

    mit Repository record for Bilateral exchanges in social networks and the design of public institutions (opens in a new tab)

  9. Essays on institutions in developing economies

    … and provides an explanation for why the stable mechanism used in its place works well in practice, despite appearing to be easily manipulable. In the first chapter, I develop a theory of endogenous matching between heterogeneously risk-averse individuals who, once matched, choose both the …

    mit Repository record for Essays on institutions in developing economies (opens in a new tab)

  10. Prediction and optimization in school choice

    … developing a new theoretical connection between stable matching and assortment planning, as well as methodologies on solving a new type of assortment planning problem, in which the objective is social welfare rather than revenue. Finally, I show how to further optimize the correlations between …

    mit Repository record for Prediction and optimization in school choice (opens in a new tab)

  11. Novel Pixel-Level and Subpixel-Level Registration Algorithms for Multi-Modal Imagery Data

    … frequency of the images prior to correlation matching. Finally, this dissertation provides a novel approach to solve the problem of multi-modal image registration. The principal idea behind this approach is to employ Computer Aided Design (CAD) models of man-made objects in the scene to permit …

    arizona-thes Repository record for Novel Pixel-Level and Subpixel-Level Registration Algorithms for Multi-Modal Imagery Data (opens in a new tab)

  12. Relay assisted device-to-device communication with channel uncertainty

    … are channel uncertainty aware. Firstly, a stable matching based relay user equipment selection algorithm is put forward for underlay device-to-device communication. A channel uncertainty aware approach is proposed to cater to imperfect channel state information at the devices. The algorithm …

    cape-town Repository record for Relay assisted device-to-device communication with channel uncertainty (opens in a new tab)

  13. Optimization and measurement in humanitarian operations: addressing practical needs

    … relevant to humanitarian applications: (i) stable and complete assignment of staff members to field offices, (ii) bottleneck management for transportation networks, and (iii) performance measurement of the food assistance supply chain. The assignment and reassignment of personnel to jobs is …

    gatech Repository record for Optimization and measurement in humanitarian operations: addressing practical needs (opens in a new tab)

  14. Investigation of matching problems using constraint programming and optimisation methods

    This thesis focuses on matching under ordinal preferences, i.e. problems where agents may be required to list other agents that they find acceptable in order of preference. In particular, we focus on two main cases: the popular matching and the kidney exchange problem. These problems are important …

    cork Repository record for Investigation of matching problems using constraint programming and optimisation methods (opens in a new tab)

  15. Essays in information elicitation and market design

    … third studies a model of decentralized two-sided matching markets. In ""Mechanisms for making accurate decisions in biased crowds,"" I study decision rules for finding the true answer to a binary question using the opinions of biased agents. Taking majority rule as a baseline, I study …

    uiuc Repository record for Essays in information elicitation and market design (opens in a new tab)

  16. Essays in Behavioral Macroeconomics and Mechanism Design

    … "going viral") that generate multiple stable steady states (hysteresis), and (iii) the coexistence of hump-shaped responses to small shocks with regime-shifting behavior in response to large shocks. Our empirical estimates discipline both the static, general equilibrium effect of …

    mit Repository record for Essays in Behavioral Macroeconomics and Mechanism Design (opens in a new tab)

  17. Networks, Clubs and Matching

    … endowment and a network, players undergo a matching process where one can only be matched with one of his neighbours or stay alone, and one always prefers a more capable matching partner to a less capable one to staying alone. A strict ability ranking would yield a unique stable matching for …

    cambridge Repository record for Networks, Clubs and Matching (opens in a new tab)

  18. Sharing economy-based on-demand peer-to-peer tutoring and resource sharing

    "The sharing economy is a socio-economic ecosystem built around the sharing of human and physical resources. This is considered to be a new and alternate socio-economic system which is currently in its early stages and has tremendous potential. The sharing economy combines the need to direct demand …

    uiuc Repository record for Sharing economy-based on-demand peer-to-peer tutoring and resource sharing (opens in a new tab)