Approximate dynamic programming using fluid and diffusion approximations with applications to power management. - Wei Chen 020; Dayu Huang; Ankur A. Kulkarni; Jayakrishnan Unnikrishnan; Quanyan Zhu; Prashant G. Mehta; Sean P. Meyn; Adam Wierman (CDC, 2009)

New insights on generalized Nash games with shared constraints: Constrained and variational equilibria. - Ankur A. Kulkarni; Uday V. Shanbhag (CDC, 2009)

Finite dimensional approximation and Newton-based algorithm for stochastic approximation in Hilbert space. - Ankur A. Kulkarni; Vivek S. Borkar (Autom., 2009)

A coloring approach to constructing deletion correcting codes from constant weight subgraphs. - Daniel Cullina; Ankur A. Kulkarni; Negar Kiyavash (ISIT, 2012)

On the variational equilibrium as a refinement of the generalized Nash equilibrium. - Ankur A. Kulkarni; Uday V. Shanbhag (Autom., 2012)

Recourse-based stochastic nonlinear programming: properties and Benders-SQP algorithms. - Ankur A. Kulkarni; Uday V. Shanbhag (Comput. Optim. Appl., 2012)

Global Equilibria of Multi-leader Multi-follower Games with Shared Constraints - Ankur A. Kulkarni; Uday V. Shanbhag (CoRR, 2012)

Non-asymptotic Upper Bounds for Deletion Correcting Codes - Ankur A. Kulkarni; Negar Kiyavash (CoRR, 2012)

Two Approaches to the Construction of Deletion Correcting Codes: Weight Partitioning and Optimal Colorings - Daniel Cullina; Ankur A. Kulkarni; Negar Kiyavash (CoRR, 2012)

Revisiting Generalized Nash Games and Variational Inequalities. - Ankur A. Kulkarni; Uday V. Shanbhag (J. Optim. Theory Appl., 2012)

On the consistency of leaders' conjectures in hierarchical games. - Ankur A. Kulkarni; Uday V. Shanbhag (CDC, 2013)

Nonasymptotic Upper Bounds for Deletion Correcting Codes. - Ankur A. Kulkarni; Negar Kiyavash (IEEE Trans. Inf. Theory, 2013)

Dimensionality reduction of affine variational inequalities using random projections. - Bharat Prabhakar; Ankur A. Kulkarni (Allerton, 2014)

Insertion and deletion errors with a forbidden symbol. - Ankur A. Kulkarni (ITW, 2014)

On the Varshamov-Tenengolts construction on binary strings. - Ankur A. Kulkarni; Negar Kiyavash; Ramavarapu S. Sreenivas (Discret. Math., 2014)

A linear programming relaxation for stochastic control problems with non-classical information patterns. - Sharu Theresa Jose; Ankur A. Kulkarni (CDC, 2015)

Approximately optimal linear strategies for static teams with 'big' non-Gaussian noise. - Ankur A. Kulkarni (CDC, 2015)

New Results on the Existence of Open Loop Nash Equilibria in Discrete Time Dynamic Games. - Mathew P. Abraham; Ankur A. Kulkarni (CoRR, 2015)

An Optimizer's Approach to Stochastic Control Problems With Nonclassical Information Structures. - Ankur A. Kulkarni; Todd P. Coleman (IEEE Trans. Autom. Control., 2015)

An Existence Result for Hierarchical Stackelberg v/s Stackelberg Games. - Ankur A. Kulkarni; Uday V. Shanbhag (IEEE Trans. Autom. Control., 2015)

Mean-square estimation with high dimensional log-concave noise. - Ankur A. Kulkarni (CDC, 2016)

Refinement of the Equilibrium of Public Goods Games over Networks: Efficiency and Effort of Specialized Equilibria. - Parthe Pandit; Ankur A. Kulkarni (CoRR, 2016)

Restricted Composition Deletion Correcting Codes. - Daniel Cullina; Negar Kiyavash; Ankur A. Kulkarni (IEEE Trans. Inf. Theory, 2016)

