
On Parameterized Complexity of Binary Networked Public Goods Game
In the Binary Networked Public Goods game, every player needs to decide ...
read it

On Parameterized Complexity of Liquid Democracy
In liquid democracy, each voter either votes herself or delegates her vo...
read it

On the complexity of Winner Verification and Candidate Winner for Multiwinner Voting Rules
The ChamberlinCourant and Monroe rules are fundamental and wellstudied...
read it

Manipulating Node Similarity Measures in Network
Node similarity measures quantify how similar a pair of nodes are in a n...
read it

Minimizing Margin of Victory for Fair Political and Educational Districting
In many practical scenarios, a population is divided into disjoint group...
read it

Stable Manipulation in Voting
We introduce the problem of stable manipulation where the manipulators ...
read it

Gerrymandering: A Briber's Perspective
We initiate the study of bribery problem in the context of gerrymanderin...
read it

A Parameterized Perspective on Protecting Elections
We study the parameterized complexity of the optimal defense and optimal...
read it

Covert Networks: How Hard is It to Hide?
Covert networks are social networks that often consist of harmful users....
read it

Testing Preferential Domains Using Sampling
A preferential domain is a collection of sets of preferences which are l...
read it

Local Distance Restricted Bribery in Voting
Studying complexity of various bribery problems has been one of the main...
read it

Optimal Bribery in Voting
Studying complexity of various bribery problems has been one of the main...
read it

Surprise in Elections
Elections involving a very large voter population often lead to outcomes...
read it

Manipulative Elicitation  A New Attack on Elections with Incomplete Preferences
Lu and Boutilier proposed a novel approach based on "minimax regret" to ...
read it

Resolving the Complexity of Some Fundamental Problems in Computational Social Choice
This thesis is in the area called computational social choice which is a...
read it

Proportional Representation in Vote Streams
We consider elections where the voters come one at a time, in a streamin...
read it

Query Complexity of Tournament Solutions
A directed graph where there is exactly one edge between every pair of v...
read it

Recognizing and Eliciting Weakly Single Crossing Profiles on Trees
The domain of single crossing preference profiles is a widely studied do...
read it

On Choosing Committees Based on Approval Votes in the Presence of Outliers
We study the computational complexity of committee selection problem for...
read it

Fishing out Winners from Vote Streams
We investigate the problem of winner determination from computational so...
read it

Estimating the Margin of Victory of an Election using Sampling
The margin of victory of an election is a useful measure to capture the ...
read it

Manipulation is Harder with Incomplete Votes
The Coalitional Manipulation (CM) problem has been studied extensively i...
read it

Frugal Bribery in Voting
Bribery in elections is an important problem in computational social cho...
read it