activity
20122023
most citedA Shared-Constraint Approach to Multi-leader Multi-follower Games

72 citations · 199 across the 23 of their papers we have counts for

collaborators

33 papers

eess.SY2023★ 1 cited

The Quantum Advantage in Binary Teams and the Coordination Dilemma: Part I

Shashank A. Deshpande, Ankur A. Kulkarni

We have shown that entanglement assisted stochastic strategies allow access to strategic measures beyond the classically correlated measures accessible through passive common rando…

cs.IT2023★ 1 cited

Achievable Rates for Information Extraction from a Strategic Sender

Anuj S. Vora, Ankur A. Kulkarni

We consider a setting of non-cooperative communication where a receiver wants to recover randomly generated sequences of symbols that are observed by a strategic sender. The sender…

eess.SY2023

Signalling for Electricity Demand Response: When is Truth Telling Optimal?

Rene Aid, Anupama Kowli, Ankur A. Kulkarni

Utilities and transmission system operators (TSO) around the world implement demand response programs for reducing electricity consumption by sending information on the state of ba…

eess.SY2022

A Scalable Bayesian Persuasion Framework for Epidemic Containment on Heterogeneous Networks

Shraddha Pathak, Ankur A. Kulkarni

During an epidemic, the information available to individuals in the society deeply influences their belief of the epidemic spread, and consequently the preventive measures they tak…

eess.SY2022★ 3 cited

The Quantum Advantage in Decentralized Control

Shashank A. Deshpande, Ankur A. Kulkarni

It is known in the context of decentralised control that there exist control strategies consistent with the requirements of a given information structure, yet physically unimplemen…

cs.GT2022★ 1 cited

Information Revelation Through Signalling

Reema Deori, Ankur A. Kulkarni

This paper studies a Stackelberg game wherein a sender (leader) attempts to shape the information of a less informed receiver (follower) who in turn takes an action that determines…

cs.IR2020

Optimal Questionnaires for Screening of Strategic Agents

Anuj S. Vora, Ankur A. Kulkarni

During the COVID- pandemic the health authorities at airports and train stations try to screen and identify the travellers possibly exposed to the virus. However, many individu…

cs.IT2020

Shannon meets Myerson: Information Extraction from a Strategic Sender

Anuj S. Vora, Ankur A. Kulkarni

We study a setting where a receiver must design a questionnaire to recover a sequence of symbols known to strategic sender, whose utility may not be incentive compatible. We allow…

math.OC2020

Duopolistic platform competition for revenue and throughput

Mansi Sood, Ankur A. Kulkarni, Sharayu Moharir

We consider two competing platforms operating in a two-sided market and offering identical services to their customers at potentially different prices. The objective of each platfo…

cs.GT2020

Strategy-Proof Spectrum Allocation among Multiple Operators for Demand Varying Wireless Networks

Indu Yadav, Ankur A. Kulkarni, Abhay Karandikar

To address the exponentially increasing data rate demands of end users, necessitates efficient spectrum allocation among co-existing operators in licensed and unlicensed spectrum b…

eess.SY2019

Statistical Economies of Scale in Battery Sharing

Vivek Deulkar, Jayakrishnan Nair, Ankur A. Kulkarni

The goal of this paper is to shed light on the statistical economies of scale achievable from sharing of storage between renewable generators. We conduct an extensive study using r…

cs.GT2019★ 2 cited

The Efficiency of Generalized Nash and Variational Equilibria

Ankur A. Kulkarni

Shared-constraint games are noncooperative -player games where players are coupled through a common coupling constraint. It is known that such games admit two kinds of equilibri…

math.OC2019

Efficiency Fairness Tradeoff in Battery Sharing

Karan N. Chadha, Ankur A. Kulkarni, Jayakrishnan Nair

The increasing presence of decentralized renewable generation in the power grid has motivated consumers to install batteries to save excess energy for future use. The high price of…

cs.IT2019★ 1 cited

Minimax Theorems for Finite Blocklength Lossy Joint Source-Channel Coding over an AVC

Anuj S. Vora, Ankur A. Kulkarni

Motivated by applications in the security of cyber-physical systems, we pose the finite blocklength communication problem in the presence of a jammer as a zero-sum game between the…

cs.GT2019

Aggregate Play and Welfare in Strategic Interactions on Networks

Karan N. Chadha, Ankur A. Kulkarni

In recent work by Bramoullé and Kranton, a model for the provision of public goods on a network was presented and relations between equilibria of such a game and properties of the…

eess.SY2019

Sizing Storage for Reliable Renewable Integration: A Large Deviations Approach

Vivek Deulkar, Jayakrishnan Nair, Ankur A. Kulkarni

The inherent intermittency of wind and solar generation presents a significant challenge as we seek to increase the penetration of renewable generation in the power grid. Increasin…

math.OC2019

Price-Coupling Games and the Generation Expansion Planning Problem

Mathew P. Abraham, Ankur A. Kulkarni

In this paper, we introduce and study a class of games called price-coupling games that arise in many scenarios, especially in the electricity industry. In a price-coupling game, t…

cs.GT2018

Strategy-Proof Spectrum Allocation among Multiple Operators

Indu Yadav, Ankur A. Kulkarni, Abhay Karandikar

To address the demand of exponentially increasing end users efficient use of limited spectrum is a necessity. For this, spectrum allocation among co-existing operators in licensed…

cs.DM2018★ 1 cited

On Independent Cliques and Linear Complementarity Problems

Karan N. Chadha, Ankur A. Kulkarni

In recent work (Pandit and Kulkarni [Discrete Applied Mathematics, 244 (2018), pp. 155--169]), the independence number of a graph was characterized as the maximum of the n…

cs.IT2018★ 1 cited

Shannon meets von Neumann: A Minimax Theorem for Channel Coding in the Presence of a Jammer

Sharu Theresa Jose, Ankur A. Kulkarni

We study the setting of channel coding over a family of channels whose state is controlled by an adversarial jammer by viewing it as a zero-sum game between a finite blocklength en…

cs.IT2018

Improved Finite Blocklength Converses for Slepian-Wolf Coding via Linear Programming

Sharu Theresa Jose, Ankur A. Kulkarni

A new finite blocklength converse for the Slepian- Wolf coding problem is presented which significantly improves on the best known converse for this problem, due to Miyake and Kana…

cs.IT2016

Linear Programming based Converses for Finite Blocklength Lossy Joint Source-Channel Coding

Sharu Theresa Jose, Ankur A. Kulkarni

A linear programming (LP) based framework is presented for obtaining converses for finite blocklength lossy joint source-channel coding problems. The framework applies for any loss…

cs.GT2016★ 9 cited

Refinement of the Equilibrium of Public Goods Games over Networks: Efficiency and Effort of Specialized Equilibria

Parthe Pandit, Ankur A. Kulkarni

Recently Bramoulle and Kranton presented a model for the provision of public goods over a network and showed the existence of a class of Nash equilibria called specialized equilibr…

cs.DM2016★ 3 cited

A linear complementarity based characterization of the weighted independence number and the independent domination number in graphs

Parthe Pandit, Ankur A. Kulkarni

The linear complementarity problem is a continuous optimization problem that generalizes convex quadratic programming, Nash equilibria of bimatrix games and several such problems.…