default search action
Ankur A. Kulkarni
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j23]Anuj S. Vora
, Ankur A. Kulkarni
Shannon meets Myerson: Information extraction from a strategic sender. Math. Soc. Sci. 131: 48-66 (2024) - [c31]Manish Kumar Singh, Ankur A. Kulkarni:
Optimal Stochastic Decision Rule for Strategic Classification. NCC 2024: 1-6 - [i35]Apurva Dhingra, Ankur A. Kulkarni:
Revisiting Common Randomness, No-signaling and Information Structure in Decentralized Control. CoRR abs/2402.16862 (2024) - [i34]Reema Deori, Ankur A. Kulkarni:
Informativeness and Trust in Bayesian Persuasion. CoRR abs/2408.13822 (2024) - 2023
- [c30]Anuj S. Vora
Fraud Detection and Deterrence in Electronic Voting Machines: A Game-Theoretic Approach. CDC 2023: 3832-3837 - [c29]Shashank A. Deshpande, Ankur A. Kulkarni:
Beyond Common Randomness: Quantum Resources in Decentralized Control. CDC 2023: 5906-5911 - [c28]Gauri Garg, Harshad Khadilkar, Ankur A. Kulkarni, Aditya A. Paranjape:
Classifier Design for Decentralised Sensing with Digital Communication. CDC 2023: 8432-8437 - [c27]Reema Deori, Ankur A. Kulkarni:
Zero-Error Communication with an Influencer. NCC 2023: 1-6 - [i33]René Aïd, Anupama Kowli, Ankur A. Kulkarni:
Signalling for Electricity Demand Response: When is Truth Telling Optimal? CoRR abs/2302.12770 (2023) - [i32]Shashank A. Deshpande, Ankur A. Kulkarni:
The Quantum Advantage in Binary Teams and the Coordination Dilemma: Part I. CoRR abs/2307.01762 (2023) - [i31]Shashank A. Deshpande, Ankur A. Kulkarni:
The Quantum Advantage in Binary Teams and the Coordination Dilemma: Part II. CoRR abs/2307.01766 (2023) - [i30]Anuj S. Vora, Ankur A. Kulkarni:
Achievable Rates for Information Extraction from a Strategic Sender. CoRR abs/2307.02644 (2023) - 2022
- [j22]Reema Deori, Ankur A. Kulkarni
Information revelation through signalling. Syst. Control. Lett. 169: 105378 (2022) - [i29]Reema Deori, Ankur A. Kulkarni:
Information Revelation Through Signalling. CoRR abs/2202.10145 (2022) - [i28]Shraddha Pathak, Ankur A. Kulkarni:
A Scalable Bayesian Persuasion Framework for Epidemic Containment on Heterogeneous Networks. CoRR abs/2207.11578 (2022) - [i27]Shashank A. Deshpande, Ankur A. Kulkarni:
The Quantum Advantage in Decentralized Control. CoRR abs/2207.12075 (2022) - 2021
- [j21]Karan N. Chadha, Ankur A. Kulkarni
Efficiency fairness tradeoff in battery sharing. Oper. Res. Lett. 49(3): 377-384 (2021) - [j20]Anuj S. Vora
Minimax Theorems for Finite Blocklength Lossy Joint Source-Channel Coding over an Arbitrarily Varying Channel. Probl. Inf. Transm. 57(2): 99-128 (2021) - [c26]Anuj S. Vora
Optimal Questionnaires for Screening of Strategic Agents. ICASSP 2021: 8173-8177 - 2020
- [j19]Mathew P. Abraham, Ankur A. Kulkarni
Price-coupling games and the generation expansion planning problem. Ann. Oper. Res. 295(1): 1-19 (2020) - [j18]Ankur A. Kulkarni
Near Optimality of Linear Strategies for Static Teams With "Big" Non-Gaussian Noise. IEEE Trans. Autom. Control. 65(2): 534-545 (2020) - [j17]Sharu Theresa Jose
Shannon Meets von Neumann: A Minimax Theorem for Channel Coding in the Presence of a Jammer. IEEE Trans. Inf. Theory 66(5): 2842-2859 (2020) - [j16]Indu Yadav
Strategy-Proof Spectrum Allocation Among Multiple Operators in Wireless Networks. IEEE Trans. Veh. Technol. 69(12): 15964-15977 (2020) - [c25]Anuj S. Vora, Ankur A. Kulkarni:
Information Extraction from a Strategic Sender over a Noisy Channel. CDC 2020: 354-359 - [c24]Anuj S. Vora
Achievable Rates for Strategic Communication. ISIT 2020: 1379-1384 - [c23]Anuj S. Vora
Communicating with a Strategic Sender. NCC 2020: 1-6 - [c22]Anuj S. Vora, Ankur A. Kulkarni:
Zero Error Strategic Communication. SPCOM 2020: 1-5 - [i26]Indu Yadav, Ankur A. Kulkarni, Abhay Karandikar:
Strategy-Proof Spectrum Allocation among Multiple Operators for Demand Varying Wireless Networks. CoRR abs/2001.07003 (2020) - [i25]Mansi Sood, Ankur A. Kulkarni, Sharayu Moharir:
Duopolistic platform competition for revenue and throughput. CoRR abs/2001.11529 (2020) - [i24]Anuj S. Vora, Ankur A. Kulkarni:
Information Extraction from a Strategic Sender: The Zero Error Case. CoRR abs/2006.10641 (2020) - [i23]Anuj S. Vora, Ankur A. Kulkarni:
Optimal Questionnaires for Screening of Strategic Agents. CoRR abs/2010.15008 (2020)
2010 – 2019
- 2019
- [j15]Mathew P. Abraham, Ankur A. Kulkarni
New results on the existence of open loop Nash equilibria in discrete time dynamic games via generalized Nash games. Math. Methods Oper. Res. 89(2): 157-172 (2019) - [j14]Sharu Theresa Jose
Improved Finite Blocklength Converses for Slepian-Wolf Coding via Linear Programming. IEEE Trans. Inf. Theory 65(4): 2423-2441 (2019) - [c21]Anuj Vora
A Minimax Theorem for Finite Blocklength Joint Source-Channel Coding over an AVC. NCC 2019: 1-6 - [c20]Indu Yadav, Ankur A. Kulkarni, Abhay Karandikar:
Strategy-Proof Spectrum Allocation among Multiple Operators. WCNC 2019: 1-6 - [i22]Mathew P. Abraham, Ankur A. Kulkarni:
Price-Coupling Games and the Generation Expansion Planning Problem. CoRR abs/1901.01927 (2019) - [i21]Vivek Deulkar, Jayakrishnan Nair, Ankur A. Kulkarni:
Sizing Storage for Reliable Renewable Integration: A Large Deviations Approach. CoRR abs/1904.04771 (2019) - [i20]Karan N. Chadha, Ankur A. Kulkarni:
Aggregate Play and Welfare in Strategic Interactions on Networks. CoRR abs/1906.07630 (2019) - [i19]Anuj S. Vora, Ankur A. Kulkarni:
Minimax Theorems for Finite Blocklength Lossy Joint Source-Channel Coding over an AVC. CoRR abs/1907.05324 (2019) - [i18]Karan N. Chadha, Ankur A. Kulkarni, Jayakrishnan Nair:
Efficiency Fairness Tradeoff in Battery Sharing. CoRR abs/1908.00699 (2019) - [i17]Ankur A. Kulkarni:
The Efficiency of Generalized Nash and Variational Equilibria. CoRR abs/1908.00702 (2019) - [i16]Vivek Deulkar, Jayakrishnan Nair, Ankur A. Kulkarni:
Statistical Economies of Scale in Battery Sharing. CoRR abs/1912.00462 (2019) - 2018
- [j13]Parthe Pandit
A linear complementarity based characterization of the weighted independence number and the independent domination number in graphs. Discret. Appl. Math. 244: 155-169 (2018) - [j12]Mathew P. Abraham, Ankur A. Kulkarni
An Approach Based on Generalized Nash Games and Shared Constraints for Discrete Time Dynamic Games. Dyn. Games Appl. 8(4): 641-670 (2018) - [j11]Ankur A. Kulkarni
Local and Networked Mean-square Estimation with High Dimensional Log-concave Noise. IEEE Trans. Inf. Theory 64(4): 2759-2773 (2018) - [c19]Sharu Theresa Jose, Ankur A. Kulkarni:
On a Game Between a Delay-Constrained Communication System and a Finite State Jammer. CDC 2018: 5063-5068 - [c18]Mansi Sood, Sharayu Moharir, Ankur A. Kulkarni:
Pricing and Commission in Two-Sided Markets with Free Upgrades. COMSNETS (Extended Selected Papers) 2018: 172-195 - [c17]Mansi Sood
Pricing in two-sided markets in the presence of free upgrades. COMSNETS 2018: 259-266 - [c16]Ankur A. Kulkarni, Sharu Theresa Jose:
Linear Programming Based Finite Blocklength Converses in Information Theory. ITA 2018: 1-10 - [c15]Mansi Sood
Platform Competition for Throughput in Two-sided Freelance Markets. SPCOM 2018: 227-231 - [c14]Sharu Theresa Jose, Ankur A. Kulkarni:
New Finite Blocklength Converses for Asymmetric Multiple Access Channels via Linear Programming. SPCOM 2018: 447-451 - [i15]Sharu Theresa Jose, Ankur A. Kulkarni:
Improved Finite Blocklength Converses for Slepian-Wolf Coding via Linear Programming. CoRR abs/1801.08693 (2018) - [i14]Sharu Theresa Jose, Ankur A. Kulkarni:
Shannon meets von Neumann: A Minimax Theorem for Channel Coding in the Presence of a Jammer. CoRR abs/1811.07358 (2018) - [i13]Karan N. Chadha, Ankur A. Kulkarni:
On Independent Cliques and Linear Complementarity Problems. CoRR abs/1811.09798 (2018) - [i12]Indu Yadav, Ankur A. Kulkarni, Abhay Karandikar:
Strategy-Proof Spectrum Allocation among Multiple Operators. CoRR abs/1812.00192 (2018) - 2017
- [j10]Sharu Theresa Jose, Ankur A. Kulkarni
Linear Programming-Based Converses for Finite Blocklength Lossy Joint Source-Channel Coding. IEEE Trans. Inf. Theory 63(11): 7066-7094 (2017) - [c13]Sharu Theresa Jose, Ankur A. Kulkarni:
Linear programming based finite blocklength converses for some network-like problems. ITW 2017: 544-548 - [c12]Sharu Theresa Jose, Ankur A. Kulkarni:
A linear programming based channel coding strong converse for the BSC and BEC. NCC 2017: 1-6 - [c11]Parthe Pandit, Ankur A. Kulkarni:
Non-constructive lower bounds for binary asymmetric error correcting codes. NCC 2017: 1-6 - 2016
- [j9]Daniel Cullina
Restricted Composition Deletion Correcting Codes. IEEE Trans. Inf. Theory 62(9): 4819-4832 (2016) - [c10]Ankur A. Kulkarni:
Mean-square estimation with high dimensional log-concave noise. CDC 2016: 2029-2034 - [i11]Ankur A. Kulkarni:
Near-Optimality of Linear Strategies for Static Teams with 'Big' Non-Gaussian Noise. CoRR abs/1603.03160 (2016) - [i10]Parthe Pandit, Ankur A. Kulkarni:
A linear complementarity based characterization of the weighted independence number and the independent domination number in graphs. CoRR abs/1603.05075 (2016) - [i9]Parthe Pandit, Ankur A. Kulkarni:
Refinement of the Equilibrium of Public Goods Games over Networks: Efficiency and Effort of Specialized Equilibria. CoRR abs/1607.02037 (2016) - [i8]Sharu Theresa Jose, Ankur A. Kulkarni:
Linear Programming based Converses for Finite Blocklength Lossy Joint Source-Channel Coding. CoRR abs/1608.03165 (2016) - 2015
- [j8]Ankur A. Kulkarni, Todd P. Coleman
An Optimizer's Approach to Stochastic Control Problems With Nonclassical Information Structures. IEEE Trans. Autom. Control. 60(4): 937-949 (2015) - [j7]Ankur A. Kulkarni, Uday V. Shanbhag:
An Existence Result for Hierarchical Stackelberg v/s Stackelberg Games. IEEE Trans. Autom. Control. 60(12): 3379-3384 (2015) - [c9]Sharu Theresa Jose, Ankur A. Kulkarni:
A linear programming relaxation for stochastic control problems with non-classical information patterns. CDC 2015: 5743-5748 - [c8]Ankur A. Kulkarni:
Approximately optimal linear strategies for static teams with 'big' non-Gaussian noise. CDC 2015: 7177-7182 - [i7]Mathew P. Abraham, Ankur A. Kulkarni:
New Results on the Existence of Open Loop Nash Equilibria in Discrete Time Dynamic Games. CoRR abs/1509.03597 (2015) - 2014
- [j6]Ankur A. Kulkarni, Negar Kiyavash, Ramavarapu S. Sreenivas
On the Varshamov-Tenengolts construction on binary strings. Discret. Math. 317: 79-90 (2014) - [c7]Bharat Prabhakar, Ankur A. Kulkarni:
Dimensionality reduction of affine variational inequalities using random projections. Allerton 2014: 256-263 - [c6]Ankur A. Kulkarni:
Insertion and deletion errors with a forbidden symbol. ITW 2014: 596-600 - [i6]Bharat Prabhakar, Ankur A. Kulkarni:
Dimensionality Reduction of Affine Variational Inequalities Using Random Projections. CoRR abs/1408.4551 (2014) - 2013
- [j5]Ankur A. Kulkarni, Negar Kiyavash:
Nonasymptotic Upper Bounds for Deletion Correcting Codes. IEEE Trans. Inf. Theory 59(8): 5115-5130 (2013) - [c5]Ankur A. Kulkarni, Uday V. Shanbhag:
On the consistency of leaders' conjectures in hierarchical games. CDC 2013: 1180-1185 - [i5]Wei Chen, Dayu Huang, Ankur A. Kulkarni, Jayakrishnan Unnikrishnan, Quanyan Zhu, Prashant G. Mehta, Sean P. Meyn, Adam Wierman:
Approximate dynamic programming using fluid and diffusion approximations with applications to power management. CoRR abs/1307.1759 (2013) - [i4]Ankur A. Kulkarni, Todd P. Coleman:
An Optimizer's Approach to Stochastic Control Problems with Nonclassical Information Structures. CoRR abs/1309.3745 (2013) - 2012
- [j4]Ankur A. Kulkarni, Uday V. Shanbhag:
On the variational equilibrium as a refinement of the generalized Nash equilibrium. Autom. 48(1): 45-55 (2012) - [j3]Ankur A. Kulkarni, Uday V. Shanbhag:
Recourse-based stochastic nonlinear programming: properties and Benders-SQP algorithms. Comput. Optim. Appl. 51(1): 77-123 (2012) - [j2]Ankur A. Kulkarni, Uday V. Shanbhag:
Revisiting Generalized Nash Games and Variational Inequalities. J. Optim. Theory Appl. 154(1): 175-186 (2012) - [c4]Ankur A. Kulkarni, Todd P. Coleman:
An optimizer's approach to stochastic control problems with nonclassical information structures. CDC 2012: 154-159 - [c3]Daniel Cullina
A coloring approach to constructing deletion correcting codes from constant weight subgraphs. ISIT 2012: 513-517 - [i3]Ankur A. Kulkarni, Uday V. Shanbhag:
Global Equilibria of Multi-leader Multi-follower Games with Shared Constraints. CoRR abs/1206.2968 (2012) - [i2]Ankur A. Kulkarni, Negar Kiyavash:
Non-asymptotic Upper Bounds for Deletion Correcting Codes. CoRR abs/1211.3128 (2012) - [i1]Daniel Cullina, Ankur A. Kulkarni, Negar Kiyavash:
Two Approaches to the Construction of Deletion Correcting Codes: Weight Partitioning and Optimal Colorings. CoRR abs/1211.4056 (2012)
2000 – 2009
- 2009
- [j1]Ankur A. Kulkarni, Vivek S. Borkar:
Finite dimensional approximation and Newton-based algorithm for stochastic approximation in Hilbert space. Autom. 45(12): 2815-2822 (2009) - [c2]Ankur A. Kulkarni, Uday V. Shanbhag:
New insights on generalized Nash games with shared constraints: Constrained and variational equilibria. CDC 2009: 151-156 - [c1]Wei Chen, Dayu Huang, Ankur A. Kulkarni, Jayakrishnan Unnikrishnan
Approximate dynamic programming using fluid and diffusion approximations with applications to power management. CDC 2009: 3575-3580
Coauthor Index
Anuj Vora
aka: Anuj S. Vora
aka: Anuj S. Vora
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: