8 citations · 32 across the 12 of their papers we have counts for
Showing 2017 · cs.DSShow all
2 papers · 2 filters
cs.DS2017
Manipulation Strategies for the Rank Maximal Matching Problem
Pratik Ghosal, Katarzyna Paluch
We consider manipulation strategies for the rank-maximal matching problem. In the rank-maximal matching problem we are given a bipartite graph such that den…
cs.DS2017★ 2 cited
The Dynamics of Rank-Maximal and Popular Matchings
Pratik Ghosal, Adam Kunysz, Katarzyna Paluch
Given a bipartite graph, where the two sets of vertices are applicants and posts and ranks on the edges represent preferences of applicants over posts, a {\em rank-maximal} matchin…