Urmăriți
Ankur A. Kulkarni
Ankur A. Kulkarni
Kelkar Family Chair Professor, Indian Institute of Technology Bombay
Adresă de e-mail confirmată pe iitb.ac.in - Pagina de pornire
Titlu
Citat de
Citat de
Anul
On the variational equilibrium as a refinement of the generalized Nash equilibrium
AA Kulkarni, UV Shanbhag
Automatica 48 (1), 45-55, 2012
1852012
Non-asymptotic upper bounds for deletion correcting codes
A Kulkarni, N Kiyavash
IEEE Transactions on Information Theory, 2012
1072012
A Shared-Constraint Approach to Multi-leader Multi-follower Games
AA Kulkarni, UV Shanbhag
Set Valued and Variational Analysis, 2014
882014
An Existence Result for Hierarchical Stackelberg v/s Stackelberg Games
AA Kulkarni, UV Shanbhag
IEEE Transactions on Automatic Control, 2015
632015
An optimizer's approach to stochastic control problems with nonclassical information structures
AA Kulkarni, TP Coleman
Decision and Control (CDC), 2012 IEEE 51st Annual Conference on, 154-159, 2012
522012
Approximate dynamic programming using fluid and diffusion approximations with applications to power management
W Chen, D Huang, AA Kulkarni, J Unnikrishnan, Q Zhu, P Mehta, S Meyn, ...
Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held …, 2009
492009
Revisiting generalized Nash games and variational inequalities
AA Kulkarni, UV Shanbhag
Journal of Optimization Theory and Applications, 2012
432012
Recourse-based stochastic nonlinear programming: properties and Benders-SQP algorithms
AA Kulkarni, UV Shanbhag
Computational Optimization and Applications, 1-47, 2010
242010
A Coloring Approach to Constructing Deletion Correcting Codes from Constant Weight Subgraphs
D Cullina, AA Kulkarni, N Kiyavash
IEEE International Symposium on Information Theory, 2012
232012
Achievable rates for strategic communication
AS Vora, AA Kulkarni
2020 IEEE International Symposium on Information Theory (ISIT), 1379-1384, 2020
212020
Linear programming-based converses for finite blocklength lossy joint source-channel coding
ST Jose, AA Kulkarni
IEEE Transactions on Information Theory 63 (11), 7066-7094, 2017
202017
Restricted composition deletion correcting codes
D Cullina, N Kiyavash, AA Kulkarni
IEEE Transactions on Information Theory 62 (9), 4819-4832, 2016
142016
On the Consistency of Leaders’ Conjectures in Hierarchical Games
AA Kulkarni, UV Shanbhag
IEEE Conference on Decision and Control, 2013
142013
Information extraction from a strategic sender over a noisy channel
AS Vora, AA Kulkarni
2020 59th IEEE Conference on Decision and Control (CDC), 354-359, 2020
132020
Generalized Nash games with shared constraints: Existence, efficiency, refinement and equilibrium constraints
AA Kulkarni
University of Illinois at Urbana-Champaign, 2011
122011
ADMM‐based algorithm for solving DC‐OPF in a large electricity network considering transmission losses
MP Abraham, AA Kulkarni
IET Generation, Transmission & Distribution 12 (21), 5811-5823, 2018
112018
Games and teams with shared constraints
AA Kulkarni
Philosophical Transactions of the Royal Society A: Mathematical, Physical …, 2017
112017
Shannon meets von Neumann: A minimax theorem for channel coding in the presence of a jammer
ST Jose, AA Kulkarni
IEEE Transactions on Information Theory 66 (5), 2842-2859, 2020
102020
Refinement of the equilibrium of public goods games over networks: Efficiency and effort of specialized equilibria
P Pandit, AA Kulkarni
Journal of Mathematical Economics 79, 125-139, 2018
102018
Improved finite blocklength converses for Slepian–Wolf coding via linear programming
ST Jose, AA Kulkarni
IEEE Transactions on Information Theory 65 (4), 2423-2441, 2018
102018
Sistemul nu poate realiza operația în acest moment. Încercați din nou mai târziu.
Articole 1–20