Anuj Vora

According to our database, Anuj Vora authored at least 12 papers between 2019 and 2024.

Collaborative distances:

• Dijkstra number of six.
• Erdős number of five.

2024

Shannon meets Myerson: Information extraction from a strategic sender.

Anuj S. Vora, Ankur A. Kulkarni

Math. Soc. Sci., 2024

2023

Achievable Rates for Information Extraction from a Strategic Sender.

Anuj S. Vora, Ankur A. Kulkarni

CoRR, 2023

Fraud Detection and Deterrence in Electronic Voting Machines: A Game-Theoretic Approach.

Anuj S. Vora, Ankur A. Kulkarni

Proceedings of the 62nd IEEE Conference on Decision and Control, 2023

2021

Minimax Theorems for Finite Blocklength Lossy Joint Source-Channel Coding over an Arbitrarily Varying Channel.

Anuj S. Vora, Ankur A. Kulkarni

Probl. Inf. Transm., 2021

Optimal Questionnaires for Screening of Strategic Agents.

Anuj S. Vora, Ankur A. Kulkarni

Proceedings of the IEEE International Conference on Acoustics, 2021

2020

Information Extraction from a Strategic Sender: The Zero Error Case.

Anuj S. Vora, Ankur A. Kulkarni

CoRR, 2020

Zero Error Strategic Communication.

Anuj S. Vora, Ankur A. Kulkarni

Proceedings of the International Conference on Signal Processing and Communications, 2020

Communicating with a Strategic Sender.

Anuj S. Vora, Ankur A. Kulkarni

Proceedings of the 2020 National Conference on Communications, 2020

Achievable Rates for Strategic Communication.

Anuj S. Vora, Ankur A. Kulkarni

Proceedings of the IEEE International Symposium on Information Theory, 2020

Information Extraction from a Strategic Sender over a Noisy Channel.

Anuj S. Vora, Ankur A. Kulkarni

Proceedings of the 59th IEEE Conference on Decision and Control, 2020

2019

Minimax Theorems for Finite Blocklength Lossy Joint Source-Channel Coding over an AVC.

Anuj S. Vora, Ankur A. Kulkarni

CoRR, 2019

A Minimax Theorem for Finite Blocklength Joint Source-Channel Coding over an AVC.

Anuj Vora, Ankur A. Kulkarni

Proceedings of the National Conference on Communications, 2019