Paper Info
Title
On A Game Between A Delay-Constrained Communication System And A Finite State Jammer
Abstract
This paper considers a zero-sum game between a team of delay-constrained encoder and decoder, and a finite state jammer, with average probability of error as the payoff. The team attempts to communicate a discrete source using a finite blocklength over a finite family of discrete channels whose state is controlled by the jammer. For each strategy of the jammer, the team's problem has nonclassical information structure and hence is nonconvex, whereby a saddle point solution may not exist for the game. Our main contributions consist of a novel lower bound on the min-max and max-min value of the game via a linear programming (LP) relaxation and a new upper bound on the min-max value. These bounds imply that for rates of transmission R satisfying R < <(C)under bar> and R > (C) over bar, where (C) under bar, (C) over bar are precomputable thresholds depending on the channel kernels, the min-max and max-min values of the game approach each other as the blocklength n -> infinity. In the intermediate range, we give a fundamental lower bound on the limiting max-min value, which for a two-state jammer is shown to be 1/2.
Year
DOI
Venue
2018
10.1109/CDC.2018.8618987
2018 IEEE CONFERENCE ON DECISION AND CONTROL (CDC)
Field
DocType
ISSN
Discrete mathematics,Mathematical optimization,Saddle point,Computer science,Upper and lower bounds,Communication channel,Communications system,Finite state,Linear programming,Encoder,Stochastic game
Conference
0743-1546
Citations 
PageRank 
References 
0
0.34
0
Authors
2
Name
Order
Citations
PageRank
Sharu Theresa Jose122.53
Ankur A. Kulkarni210620.95