Weighted Popular Matchings

Details Weighted Popular Matchings Weighted Popular Matchings

2007-07-04

arxiv.org/abs/0707.0546v1

Computer Science

Data Structures and Algorithms

14 pages, 3 figures. A preliminary version appeared in the Proceedings of the 33rd International Colloquium on Automata, Langu

Scientific paper

We study the problem of assigning jobs to applicants. Each applicant has a weight and provides a preference list ranking a subset of the jobs. A matching M is popular if there is no other matching M' such that the weight of the applicants who prefer M' over M exceeds the weight of those who prefer M over M'. This paper gives efficient algorithms to find a popular matching if one exists.

Affiliated with

Also associated with

No associations

Rating

Weighted Popular Matchings does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Weighted Popular Matchings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Weighted Popular Matchings will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-547137