3 papers
cs.DM2026
Eternal Vertex Cover Problem on Halin Graphs
Jasine Babu, Pratik Ghosal, Cipriyano Simoes
Eternal vertex cover problem is a graph protection problem which is a dynamic two player game variant of the classical vertex cover problem. In this game, the minimum number of gua…
cs.GT2024
EFX Exists for Three Types of Agents
Vishwa Prakash HV, Pratik Ghosal, Prajakta Nimbhorkar +1
We study the problem of finding an envy-free allocation of indivisible goods among agents with additive valuations. We focus on the fairness notion of envy-freeness up to any good…
cs.DS2015
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…