Centralized vs decentralized multi-agent guesswork
Name
1705.09372.pdf
Description
Submitted version
Size
251.21 KB
Format
Unknown
Checksum (MD5)
2abb21fe252eeddd6141ebe9de400fe6
Author(s)
Salamatian, Salman
Beirami, Ahmad
Cohen, Asaf
Medard, Muriel
Date Issued
June 2017
Publisher
IEEE
Citation
Salamatian, Salman, Beirami, Ahmad, Cohen, Asaf and Medard, Muriel. 2017. "Centralized vs decentralized multi-agent guesswork."
Version
Original manuscript
Abstract
© 2017 IEEE. We study a notion of guesswork, where multiple agents intend to launch a coordinated brute-force attack to find a single binary secret string, and each agent has access to side information generated through either a BEC or a BSC. The average number of trials required to find the secret string grows exponentially with the length of the string, and the rate of the growth is called the guesswork exponent. We compute the guesswork exponent for several multi-agent attacks. We show that a multi-agent attack reduces the guesswork exponent compared to a single agent, even when the agents do not exchange information to coordinate their attack, and try to individually guess the secret string using a predetermined scheme in a decentralized fashion. Further, we show that the guesswork exponent of two agents who do coordinate their attack is strictly smaller than that of any finite number of agents individually performing decentralized guesswork.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/isit.2017.8006931
