Being Corrupt Requires Being Clever, But Detecting Corruption Doesn’t
Name
LIPIcs-ITCS-2019-45.pdf
Description
Published version
Size
468.7 KB
Format
Adobe PDF
Checksum (MD5)
282e8c8d1bfd37d1acae409726eecdb7
Author(s)
Jin, Yan
Mossel, Elchanan
Ramnarayan, Govind
Date Issued
2019
Citation
Jin, Yan, Mossel, Elchanan and Ramnarayan, Govind. 2019. "Being Corrupt Requires Being Clever, But Detecting Corruption Doesn’t."
Version
Final published version
Abstract
© Yan Jin, Elchanan Mossel, and Govind Ramnarayan. We consider a variation of the problem of corruption detection on networks posed by Alon, Mossel, and Pemantle’15. In this model, each vertex of a graph can be either truthful or corrupt. Each vertex reports about the types (truthful or corrupt) of all its neighbors to a central agency, where truthful nodes report the true types they see and corrupt nodes report adversarially. The central agency aggregates these reports and attempts to find a single truthful node. Inspired by real auditing networks, we pose our problem for arbitrary graphs and consider corruption through a computational lens. We identify a key combinatorial parameter of the graph m(G), which is the minimal number of corrupted agents needed to prevent the central agency from identifying a single corrupt node. We give an efficient (in fact, linear time) algorithm for the central agency to identify a truthful node that is successful whenever the number of corrupt nodes is less than m(G)/2. On the other hand, we prove that for any constant α > 1, it is NP-hard to find a subset of nodes S in G such that corrupting S prevents the central agency from finding one truthful node and |S| ≤ αm(G), assuming the Small Set Expansion Hypothesis (Raghavendra and Steurer, STOC’10). We conclude that being corrupt requires being clever, while detecting corruption does not. Our main technical insight is a relation between the minimum number of corrupt nodes required to hide all truthful nodes and a certain notion of vertex separability for the underlying graph. Additionally, this insight lets us design an efficient algorithm for a corrupt party to decide which graphs require the fewest corrupted nodes, up to a multiplicative factor of O(log n).
MIT Department
Massachusetts Institute of Technology. Institute for Data, Systems, and Society
Statistics and Data Science Center (Massachusetts Institute of Technology)
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Terms of Use
Creative Commons Attribution 4.0 International license
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.4230/LIPIcs.ITCS.2019.45
