research
∙
09/07/2023
Parameterized Aspects of Distinct Kemeny Rank Aggregation
The Kemeny method is one of the popular tools for rank aggregation. Howe...
share
research
∙
07/24/2023
Knapsack: Connectedness, Path, and Shortest-Path
We study the knapsack problem with graph theoretic constraints. That is,...
research
∙
08/19/2022
Myerson on a Network
The auction of a single indivisible item is one of the most celebrated p...
research
∙
05/01/2022
On Binary Networked Public Goods Game with Altruism
In the classical Binary Networked Public Goods (BNPG) game, a player can...
research
∙
02/28/2022
Sampling-Based Winner Prediction in District-Based Elections
In a district-based election, we apply a voting rule r to decide the win...
research
∙
01/25/2022
How Hard is Safe Bribery?
Bribery in an election is one of the well-studied control problems in co...
research
∙
12/19/2021
Parameterized Algorithms for Kidney Exchange
In kidney exchange programs, multiple patient-donor pairs each of whom a...
research
∙
12/03/2020
On Parameterized Complexity of Binary Networked Public Goods Game
In the Binary Networked Public Goods game, every player needs to decide ...
research
∙
11/28/2020
On Parameterized Complexity of Liquid Democracy
In liquid democracy, each voter either votes herself or delegates her vo...
research
∙
04/29/2020
On the complexity of Winner Verification and Candidate Winner for Multiwinner Voting Rules
The Chamberlin-Courant and Monroe rules are fundamental and well-studied...
research
∙
10/25/2019
Manipulating Node Similarity Measures in Network
Node similarity measures quantify how similar a pair of nodes are in a n...
research
∙
09/12/2019
Minimizing Margin of Victory for Fair Political and Educational Districting
In many practical scenarios, a population is divided into disjoint group...
research
∙
09/07/2019
Stable Manipulation in Voting
We introduce the problem of stable manipulation where the manipulators ...
research
∙
09/04/2019
Gerrymandering: A Briber's Perspective
We initiate the study of bribery problem in the context of gerrymanderin...
research
∙
05/28/2019
A Parameterized Perspective on Protecting Elections
We study the parameterized complexity of the optimal defense and optimal...
research
∙
03/14/2019
Covert Networks: How Hard is It to Hide?
Covert networks are social networks that often consist of harmful users....
research
∙
02/24/2019
Testing Preferential Domains Using Sampling
A preferential domain is a collection of sets of preferences which are l...
research
∙
01/25/2019
Local Distance Restricted Bribery in Voting
Studying complexity of various bribery problems has been one of the main...
research
∙
01/25/2019
Optimal Bribery in Voting
Studying complexity of various bribery problems has been one of the main...
research
∙
01/30/2018
Surprise in Elections
Elections involving a very large voter population often lead to outcomes...
research
∙
11/10/2017
Manipulative Elicitation -- A New Attack on Elections with Incomplete Preferences
Lu and Boutilier proposed a novel approach based on "minimax regret" to ...
research
∙
03/23/2017
Resolving the Complexity of Some Fundamental Problems in Computational Social Choice
This thesis is in the area called computational social choice which is a...
research
∙
02/28/2017
Proportional Representation in Vote Streams
We consider elections where the voters come one at a time, in a streamin...
research
∙
11/18/2016
Query Complexity of Tournament Solutions
A directed graph where there is exactly one edge between every pair of v...
research
∙
11/13/2016
Recognizing and Eliciting Weakly Single Crossing Profiles on Trees
The domain of single crossing preference profiles is a widely studied do...
research
∙
11/13/2015
On Choosing Committees Based on Approval Votes in the Presence of Outliers
We study the computational complexity of committee selection problem for...
research
∙
08/19/2015
Fishing out Winners from Vote Streams
We investigate the problem of winner determination from computational so...
research
∙
05/04/2015
Estimating the Margin of Victory of an Election using Sampling
The margin of victory of an election is a useful measure to capture the ...
research
∙
04/30/2015
Manipulation is Harder with Incomplete Votes
The Coalitional Manipulation (CM) problem has been studied extensively i...
research
∙
04/30/2015
