How hard is safe bribery?
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 …
choice. In this paper, we propose and study the safe bribery problem. Here the goal of the …
Protecting elections by recounting ballots
Complexity of voting manipulation is a prominent topic in computational social choice. In this
work, we consider a two-stage voting manipulation scenario. First, a malicious party (an …
work, we consider a two-stage voting manipulation scenario. First, a malicious party (an …
基于节点权重的DPoS 共识算法
田志宏， 赵金东， 李绍凯， 侯延琛， 韩双志， 赵相福 - 应用科学学报, 2022 - jas.shu.edu.cn
针对委托权益证明(delegated proof of stake, DPoS) 共识机制中节点作恶以及如何降低恶意
节点成为代表节点可能性的问题, 结合埃欧塔(IOTA) 共识机制在安全性和稳定性方面的优势建立 …
节点成为代表节点可能性的问题, 结合埃欧塔(IOTA) 共识机制在安全性和稳定性方面的优势建立 …
Algorithms for swap and shift bribery in structured elections
In computational social choice, shift bribery is the procedure of paying voters to shift the
briber's preferred candidate forward in their preferences so as to make this candidate an …
briber's preferred candidate forward in their preferences so as to make this candidate an …
Election with bribed voter uncertainty: Hardness and approximation algorithm
Bribery in election (or computational social choice in general) is an important problem that
has received a considerable amount of attention. In the classic bribery problem, the briber …
has received a considerable amount of attention. In the classic bribery problem, the briber …
The game among bribers in a smart contract system
Blockchain has been used to build various applications, and the introduction of smart
contracts further extends its impacts. Most of existing works consider the positive usage of …
contracts further extends its impacts. Most of existing works consider the positive usage of …
Election with bribe-effect uncertainty: A dichotomy result
We consider the electoral bribery problem in computational social choice. In this context,
extensive studies have been carried out to analyze the computational vulnerability of various …
extensive studies have been carried out to analyze the computational vulnerability of various …
Local Differential Privacy Meets Computational Social Choice--Resilience under Voter Deletion
The resilience of a voting system has been a central topic in computational social choice.
Many voting rules, like plurality, are shown to be vulnerable as the attacker can target …
Many voting rules, like plurality, are shown to be vulnerable as the attacker can target …
[PDF][PDF] Local distance restricted bribery in voting
P Dey - Proceedings of the 18th International Conference on …, 2019 - ifaamas.org
Studying complexity of various bribery problems has been one of the main research focus in
computational social choice. In all the models of bribery studied so far, the briber has to pay …
computational social choice. In all the models of bribery studied so far, the briber has to pay …
Local distance constrained bribery in voting
P Dey - Theoretical Computer Science, 2021 - Elsevier
Studying complexity of various bribery problems has been one of the main research focus in
computational social choice. In all the models of bribery studied so far, the briber has to pay …
computational social choice. In all the models of bribery studied so far, the briber has to pay …