Preference-constrained Oriented Matching

@inproceedings{Fleischer2010PreferenceconstrainedOM,
  title={Preference-constrained Oriented Matching},
  author={Lisa Fleischer and Zoya Svitkina},
  booktitle={ANALCO},
  year={2010}
}
We introduce and study a combinatorial problem called preference-constrained oriented matching. This problem is defined on a directed graph in which each node has preferences over its out-neighbors, and the goal is to find a maximum-size matching on this graph that satisfies a certain preference constraint. One of our main results is a structural theorem showing that if the given graph is complete, then for any preference ordering there always exists a feasible matching that covers a constant… CONTINUE READING