Manipulation Strategies for the Rank Maximal Matching Problem

  title={Manipulation Strategies for the Rank Maximal Matching Problem},
  author={Pratik Ghosal and Katarzyna E. Paluch},
We consider manipulation strategies for the rank-maximal matching problem. Let \(G=(A \cup P, \mathcal {E})\) be a bipartite graph such that A denotes a set of applicants and P a set of posts. Each applicant \(a \in A\) has a preference list over the set of his neighbours in G, possibly involving ties. A matching M is any subset of edges from \(\mathcal {E}\) such that no two edges of M share an endpoint. A rank-maximal matching is one in which the maximum number of applicants is matched to… CONTINUE READING
Twitter Mentions

Figures and Topics from this paper.


Publications referenced by this paper.