A game-theoretic information theory with dynamic hedging and nonconvex downward-closed cones subsumes probabilistic channel coding theorems and adversarial settings.
Shannon meets von Neumann: A minimax theorem for channel coding in the presence of a jammer,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A Non-Probabilistic Game-Theoretic Information Theory Which Subsumes Probabilistic Channel Coding
A game-theoretic information theory with dynamic hedging and nonconvex downward-closed cones subsumes probabilistic channel coding theorems and adversarial settings.