8 citations · 32 across the 12 of their papers we have counts for
4 papers · 1 filter
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…
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…
Characterisation of Strongly Stable Matchings
Pratik Ghosal, Adam Kunysz, Katarzyna Paluch
An instance of a strongly stable matching problem (SSMP) is an undirected bipartite graph , with an adjacency list of each vertex being a linearly ordered list of…
Rank Maximal Matchings -- Structure and Algorithms
Pratik Ghoshal, Meghana Nasre, Prajakta Nimbhorkar
Let G = (A U P, E) be a bipartite graph where A denotes a set of agents, P denotes a set of posts and ranks on the edges denote preferences of the agents over posts. A matching M i…