Search Results for author:
Found 22 papers, 0 papers with code
Parameterized Aspects of Distinct Kemeny Rank Aggregation
We also present FPT approximation algorithms for Kemeny rank aggregation with respect to these parameters.
Knapsack: Connectedness, Path, and Shortest-Path
That is, we assume that there exists a graph structure on the set of items of knapsack and the solution also needs to satisfy certain graph theoretic properties on top of knapsack constraints.
Sampling-Based Winner Prediction in District-Based Elections
We complement this result by proving that any algorithm, from a natural class of algorithms, for predicting the winner in a district-based election when $r$ is plurality, must sample at least $\Omega\left(\frac{1}{\varepsilon^4}\log\frac{1}{\delta}\right)$ votes.
Feature-based Individual Fairness in k-Clustering
Ensuring fairness in machine learning algorithms is a challenging and essential task.
On Parameterized Complexity of Binary Networked Public Goods Game
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.
Computer Science and Game Theory Computational Complexity Data Structures and Algorithms 68Q27
Manipulating Node Similarity Measures in Networks
These similarity measures turn out to be an important fundamental tool for many real world applications such as link prediction in networks, recommender systems etc.
Social and Information Networks Data Structures and Algorithms
Distance Restricted Manipulation in Voting
We show that {\em Distance Restricted Strong Manipulation} admits polynomial-time algorithms for every scoring rule, maximin, Bucklin, and simplified Bucklin voting rules for a single manipulator, and for the $k$-approval rule for any number of manipulators, but becomes intractable for the Copeland$^\alpha$ voting rule for every $\alpha\in[0, 1]$ even for a single manipulator.
A Parameterized Perspective on Protecting Elections
We study the parameterized complexity of the optimal defense and optimal attack problems in voting.
Testing Preferential Domains Using Sampling
We further explore the effect of assuming that the {\em outlier} preferences/alternatives to be random (instead of arbitrary) on the sample complexity of the testing problem.
Local Distance Constrained Bribery in Voting
We consider three important measures of distances, namely, swap distance, footrule distance, and maximum displacement distance, and resolve the complexity of the optimal bribery problem for many common voting rules.
Resolving the Complexity of Some Fundamental Problems in Computational Social Choice
This thesis is in the area called computational social choice which is an intersection area of algorithms and social choice theory.
Proportional Representation in Vote Streams
We consider elections where the voters come one at a time, in a streaming fashion, and devise space-efficient algorithms which identify an approximate winning committee with respect to common multiwinner proportional representation voting rules; specifically, we consider the Approval-based and the Borda-based variants of both the Chamberlin-- ourant rule and the Monroe rule.
Query Complexity of Tournament Solutions
We, in this paper, precisely study this problem for commonly used tournament solutions: given an oracle access to the edges of a tournament T, find $f(T)$ by querying as few edges as possible, for a tournament solution f. We first show that the set of Condorcet non-losers in a tournament can be found by querying $2n-\lfloor \log n \rfloor -2$ edges only and this is tight in the sense that every algorithm for finding the set of Condorcet non-losers needs to query at least $2n-\lfloor \log n \rfloor -2$ edges in the worst case, where $n$ is the number of vertices in the input tournament.
Recognizing and Eliciting Weakly Single Crossing Profiles on Trees
We also prove a lower bound of $\Omega(m^2\log n)$ on the number of queries that any algorithm needs to ask to elicit single crossing profile when random queries are allowed.
Preference Elicitation For Single Crossing Domain
The main contribution of our work is to provide polynomial time algorithms with low query complexity for preference elicitation in all the above six cases.
Elicitation for Preferences Single Peaked on Trees
We then investigate the query complexity for finding a weak Condorcet winner for preferences single peaked on a tree and show that this task has much less query complexity than preference elicitation.
Complexity of Manipulation with Partial Information in Voting
Opportunistic Manipulation (OM): the manipulators seek to vote in a way that makes their preferred candidate win in every viable extension of the partial votes of the non-manipulators.
On Choosing Committees Based on Approval Votes in the Presence of Outliers
For net approval and minisum approval voting rules, we provide a dichotomous result, resolving the parameterized complexity of this problem for all subsets of five natural parameters considered (by showing either FPT or W[1]-hardness for all subsets of parameters).
Fishing out Winners from Vote Streams
We investigate the problem of winner determination from computational social choice theory in the data stream model.
Estimating the Margin of Victory of an Election using Sampling
The margin of victory of an election is a useful measure to capture the robustness of an election outcome.
Manipulation is Harder with Incomplete Votes
The CM problem, however, has been studied only in the complete information setting, that is, when the manipulators know the votes of the non-manipulators.
Frugal Bribery in Voting
However, the Frugal-{dollar}bribery problem is intractable for all the voting rules studied here barring the plurality and the veto voting rules for unweighted elections.