Linear programming based finite blocklength converses for some network-like problems. - Sharu Theresa Jose; Ankur A. Kulkarni (ITW, 2017)

A linear programming based channel coding strong converse for the BSC and BEC. - Sharu Theresa Jose; Ankur A. Kulkarni (NCC, 2017)

Non-constructive lower bounds for binary asymmetric error correcting codes. - Parthe Pandit; Ankur A. Kulkarni (NCC, 2017)

Linear Programming-Based Converses for Finite Blocklength Lossy Joint Source-Channel Coding. - Sharu Theresa Jose; Ankur A. Kulkarni (IEEE Trans. Inf. Theory, 2017)

On a Game Between a Delay-Constrained Communication System and a Finite State Jammer. - Sharu Theresa Jose; Ankur A. Kulkarni (CDC, 2018)

Pricing in two-sided markets in the presence of free upgrades. - Mansi Sood; Sharayu Moharir; Ankur A. Kulkarni (COMSNETS, 2018)

Pricing and Commission in Two-Sided Markets with Free Upgrades. - Mansi Sood; Sharayu Moharir; Ankur A. Kulkarni (COMSNETS (Extended Selected Papers), 2018)

Linear Programming Based Finite Blocklength Converses in Information Theory. - Ankur A. Kulkarni; Sharu Theresa Jose (ITA, 2018)

New Finite Blocklength Converses for Asymmetric Multiple Access Channels via Linear Programming. - Sharu Theresa Jose; Ankur A. Kulkarni (SPCOM, 2018)

Platform Competition for Throughput in Two-sided Freelance Markets. - Mansi Sood; Ankur A. Kulkarni; Sharayu Moharir (SPCOM, 2018)

On Independent Cliques and Linear Complementarity Problems. - Karan N. Chadha; Ankur A. Kulkarni (CoRR, 2018)

A linear complementarity based characterization of the weighted independence number and the independent domination number in graphs. - Parthe Pandit; Ankur A. Kulkarni (Discret. Appl. Math., 2018)

An Approach Based on Generalized Nash Games and Shared Constraints for Discrete Time Dynamic Games. - Mathew P. Abraham; Ankur A. Kulkarni (Dyn. Games Appl., 2018)

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

A Minimax Theorem for Finite Blocklength Joint Source-Channel Coding over an AVC. - Anuj Vora; Ankur A. Kulkarni (NCC, 2019)

Strategy-Proof Spectrum Allocation among Multiple Operators. - Indu Yadav; Ankur A. Kulkarni; Abhay Karandikar (WCNC, 2019)

Sizing Storage for Reliable Renewable Integration: A Large Deviations Approach. - Vivek Deulkar; Jayakrishnan Nair 001; Ankur A. Kulkarni (CoRR, 2019)

Aggregate Play and Welfare in Strategic Interactions on Networks. - Karan N. Chadha; Ankur A. Kulkarni (CoRR, 2019)

Minimax Theorems for Finite Blocklength Lossy Joint Source-Channel Coding over an AVC. - Anuj S. Vora; Ankur A. Kulkarni (CoRR, 2019)

The Efficiency of Generalized Nash and Variational Equilibria. - Ankur A. Kulkarni (CoRR, 2019)

Statistical Economies of Scale in Battery Sharing. - Vivek Deulkar; Jayakrishnan Nair 001; Ankur A. Kulkarni (CoRR, 2019)

New results on the existence of open loop Nash equilibria in discrete time dynamic games via generalized Nash games. - Mathew P. Abraham; Ankur A. Kulkarni (Math. Methods Oper. Res., 2019)

Improved Finite Blocklength Converses for Slepian-Wolf Coding via Linear Programming. - Sharu Theresa Jose; Ankur A. Kulkarni (IEEE Trans. Inf. Theory, 2019)

Information Extraction from a Strategic Sender over a Noisy Channel. - Anuj S. Vora; Ankur A. Kulkarni (CDC, 2020)

Achievable Rates for Strategic Communication. - Anuj S. Vora; Ankur A. Kulkarni (ISIT, 2020)

Communicating with a Strategic Sender. - Anuj S. Vora; Ankur A. Kulkarni (NCC, 2020)

