20 citations · 81 across the 30 of their papers we have counts for
40 papers
Parameterized Aspects of Distinct Kemeny Rank Aggregation
Koustav De, Harshil Mittal, Palash Dey +1
The Kemeny method is one of the popular tools for rank aggregation. However, computing an optimal Kemeny ranking is NP-hard. Consequently, the computational task of finding a Kemen…
Knapsack: Connectedness, Path, and Shortest-Path
Palash Dey, Sudeshna Kolay, Sipra Singh
We study the knapsack problem with graph theoretic constraints. That is, we assume that there exists a graph structure on the set of items of knapsack and the solution also needs t…
Optimal Referral Auction Design
Rangeet Bhattacharyya, Parvik Dave, Palash Dey +1
The auction of a single indivisible item is one of the most celebrated problems in mechanism design with transfers. Despite its simplicity, it provides arguably the cleanest and mo…
On Binary Networked Public Goods Game with Altruism
Arnab Maiti, Palash Dey
In the classical Binary Networked Public Goods (BNPG) game, a player can either invest in a public project or decide not to invest. Based on the decisions of all the players, each…
Sampling-Based Winner Prediction in District-Based Elections
Palash Dey, Debajyoti Kar, Swagato Sanyal
In a district-based election, we apply a voting rule to decide the winners in each district, and a candidate who wins in a maximum number of districts is the winner of the elec…
How Hard is Safe Bribery?
Neel Karia, Faraaz Mallick, Palash Dey
Bribery in an election is one of the well-studied control problems in computational social choice. In this paper, we propose and study the safe bribery problem. Here the goal of th…