Ankur A. Kulkarni

From MaRDI portal
Revision as of 16:43, 11 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Ankur A. Kulkarni to Ankur A. Kulkarni: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:393363

Available identifiers

zbMath Open kulkarni.ankur-aMaRDI QIDQ393363

List of research outcomes





PublicationDate of PublicationType
Shannon meets Myerson: information extraction from a strategic sender2024-11-12Paper
Information revelation through signalling2022-12-02Paper
On independent cliques and linear complementarity problems2022-11-09Paper
Efficiency fairness tradeoff in battery sharing2021-12-13Paper
Minimax theorems for finite blocklength lossy joint source-channel coding over an arbitrarily varying channel2021-08-04Paper
Price-coupling games and the generation expansion planning problem2021-01-07Paper
Near Optimality of Linear Strategies for Static Teams With “Big” Non-Gaussian Noise2020-10-07Paper
Shannon Meets von Neumann: A Minimax Theorem for Channel Coding in the Presence of a Jammer2020-09-29Paper
Aggregate play and welfare in strategic interactions on networks2020-05-11Paper
Efficiency Fairness Tradeoff in Battery Sharing2019-08-02Paper
Improved Finite Blocklength Converses for Slepian–Wolf Coding via Linear Programming2019-07-19Paper
New results on the existence of open loop Nash equilibria in discrete time dynamic games via generalized Nash games2019-05-31Paper
An approach based on generalized Nash games and shared constraints for discrete time dynamic games2019-05-03Paper
Refinement of the equilibrium of public goods games over networks: efficiency and effort of specialized equilibria2018-12-20Paper
Games and teams with shared constraints2018-12-13Paper
Linear Programming-Based Converses for Finite Blocklength Lossy Joint Source-Channel Coding2018-06-27Paper
Local and Networked Mean-square Estimation with High Dimensional Log-concave Noise2018-06-27Paper
A linear complementarity based characterization of the weighted independence number and the independent domination number in graphs2018-05-24Paper
Nonasymptotic Upper Bounds for Deletion Correcting Codes2017-06-08Paper
An Existence Result for Hierarchical Stackelberg v/s Stackelberg Games2017-05-16Paper
An Optimizer's Approach to Stochastic Control Problems With Nonclassical Information Structures2017-05-16Paper
Restricted Composition Deletion Correcting Codes2017-04-28Paper
Near-Optimality of Linear Strategies for Static Teams with `Big' Non-Gaussian Noise2016-03-10Paper
A shared-constraint approach to multi-leader multi-follower games2014-11-26Paper
On the Varshamov-Tenengolts construction on binary strings2014-01-17Paper
Revisiting generalized Nash games and variational inequalities2012-11-26Paper
Two Approaches to the Construction of Deletion Correcting Codes: Weight Partitioning and Optimal Colorings2012-11-16Paper
On the variational equilibrium as a refinement of the generalized Nash equilibrium2012-08-24Paper
Recourse-based stochastic nonlinear programming: properties and Benders-SQP algorithms2012-07-10Paper
Finite dimensional approximation and Newton-based algorithm for stochastic approximation in Hilbert space2010-06-17Paper

Research outcomes over time

This page was built for person: Ankur A. Kulkarni