2019/07/11 by Anuj S. Vora, Vora, Anuj S., Ankur A. Kulkarni +1 · 1 citation
Computer Science · Engineering · #91A99 #94A15 #Computer Science and Game Theory (cs.GT) #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT) #Optimization and Control (math.OC) #Security in Wireless Sensor Networks #Smart Grid Security and Resilience #Wireless Communication Security Techniques
paper · pdf · doi:10.48550/arxiv.1907.05324
openalex publication_date 2019/07/11 · openalex created_date 2022/07/28 · openalex updated_date 2026/07/28
Motivated by applications in the security of cyber-physical systems, we pose\nthe finite blocklength communication problem in the presence of a jammer as a\nzero-sum game between the encoder-decoder team and the jammer, by allowing the\ncommunicating team as well as the jammer only locally randomized strategies.\nThe communicating team's problem is non-convex under locally randomized codes,\nand hence, in general, a minimax theorem need not hold for this game. However,\nwe show that approximate minimax theorems hold in the sense that the minimax\nand maximin values of the game approach each other asymptotically. In\nparticular, for rates strictly below a critical threshold, both the minimax and\nmaximin values approach zero, and for rates strictly above it, they both\napproach unity. We then show a second order minimax theorem, i.e., for rates\nexactly approaching the threshold with along a specific scaling, the minimax\nand maximin values approach the same constant value, that is neither zero nor\none. Critical to these results is our derivation of finite blocklength bounds\non the minimax and maximin values of the game and our derivation of second\norder dispersion-based bounds.\n