Many-to-Many matching with capacity using lexicographic preference = 사전편찬식 선호도를 이용한 다수 대 다수 수용 매칭에 대한 연구

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 297
  • Download : 0
Many-to-many matching with capacity(MMC) is a matching problem of two sides of members can be matched to multiple members of opposite side. Given a bipartite graph G = (A $\cup$ P, E), each node in A, P has strict preference list of opposite side and its own capacity. Each applicant A can be matched to multiple posts in P within its capacity, and each post P can be matched to multiple applicants in A within its capacity. In this instance of matching problem, we define each member& amp; rsquo; s preference to a matching with lexicographical order. With this definition, we define lexicographic stability in this many-to-many matching with capacity instance. We give an algorithm and prove this algorithm is stable. We also show the condition whether unique stable matching exists given such instance using side optimality.
Advisors
Choi, Sungheeresearcher최성희researcher
Description
한국과학기술원 :전산학부,
Publisher
한국과학기술원
Issue Date
2018
Identifier
325007
Language
eng
Description

학위논문(석사) - 한국과학기술원 : 전산학부, 2018.2,[ii, 14 p. :]

Keywords

Algorithm▼aMatching▼aBipartite Graph▼aStability▼aLexicographic; 알고리즘▼a매칭▼a이분 그래프▼a안전성▼a사전편찬상의

URI
http://hdl.handle.net/10203/267104
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=734081&flag=dissertation
Appears in Collection
CS-Theses_Master(석사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0