20 citations · 81 across the 30 of their papers we have counts for
4 papers · 1 filter
Network Robustness via Global k-cores
Palash Dey, Suman Kalyan Maity, Sourav Medya +1
Network robustness is a measure a network's ability to survive adversarial attacks. But not all parts of a network are equal. K-cores, which are dense subgraphs, are known to captu…
On Parameterized Complexity of Binary Networked Public Goods Game
Arnab Maiti, Palash Dey
In the Binary Networked Public Goods game, every player needs to decide if she participates in a public project whose utility is shared equally by the community. We study the probl…
On Parameterized Complexity of Liquid Democracy
Palash Dey, Arnab Maiti, Amatya Sharma
In liquid democracy, each voter either votes herself or delegates her vote to some other voter. This gives rise to what is called a delegation graph. To decide the voters who event…
On the complexity of Winner Verification and Candidate Winner for Multiwinner Voting Rules
Chinmay Sonar, Palash Dey, Neeldhara Misra
The Chamberlin-Courant and Monroe rules are fundamental and well-studied rules in the literature of multi-winner elections. The problem of determining if there exists a committee o…