Ankur A. Kulkarni

Orcid: 0000-0001-8139-5216

According to our database1, Ankur A. Kulkarni authored at least 73 papers between 2009 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Revisiting Common Randomness, No-signaling and Information Structure in Decentralized Control.
CoRR, 2024

Optimal Stochastic Decision Rule for Strategic Classification.
Proceedings of the National Conference on Communications, 2024

2023
Achievable Rates for Information Extraction from a Strategic Sender.
CoRR, 2023

The Quantum Advantage in Binary Teams and the Coordination Dilemma: Part II.
CoRR, 2023

The Quantum Advantage in Binary Teams and the Coordination Dilemma: Part I.
CoRR, 2023

Signalling for Electricity Demand Response: When is Truth Telling Optimal?
CoRR, 2023

Zero-Error Communication with an Influencer.
Proceedings of the 28th National Conference on Communications, 2023

Fraud Detection and Deterrence in Electronic Voting Machines: A Game-Theoretic Approach.
Proceedings of the 62nd IEEE Conference on Decision and Control, 2023

Classifier Design for Decentralised Sensing with Digital Communication.
Proceedings of the 62nd IEEE Conference on Decision and Control, 2023

Beyond Common Randomness: Quantum Resources in Decentralized Control.
Proceedings of the 62nd IEEE Conference on Decision and Control, 2023

2022
Information revelation through signalling.
Syst. Control. Lett., 2022

The Quantum Advantage in Decentralized Control.
CoRR, 2022

A Scalable Bayesian Persuasion Framework for Epidemic Containment on Heterogeneous Networks.
CoRR, 2022

2021
Minimax Theorems for Finite Blocklength Lossy Joint Source-Channel Coding over an Arbitrarily Varying Channel.
Probl. Inf. Transm., 2021

Efficiency fairness tradeoff in battery sharing.
Oper. Res. Lett., 2021

Optimal Questionnaires for Screening of Strategic Agents.
Proceedings of the IEEE International Conference on Acoustics, 2021

2020
Strategy-Proof Spectrum Allocation Among Multiple Operators in Wireless Networks.
IEEE Trans. Veh. Technol., 2020

Shannon Meets von Neumann: A Minimax Theorem for Channel Coding in the Presence of a Jammer.
IEEE Trans. Inf. Theory, 2020

Near Optimality of Linear Strategies for Static Teams With "Big" Non-Gaussian Noise.
IEEE Trans. Autom. Control., 2020

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

Duopolistic platform competition for revenue and throughput.
CoRR, 2020

Strategy-Proof Spectrum Allocation among Multiple Operators for Demand Varying Wireless Networks.
CoRR, 2020

Price-coupling games and the generation expansion planning problem.
Ann. Oper. Res., 2020

Zero Error Strategic Communication.
Proceedings of the International Conference on Signal Processing and Communications, 2020

Communicating with a Strategic Sender.
Proceedings of the 2020 National Conference on Communications, 2020

Achievable Rates for Strategic Communication.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Information Extraction from a Strategic Sender over a Noisy Channel.
Proceedings of the 59th IEEE Conference on Decision and Control, 2020

2019
Improved Finite Blocklength Converses for Slepian-Wolf Coding via Linear Programming.
IEEE Trans. Inf. Theory, 2019

New results on the existence of open loop Nash equilibria in discrete time dynamic games via generalized Nash games.
Math. Methods Oper. Res., 2019

Statistical Economies of Scale in Battery Sharing.
CoRR, 2019

The Efficiency of Generalized Nash and Variational Equilibria.
CoRR, 2019

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

Aggregate Play and Welfare in Strategic Interactions on Networks.
CoRR, 2019

Sizing Storage for Reliable Renewable Integration: A Large Deviations Approach.
CoRR, 2019

Strategy-Proof Spectrum Allocation among Multiple Operators.
Proceedings of the 2019 IEEE Wireless Communications and Networking Conference, 2019

A Minimax Theorem for Finite Blocklength Joint Source-Channel Coding over an AVC.
Proceedings of the National Conference on Communications, 2019

2018
Local and Networked Mean-square Estimation with High Dimensional Log-concave Noise.
IEEE Trans. Inf. Theory, 2018

An Approach Based on Generalized Nash Games and Shared Constraints for Discrete Time Dynamic Games.
Dyn. Games Appl., 2018

A linear complementarity based characterization of the weighted independence number and the independent domination number in graphs.
Discret. Appl. Math., 2018

