Manipulation Strategies for the Rank Maximal Matching Problem

@inproceedings{Ghosal2017ManipulationSF,
title={Manipulation Strategies for the Rank Maximal Matching Problem},
author={Pratik Ghosal and Katarzyna E. Paluch},
booktitle={COCOON},
year={2017}
}
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
3

References

Publications referenced by this paper.
SHOWING 1-10 OF 32 REFERENCES

VIEW 6 EXCERPTS

• ArXiv
• 2017
VIEW 4 EXCERPTS

• ISAAC
• 2014
VIEW 3 EXCERPTS

Greedy matchings

R. W. Irving
• Technical Report, University of Glasgow, Tr2003-136
• 2003
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

• COCOON
• 2017
VIEW 2 EXCERPTS

• Algorithmica
• 2015
VIEW 1 EXCERPT

Popular Matchings: Structure and Strategic Issues

• SIAM J. Discrete Math.
• 2014
VIEW 1 EXCERPT

VIEW 1 EXCERPT

VIEW 1 EXCERPT

College Admissions and the Stability of Marriage

• The American Mathematical Monthly
• 2013
VIEW 1 EXCERPT