Weighted Popular Matchings
| dc.creator | Mestre, Julián | |
| dc.date | 2007-07-04 | |
| dc.date.accessioned | 2026-07-07T08:13:54Z | |
| dc.date.available | 2026-07-07T08:13:54Z | |
| dc.description | 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. | |
| dc.description | 14 pages, 3 figures. A preliminary version appeared in the Proceedings of the 33rd International Colloquium on Automata, Languages and Programming (ICALP) | |
| dc.identifier | https://arxiv.org/abs/0707.0546 | |
| dc.identifier | http://arxiv.org/abs/0707.0546 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/132937 | |
| dc.subject | Data Structures and Algorithms | |
| dc.subject | G.2.1 | |
| dc.title | Weighted Popular Matchings | |
| dc.type | text |