paper-with-me

홈 › Papers

A study on bribery networks with a focus on harassment bribery and ways to control corruption

2022-01-08 · Chanchal Pramanik

The paper focuses on the bribery network emphasizing harassment bribery. A bribery network ends with the police officer whose utility from the bribe is positive and the approving officer in the network. The persistent nature of corruption is due to colluding behavior of the bribery networks. The probability of detection of bribery incidents will help in improving controlling corruption in society. The asymmetric form of punishment and award equivalent to the amount of punishment to the network can enhance the probability of detection of harassment bribery $(p_{h})$ and thus increasing the probability of detection of overall bribery $(p_{h} \in p)$.

📄 PDF Abstract BibTeX arXiv:2201.02804

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Frugal Bribery in Voting

2015-04-30 · Palash Dey, Neeldhara Misra, Y. Narahari

Bribery in elections is an important problem in computational social choice theory. However, bribery with money is often illegal in elections. Motivated by this, we introduce the notion of frugal bribery and formulate tw…

Complexity of Shift Bribery in Committee Elections

2016-01-07 · Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon

Given an election, a preferred candidate p, and a budget, the SHIFT BRIBERY problem asks whether p can win the election after shifting p higher in some voters' preference orders. Of course, shifting comes at a price (dep…

Bribery as a Measure of Candidate Success: Complexity Results for Approval-Based Multiwinner Rules

2021-04-19 · Piotr Faliszewski, Piotr Skowron, Nimrod Talmon

We study the problem of bribery in multiwinner elections, for the case where the voters cast approval ballots (i.e., sets of candidates they approve) and the bribery actions are limited to: adding an approval to a vote, …

Local Distance Constrained Bribery in Voting

2019-01-25 · Palash Dey

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 every voter some amount of money …

Algorithms for Destructive Shift Bribery

2018-10-03 · Andrzej Kaczmarczyk, Piotr Faliszewski

We study the complexity of Destructive Shift Bribery. In this problem, we are given an election with a set of candidates and a set of voters (each ranking the candidates from the best to the worst), a despised candidate …