On Independent Cliques and Linear Complementarity Problems.
CoRR, 2018

Platform Competition for Throughput in Two-sided Freelance Markets.
Proceedings of the 2018 International Conference on Signal Processing and Communications (SPCOM), 2018

New Finite Blocklength Converses for Asymmetric Multiple Access Channels via Linear Programming.
Proceedings of the 2018 International Conference on Signal Processing and Communications (SPCOM), 2018

Linear Programming Based Finite Blocklength Converses in Information Theory.
Proceedings of the 2018 Information Theory and Applications Workshop, 2018

Pricing and Commission in Two-Sided Markets with Free Upgrades.
Proceedings of the Communication Systems and Networks - 10th International Conference, 2018

Pricing in two-sided markets in the presence of free upgrades.
Proceedings of the 10th International Conference on Communication Systems & Networks, 2018

On a Game Between a Delay-Constrained Communication System and a Finite State Jammer.
Proceedings of the 57th IEEE Conference on Decision and Control, 2018

2017
Linear Programming-Based Converses for Finite Blocklength Lossy Joint Source-Channel Coding.
IEEE Trans. Inf. Theory, 2017

Non-constructive lower bounds for binary asymmetric error correcting codes.
Proceedings of the Twenty-third National Conference on Communications, 2017

A linear programming based channel coding strong converse for the BSC and BEC.
Proceedings of the Twenty-third National Conference on Communications, 2017

Linear programming based finite blocklength converses for some network-like problems.
Proceedings of the 2017 IEEE Information Theory Workshop, 2017

2016
Restricted Composition Deletion Correcting Codes.
IEEE Trans. Inf. Theory, 2016

Refinement of the Equilibrium of Public Goods Games over Networks: Efficiency and Effort of Specialized Equilibria.
CoRR, 2016

Mean-square estimation with high dimensional log-concave noise.
Proceedings of the 55th IEEE Conference on Decision and Control, 2016

2015
An Existence Result for Hierarchical Stackelberg v/s Stackelberg Games.
IEEE Trans. Autom. Control., 2015

An Optimizer's Approach to Stochastic Control Problems With Nonclassical Information Structures.
IEEE Trans. Autom. Control., 2015

New Results on the Existence of Open Loop Nash Equilibria in Discrete Time Dynamic Games.
CoRR, 2015

Approximately optimal linear strategies for static teams with 'big' non-Gaussian noise.
Proceedings of the 54th IEEE Conference on Decision and Control, 2015

A linear programming relaxation for stochastic control problems with non-classical information patterns.
Proceedings of the 54th IEEE Conference on Decision and Control, 2015

2014
On the Varshamov-Tenengolts construction on binary strings.
Discret. Math., 2014

Insertion and deletion errors with a forbidden symbol.
Proceedings of the 2014 IEEE Information Theory Workshop, 2014

Dimensionality reduction of affine variational inequalities using random projections.
Proceedings of the 52nd Annual Allerton Conference on Communication, 2014

2013
Nonasymptotic Upper Bounds for Deletion Correcting Codes.
IEEE Trans. Inf. Theory, 2013

On the consistency of leaders' conjectures in hierarchical games.
Proceedings of the 52nd IEEE Conference on Decision and Control, 2013

2012
Revisiting Generalized Nash Games and Variational Inequalities.
J. Optim. Theory Appl., 2012

Two Approaches to the Construction of Deletion Correcting Codes: Weight Partitioning and Optimal Colorings
CoRR, 2012

Non-asymptotic Upper Bounds for Deletion Correcting Codes
CoRR, 2012

Global Equilibria of Multi-leader Multi-follower Games with Shared Constraints
CoRR, 2012

Recourse-based stochastic nonlinear programming: properties and Benders-SQP algorithms.
Comput. Optim. Appl., 2012

On the variational equilibrium as a refinement of the generalized Nash equilibrium.
Autom., 2012

A coloring approach to constructing deletion correcting codes from constant weight subgraphs.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2009
Finite dimensional approximation and Newton-based algorithm for stochastic approximation in Hilbert space.
Autom., 2009

New insights on generalized Nash games with shared constraints: Constrained and variational equilibria.
Proceedings of the 48th IEEE Conference on Decision and Control, 2009

Approximate dynamic programming using fluid and diffusion approximations with applications to power management.
Proceedings of the 48th IEEE Conference on Decision and Control, 2009


  Loading...