activity
20152023
most citedSequential decomposition of discrete memoryless channel with noisy feedback

3 citations · 9 across the 22 of their papers we have counts for

collaborators
Showing cs.GTShow all

9 papers · 1 filter

cs.GT2020

Network Design for Social Welfare

Abhishek Shende, Deepanshu Vasal, Sriram Vishwanath

In this paper, we consider the problem of network design on network games. We study the conditions on the adjacency matrix of the underlying network to design a game such that the…

cs.GT2020

Existence of structured perfect Bayesian equilibrium in dynamic games of asymmetric information

Deepanshu Vasal

In~[1],authors considered a general finite horizon model of dynamic game of asymmetric information, where N players have types evolving as independent Markovian process, where each…

cs.GT2020

Mechanism Design for Large Scale Network Utility Maximization

Meng Zhang, Deepanshu Vasal

Network utility maximization (NUM) is a general framework for designing distributed optimization algorithms for large-scale networks. An economic challenge arises in the presence o…

cs.GT2020

Master equation of discrete time graphon mean field games and teams

Deepanshu Vasal, Rajesh K Mishra, Sriram Vishwanath

In this paper, we present a sequential decomposition algorithm equivalent of Master equation to compute GMFE of GMFG and graphon optimal Markovian policies (GOMPs) of graphon mean…

cs.GT2019

Markov perfect equilibria in non-stationary mean-field games

Deepanshu Vasal

In this paper, we consider both finite and infinite horizon discounted dynamic mean-field games where there is a large population of homogeneous players sequentially making strateg…

cs.GT2018

Incentive design for learning in user-recommendation systems with time-varying states

Deepanshu Vasal, Vijay Subramanian, Achilleas Anastasopoulos

We consider the problem of how strategic users with asymmetric information can learn an underlying time varying state in a user-recommendation system. Users who observe private sig…

cs.GT2018

Sequential decomposition of repeated games with asymmetric information and dependent states

Deepanshu Vasal

We consider a finite horizon repeated game with selfish players who observe their types privately and take actions, which are publicly observed. Their actions and types jointly…

cs.GT2016★ 1 cited

Decentralized Bayesian learning in dynamic games: A framework for studying informational cascades

Deepanshu Vasal, Achilleas Anastasopoulos

We study the problem of Bayesian learning in a dynamical system involving strategic agents with asymmetric information. In a series of seminal papers in the literature, this proble…

cs.GT2016

Signaling equilibria for dynamic LQG games with asymmetric information

Deepanshu Vasal, Achilleas Anastasopoulos

We consider a finite horizon dynamic game with two players who observe their types privately and take actions, which are publicly observed. Players' types evolve as independent, co…