The following pages link to Ankur A. Kulkarni (Q393363):
Displaying 27 items.
- On the Varshamov-Tenengolts construction on binary strings (Q393366) (← links)
- Recourse-based stochastic nonlinear programming: properties and Benders-SQP algorithms (Q434187) (← links)
- On the variational equilibrium as a refinement of the generalized Nash equilibrium (Q445029) (← links)
- A shared-constraint approach to multi-leader multi-follower games (Q475356) (← links)
- Price-coupling games and the generation expansion planning problem (Q827267) (← links)
- Finite dimensional approximation and Newton-based algorithm for stochastic approximation in Hilbert space (Q976221) (← links)
- Refinement of the equilibrium of public goods games over networks: efficiency and effort of specialized equilibria (Q1633669) (← links)
- An approach based on generalized Nash games and shared constraints for discrete time dynamic games (Q1741187) (← links)
- A linear complementarity based characterization of the weighted independence number and the independent domination number in graphs (Q1752600) (← links)
- Revisiting generalized Nash games and variational inequalities (Q1762396) (← links)
- (Q2044124) (redirect page) (← links)
- Minimax theorems for finite blocklength lossy joint source-channel coding over an arbitrarily varying channel (Q2044125) (← links)
- Efficiency fairness tradeoff in battery sharing (Q2060552) (← links)
- On independent cliques and linear complementarity problems (Q2095085) (← links)
- Information revelation through signalling (Q2107616) (← links)
- Aggregate play and welfare in strategic interactions on networks (Q2178587) (← links)
- New results on the existence of open loop Nash equilibria in discrete time dynamic games via generalized Nash games (Q2417954) (← links)
- Restricted Composition Deletion Correcting Codes (Q2976605) (← links)
- An Existence Result for Hierarchical Stackelberg v/s Stackelberg Games (Q2982496) (← links)
- An Optimizer's Approach to Stochastic Control Problems With Nonclassical Information Structures (Q2982766) (← links)
- Games and teams with shared constraints (Q4561725) (← links)
- Linear Programming-Based Converses for Finite Blocklength Lossy Joint Source-Channel Coding (Q4566545) (← links)
- Local and Networked Mean-square Estimation with High Dimensional Log-concave Noise (Q4569218) (← links)
- Shannon Meets von Neumann: A Minimax Theorem for Channel Coding in the Presence of a Jammer (Q5123898) (← links)
- Near Optimality of Linear Strategies for Static Teams With “Big” Non-Gaussian Noise (Q5125459) (← links)
- Improved Finite Blocklength Converses for Slepian–Wolf Coding via Linear Programming (Q5223940) (← links)
- Nonasymptotic Upper Bounds for Deletion Correcting Codes (Q5346436) (← links)
