Search Results for author:
Found 5 papers, 0 papers with code
Policy Optimization finds Nash Equilibrium in Regularized General-Sum LQ Games
In this paper, we investigate the impact of introducing relative entropy regularization on the Nash Equilibria (NE) of General-Sum $N$-agent games, revealing the fact that the NE of such games conform to linear Gaussian policies.
Learning How to Strategically Disclose Information
In this work, we consider an online version of information design where a sender interacts with a receiver of an unknown type who is adversarially chosen at each round.
Large Population Games on Constrained Unreliable Networks
A Base station (BS) actively schedules agent communications over the network by minimizing a weighted Age of Information (WAoI) based cost function under a capacity limit $\mathcal{C} < N$ on the number of transmission attempts at each instant.
Weighted Age of Information based Scheduling for Large Population Games on Networks
Due to a hard bandwidth constraint on the number of transmissions through the network, at most $R_d < N$ agents can concurrently access their state information through the network.
Timely Tracking of Infection Status of Individuals in a Population
We observe that if the total test rate is limited, instead of testing all members of the population equally, only a portion of the population is tested based on their infection and recovery rates.
Computers and Society Physics and Society
