4A2 APPLICATIONS OF POPULAR MATCHINGS ON CAMPUS(Technical Session 4A: Combinatorial Optimization 2) :
-
- Ikeda,Yutaro
- Graduate School of Systems and Information Engineering, University of Tsukuba
-
- Igarashi,Ayumi
- Graduate School of Systems and Information Engineering, University of Tsukuba
-
- Shigeno,Maiko
- Graduate School of Systems and Information Engineering, University of Tsukuba
Search this article
Abstract
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.
Journal
-
- Proceedings of International Symposium on Scheduling
-
Proceedings of International Symposium on Scheduling 2013 86-90, 2013-07-18
日本機械学会
- Tweet
Details 詳細情報について
-
- CRID
- 1543950420020064128
-
- NII Article ID
- 110009955588
-
- NII Book ID
- AA11901544
-
- Text Lang
- en
-
- Data Source
-
- NDL-Digital
- CiNii Articles