Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
Benjamin Striner
Megat Aman Zahiri Megat Zakaria
Claudia Calabrese
Maria Concetta Palumbo
Wei Zhang
Jhonathan Pinzon
Giovanni Venturelli
Chen Ma
Radu Timofte
Kuanrui Yin
Home
/
Author
/
ANKUR A. KULKARNI
Author Info
Open Visualization
Name
Affiliation
Papers
ANKUR A. KULKARNI
Indian Inst Technol, Syst & Control Engn Grp, Bombay 400076, Maharashtra, India
47
Collaborators
Citations
PageRank
31
106
20.95
Referers
Referees
References
161
287
241
Search Limit
100
287
Publications (47 rows)
Collaborators (31 rows)
Referers (100 rows)
Referees (100 rows)
Title
Citations
PageRank
Year
OPTIMAL QUESTIONNAIRES FOR SCREENING OF STRATEGIC AGENTS
0
0.34
2021
Efficiency Fairness Tradeoff In Battery Sharing
0
0.34
2021
Information Extraction from a Strategic Sender over a Noisy Channel
0
0.34
2020
Achievable Rates for Strategic Communication
0
0.34
2020
Communicating with a Strategic Sender
0
0.34
2020
Near Optimality of Linear Strategies for Static Teams With “Big” Non-Gaussian Noise
0
0.34
2020
Zero Error Strategic Communication
0
0.34
2020
New results on the existence of open loop Nash equilibria in discrete time dynamic games via generalized Nash games
1
0.37
2019
Aggregate play and welfare in strategic interactions on networks
0
0.34
2019
Price-Coupling Games And The Generation Expansion Planning Problem
0
0.34
2019
A Minimax Theorem for Finite Blocklength Joint Source-Channel Coding over an AVC
0
0.34
2019
Sizing Storage for Reliable Renewable Integration: A Large Deviations Approach.
0
0.34
2019
Pricing and Commission in Two-Sided Markets with Free Upgrades.
0
0.34
2018
An Approach Based on Generalized Nash Games and Shared Constraints for Discrete Time Dynamic Games.
0
0.34
2018
Shannon Meets von Neumann: A Minimax Theorem for Channel Coding in the Presence of a Jammer
0
0.34
2018
A linear complementarity based characterization of the weighted independence number and the independent domination number in graphs.
2
0.58
2018
On Independent Cliques and Linear Complementarity Problems.
0
0.34
2018
Strategy-Proof Spectrum Allocation among Multiple Operators
0
0.34
2018
Platform Competition for Throughput in Two-sided Freelance Markets
0
0.34
2018
Improved Finite Blocklength Converses for Slepian-Wolf Coding via Linear Programming.
1
0.36
2018
New Finite Blocklength Converses for Asymmetric Multiple Access Channels via Linear Programming
0
0.34
2018
Linear Programming Based Finite Blocklength Converses in Information Theory
0
0.34
2018
On A Game Between A Delay-Constrained Communication System And A Finite State Jammer
0
0.34
2018
Local and Networked Mean-square Estimation with High Dimensional Log-concave Noise.
0
0.34
2018
Linear Programming-Based Converses for Finite Blocklength Lossy Joint Source-Channel Coding.
0
0.34
2017
Non-constructive lower bounds for binary asymmetric error correcting codes.
0
0.34
2017
A linear programming based channel coding strong converse for the BSC and BEC.
1
0.48
2017
Linear Programming based Converses for Finite Blocklength Lossy Joint Source-Channel Coding.
1
0.44
2016
Restricted Composition Deletion Correcting Codes.
4
0.50
2016
Refinement of the Equilibrium of Public Goods Games over Networks: Efficiency and Effort of Specialized Equilibria.
0
0.34
2016
Mean-Square Estimation With High Dimensional Log-Concave Noise
0
0.34
2016
Near-Optimality of Linear Strategies for Static Teams with `Big' Non-Gaussian Noise.
0
0.34
2016
New Results on the Existence of Open Loop Nash Equilibria in Discrete Time Dynamic Games
0
0.34
2015
An optimizer's approach to stochastic control problems with nonclassical information structures
12
1.11
2015
An Existence Result for Hierarchical Stackelberg v/s Stackelberg Games
7
0.58
2015
Dimensionality reduction of affine variational inequalities using random projections
0
0.34
2014
On the Varshamov-Tenengolts construction on binary strings.
0
0.34
2014
On the consistency of leaders' conjectures in hierarchical games.
5
0.53
2013
Recourse-based stochastic nonlinear programming: properties and Benders-SQP algorithms
6
0.53
2012
Two Approaches to the Construction of Deletion Correcting Codes: Weight Partitioning and Optimal Colorings
1
0.37
2012
A coloring approach to constructing deletion correcting codes from constant weight subgraphs
8
0.84
2012
Global Equilibria of Multi-leader Multi-follower Games with Shared Constraints
0
0.34
2012
On the variational equilibrium as a refinement of the generalized Nash equilibrium
35
1.91
2012
Revisiting Generalized Nash Games and Variational Inequalities.
10
0.57
2012
Approximate dynamic programming using fluid and diffusion approximations with applications to power management
7
0.61
2009
New insights on generalized Nash games with shared constraints: Constrained and variational equilibria
4
0.67
2009
Finite dimensional approximation and Newton-based algorithm for stochastic approximation in Hilbert space
1
0.36
2009
1
