Abraham, David J and Telikepalli, Kavitha (2006) Dynamic Matching Markets and Voting Paths. In: Algorithm Theory-SWAT 2006. 10th Scandinavian Workshop on Algorithm Theory. Proceedings, 6-8 July 2006, Riga, Latvia, pp. 65-76.
Dynamic_Matching.pdf - Published Version
Restricted to Registered users only
Download (459Kb) | Request a copy
We consider a matching market, in which the aim is to maintain a popular matching between a set of applicants and a set of posts, where each applicant has a preference list that ranks some subset of acceptable posts. The setting is dynamic: applicants and posts can enter and leave the market, and applicants can also change their preferences arbitrarily. After any change, the current matching may no longer be popular, in which case, we are required to update it. However, our model demands that we can switch from one matching to another only if there is consensus among the applicants to agree to the switch. Hence, we need to update via a voting path, which is a sequence of matchings, each more popular than its predecessor, that ends in a popular matching. In this paper, we show that, as long as some popular matching exists, there is a 2-step voting path from any given matching to some popular matching. Furthermore, given any popular matching, we show how to find a shortest-length such voting path in linear time.
|Item Type:||Conference Paper|
|Additional Information:||Copyright of this article belongs to Springer-Verlag.|
|Department/Centre:||Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)|
|Date Deposited:||22 Aug 2008|
|Last Modified:||18 Jan 2012 09:05|
Actions (login required)