4A2 APPLICATIONS OF POPULAR MATCHINGS ON CAMPUS(Technical Session 4A: Combinatorial Optimization 2) :
Search this article
Min-cost matchings have been widely used to solve resource assignment models. To consider the popularity of assignments, Abraham et al. proposed "Popular matching." This paper investigates the availabiliy of popular matchings in some real-world problems raised in campus. In real-world settings, a matching needs to be obtained even if popular matchings do not exist. Hence, we show an algorithm which finds a nearly popular matching. By comparing the results obtained by this algorithm and by a min-cost matching algorithm, we discuss some conditions such that a popular matching provides a better result than a min-cost matching.
- Proceedings of International Symposium on Scheduling
Proceedings of International Symposium on Scheduling 2013 86-90, 2013-07-18