Zobrazeno 1 - 10
of 154
pro vyhledávání: '"Dey, Palash"'
News outlets, surveyors, and other organizations often conduct polls on social networks to gain insights into public opinion. Such a poll is typically started by someone on a social network who sends it to her friends. If a person participates in the
Externí odkaz:
http://arxiv.org/abs/2410.12256
Given an undirected graph $\mathcal{G}=(\mathcal{V},\mathcal{E})$, with vertex weights $(w(u))_{u\in\mathcal{V}}$, vertex values $(\alpha(u))_{u\in\mathcal{V}}$, a knapsack size $s$, and a target value $d$, the \vcknapsack problem is to determine if
Externí odkaz:
http://arxiv.org/abs/2406.01057
Autor:
Mitra, Adway, Dey, Palash
In district-based multi-party elections, electors cast votes in their respective districts. In each district, the party with maximum votes wins the corresponding seat in the governing body. Election Surveys try to predict the election outcome (vote s
Externí odkaz:
http://arxiv.org/abs/2312.15179
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 Kemeny ranking has been studied under the lens of parameterized complexity
Externí odkaz:
http://arxiv.org/abs/2309.03517
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 to satisfy certain graph theoretic properties on top of knapsack constr
Externí odkaz:
http://arxiv.org/abs/2307.12547
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 most insightful results in the literature. When the information that the
Externí odkaz:
http://arxiv.org/abs/2208.09326
Autor:
Maiti, Arnab, Dey, Palash
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 player receives a reward as per his/her utility function. However, cla
Externí odkaz:
http://arxiv.org/abs/2205.00442
In a district-based election, we apply a voting rule $r$ to decide the winners in each district, and a candidate who wins in a maximum number of districts is the winner of the election. We present efficient sampling-based algorithms to predict the wi
Externí odkaz:
http://arxiv.org/abs/2203.00083
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 the briber is to ask the bribed voters to vote in such a way that the br
Externí odkaz:
http://arxiv.org/abs/2201.10383
Autor:
Maiti, Arnab, Dey, Palash
In kidney exchange programs, multiple patient-donor pairs each of whom are otherwise incompatible, exchange their donors to receive compatible kidneys. The Kidney Exchange problem is typically modelled as a directed graph where every vertex is either
Externí odkaz:
http://arxiv.org/abs/2112.10250