An Approach to Stochastic Dynamic Games with Asymmetric Information and Hidden Actions

01/12/2023
by   Yi Ouyang, et al.
0

We consider in discrete time, a general class of sequential stochastic dynamic games with asymmetric information with the following features. The underlying system has Markovian dynamics controlled by the agents' joint actions. Each agent's instantaneous utility depends on the current system state and the agents' joint actions. At each time instant each agent makes a private noisy observation of the current system state and the agents' actions in the previous time instant. In addition, at each time instant all agents have a common noisy observation of the current system state and their actions in the previous time instant. Each agent's actions are part of his private information. The objective is to determine Bayesian Nash Equilibrium (BNE) strategy profiles that are based on a compressed version of the agents' information and can be sequentially computed; such BNE strategy profiles may not always exist. We present an approach/methodology that achieves the above-stated objective, along with an instance of a game where BNE strategy profiles with the above-mentioned characteristics exist. We show that the methodology also works for the case where the agents have no common observations.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/10/2018

Sequential decomposition of dynamic games with asymmetric information and dependent states

We consider a finite-horizon dynamic game with asymmetric information wi...
research
02/23/2021

Dynamic Games among Teams with Delayed Intra-Team Information Sharing

We analyze a class of stochastic dynamic games among teams with asymmetr...
research
09/03/2019

Zero-sum Stochastic Games with Asymmetric Information

A general model for zero-sum stochastic games with asymmetric informatio...
research
09/14/2019

Acquisition Games with Partial-Asymmetric Information

We consider an example of stochastic games with partial, asymmetric and ...
research
05/13/2014

Algorithm Instance Games

This paper introduces algorithm instance games (AIGs) as a conceptual cl...
research
07/04/2022

Reaching optimal distributed estimation through myopic self-confidence adaptation

Consider discrete-time linear distributed averaging dynamics, whereby ag...
research
11/28/2019

Policies for constraining the behaviour of coalitions of agents in the context of algebraic information theory

This article takes an oblique sidestep from two previous papers, wherein...

Please sign up or login with your details

Forgot password? Click here to reset