1 citations · 1 across the 2 of their papers we have counts for
Showing cs.ITShow all
2 papers · 1 filter
cs.IT2023
Achievable Rates for Information Extraction from a Strategic Sender
Anuj S. Vora, Ankur A. Kulkarni
We consider a setting of non-cooperative communication where a receiver wants to recover randomly generated sequences of symbols that are observed by a strategic sender. The sender…
cs.IT2019★ 1 cited
Minimax Theorems for Finite Blocklength Lossy Joint Source-Channel Coding over an AVC
Anuj S. Vora, Ankur A. Kulkarni
Motivated by applications in the security of cyber-physical systems, we pose the finite blocklength communication problem in the presence of a jammer as a zero-sum game between the…