Zero Error Strategic Communication. - Anuj S. Vora; Ankur A. Kulkarni (SPCOM, 2020)

Price-coupling games and the generation expansion planning problem. - Mathew P. Abraham; Ankur A. Kulkarni (Ann. Oper. Res., 2020)

Strategy-Proof Spectrum Allocation among Multiple Operators for Demand Varying Wireless Networks. - Indu Yadav; Ankur A. Kulkarni; Abhay Karandikar (CoRR, 2020)

Duopolistic platform competition for revenue and throughput. - Mansi Sood; Ankur A. Kulkarni; Sharayu Moharir (CoRR, 2020)

Information Extraction from a Strategic Sender: The Zero Error Case. - Anuj S. Vora; Ankur A. Kulkarni (CoRR, 2020)

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

Shannon Meets von Neumann: A Minimax Theorem for Channel Coding in the Presence of a Jammer. - Sharu Theresa Jose; Ankur A. Kulkarni (IEEE Trans. Inf. Theory, 2020)

Strategy-Proof Spectrum Allocation Among Multiple Operators in Wireless Networks. - Indu Yadav; Ankur A. Kulkarni; Abhay Karandikar (IEEE Trans. Veh. Technol., 2020)

Optimal Questionnaires for Screening of Strategic Agents. - Anuj S. Vora; Ankur A. Kulkarni (ICASSP, 2021)

Efficiency fairness tradeoff in battery sharing. - Karan N. Chadha; Ankur A. Kulkarni; Jayakrishnan Nair 001 (Oper. Res. Lett., 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)

A Scalable Bayesian Persuasion Framework for Epidemic Containment on Heterogeneous Networks. - Shraddha Pathak; Ankur A. Kulkarni (CoRR, 2022)

The Quantum Advantage in Decentralized Control. - Shashank A. Deshpande; Ankur A. Kulkarni (CoRR, 2022)

Information revelation through signalling. - Reema Deori; Ankur A. Kulkarni (Syst. Control. Lett., 2022)

Beyond Common Randomness: Quantum Resources in Decentralized Control. - Shashank A. Deshpande; Ankur A. Kulkarni (CDC, 2023)

Classifier Design for Decentralised Sensing with Digital Communication. - Gauri Garg; Harshad Khadilkar; Ankur A. Kulkarni; Aditya A. Paranjape (CDC, 2023)

Fraud Detection and Deterrence in Electronic Voting Machines: A Game-Theoretic Approach. - Anuj S. Vora; Ankur A. Kulkarni (CDC, 2023)

Zero-Error Communication with an Influencer. - Reema Deori; Ankur A. Kulkarni (NCC, 2023)

Signalling for Electricity Demand Response: When is Truth Telling Optimal? - René Aïd; Anupama Kowli; Ankur A. Kulkarni (CoRR, 2023)

The Quantum Advantage in Binary Teams and the Coordination Dilemma: Part I. - Shashank A. Deshpande; Ankur A. Kulkarni (CoRR, 2023)

The Quantum Advantage in Binary Teams and the Coordination Dilemma: Part II. - Shashank A. Deshpande; Ankur A. Kulkarni (CoRR, 2023)

Achievable Rates for Information Extraction from a Strategic Sender. - Anuj S. Vora; Ankur A. Kulkarni (CoRR, 2023)

Optimal Stochastic Decision Rule for Strategic Classification. - Manish Kumar Singh 006; Ankur A. Kulkarni (NCC, 2024)

Trust in Persuasion for Binary Adversarial Classification. - Reema Deori; Ankur A. Kulkarni (WiOpt, 2024)

Revisiting Common Randomness, No-signaling and Information Structure in Decentralized Control. - Apurva Dhingra; Ankur A. Kulkarni (CoRR, 2024)

Informativeness and Trust in Bayesian Persuasion. - Reema Deori; Ankur A. Kulkarni (CoRR, 2024)

Shannon meets Myerson: Information extraction from a strategic sender. - Anuj S. Vora; Ankur A. Kulkarni (Math. Soc. Sci., 2024)