1 citations · 2 across the 4 of their papers we have counts for
5 papers
Adaptive Incentive Design in Dynamic Principal-Agent Problem via Kernelized Bandits
Arghya Mallick, Anuj S. Vora, Sergio Grammatico +1
We consider the dynamic principal-agent problem under asymmetric information, wherein a principal sequentially designs contracts to incentivize an agent with unknown preferences an…
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…
Optimal Questionnaires for Screening of Strategic Agents
Anuj S. Vora, Ankur A. Kulkarni
During the COVID- pandemic the health authorities at airports and train stations try to screen and identify the travellers possibly exposed to the virus. However, many individu…
Shannon meets Myerson: Information Extraction from a Strategic Sender
Anuj S. Vora, Ankur A. Kulkarni
We study a setting where a receiver must design a questionnaire to recover a sequence of symbols known to strategic sender, whose utility may not be incentive compatible. We allow…
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…