Back to results

Chapman University

Match Stability with a Costly and Flexible Number of Positions

Abstract

dc:description.abstract

<p>One of the objectives of two-sided matching mechanisms is to pair two groups of agents such that there is no incentive for pair deviation. The outcome of a match can significantly impact participants. While much of the existing research in this field addresses the matching with fixed quotas, this is not always applicable. We introduce the concept of slot stability, recognizing the potential motivation for organizations to modify their quotas after the match. We propose an algorithm designed to create stable and slot stable matches by employing flexible, endogenous quotas to address this issue.</p>

Degree

thesis:*
Name thesis:degree_name
Master of Science (MS)
Level thesis:degree_level
Thesis
Discipline thesis:degree_discipline
Behavioral and Computational Economics
Year
2024

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Gilmore, James
Contributors dc:contributor
  • Dr. David Porter

Subjects

dc:subject × 2

Identifiers

dc:identifier.*
OAI identifier oai:identifier
oai:digitalcommons.chapman.edu:behavioral_and_computational_economics_theses-1002

Chain of custody

source
Harvested from
Chapman University
Base URL
digitalcommons.chapman.edu/do/oai/
Last updated
2026-07-24
Source record
OAI-PMH GetRecord
citation

Gilmore, James. Match Stability with a Costly and Flexible Number of Positions. Thesis thesis, 2024. https://digitalcommons.chapman.edu/behavioral_and_computational_economics_theses/3