The one-way Fubini property and conditional independence: An equivalence result

Hammond, Peter J.; Sun, Yeneng

doi:10.1016/j.aim.2020.107487

Search citation statements

Order By: Relevance

Paper Sections

Select...

A Proofs A1 Proof Of Proposition1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2021

2022

Publication Types

Select...

Other1

Article1

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

(1 citation statement)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…where C > 0 is a finite constant depending only on T , W 2 , and the coefficient bound. Iterating the inequality (23) and making use of the fact that…”

Section: A Proofs A1 Proof Of Propositionmentioning

confidence: 99%

Stochastic Graphon Games: II. The Linear-Quadratic Case

Aurell¹,

Carmona²,

Laurière³

2021

Preprint

View full text Add to dashboard Cite

In this paper, we analyze linear-quadratic stochastic differential games with a continuum of players interacting through graphon aggregates, each state being subject to idiosyncratic Brownian shocks. The major technical issue is the joint measurability of the player state trajectories with respect to samples and player labels, which is required to compute for example costs involving the graphon aggregate. To resolve this issue we set the game in a Fubini extension of a product probability space. We provide conditions under which the graphon aggregates are deterministic and the linear state equation is uniquely solvable for all players in the continuum. The Pontryagin maximum principle yields equilibrium conditions for the graphon game in the form of a forward-backward stochastic differential equation, for which we establish existence and uniqueness. We then study how graphon games approximate games with finitely many players over graphs with random weights. We illustrate some of the results with a numerical example.

show abstract

“…where C > 0 is a finite constant depending only on T , W 2 , and the coefficient bound. Iterating the inequality (23) and making use of the fact that…”

Section: A Proofs A1 Proof Of Propositionmentioning

confidence: 99%