Continuous Matching with Single Peaked Preferences

This paper derives several simple matching algorithms for special cases of a continuous two sided matching model where agents have single peaked preferences and face no costs or restrictions to matching. These algorithms allow matches to be computed as an explicit function of the parameters of the model, making them convenient for use in theoretical matching market models, such as dating markets. One such theoretical model is solved and analyzed. Finally, several possible extensions and topics for further study are explored, such as adding noise to observed types and allowing misreporting of type.