國立虎尾科技大學 |

Utility Maximization in a Market With Competitive Heterogeneous Agents : = Backward Propagation of Chaos and Learning.

紀錄類型:	書目-語言資料,手稿 : Monograph/item
正題名/作者:	Utility Maximization in a Market With Competitive Heterogeneous Agents :/
其他題名:	Backward Propagation of Chaos and Learning.
作者:	Zhou, Xuchen.
面頁冊數:	1 online resource (155 pages)
附註:	Source: Dissertations Abstracts International, Volume: 85-08, Section: B.
Contained By:	Dissertations Abstracts International85-08B.
標題:	Applied mathematics. -
電子資源:	click for full text (PQDT)
ISBN:	9798381682984

Utility Maximization in a Market With Competitive Heterogeneous Agents : = Backward Propagation of Chaos and Learning.
Zhou, Xuchen.

Utility Maximization in a Market With Competitive Heterogeneous Agents :Backward Propagation of Chaos and Learning. - 1 online resource (155 pages)

Source: Dissertations Abstracts International, Volume: 85-08, Section: B.

Thesis (Ph.D.)--Princeton University, 2024.

Includes bibliographical references

This thesis is dedicated to the theory and numerics of expected utility maximization game under relative performance concerns, in a large population of competitive, heterogeneous agents.First, we consider an incomplete market model in which agents have CARA utilities, and we obtain characterizations of Nash equilibria in both the finite and infinite agent settings. The infinite agent setting leads to a stochastic graphon game, where a continuum of agents interact through a graphon. Under modest assumptions on the denseness of the interaction graph, we establish convergence results for the Nash equilibria of the finite agent problem to the infinite agent problem. This result is achieved as an application of a general backward propagation of chaos type result for systems of interacting forward-backward stochastic differential equations (FBSDEs), where the interaction is heterogeneous and through the control processes, and the generator is of quadratic growth. Characterizing the graphon game gives rise to a novel form of infinite-dimensional FBSDEs of McKean-Vlasov type, for which we provide well-posedness results.Next, we consider a class of McKean-Vlasov type BSDEs, with the interaction term dependent more generally on the laws of both the value processes and the diagonals of the control processes. We prove a convergence result from the finite particle system to the infinite particle system. Under certain assumptions on the Malliavin differentiabilities of the terminal value and the generator, we improve upon the usual Lipschitz conditions imposed on the generator, by allowing the generator to be locally Lipschitz. Under stronger conditions, we prove a point-wise convergence result for the control processes.Lastly, we adopt a neural network algorithm to learning Mckean-Vlasov type graphon FBSDEs, in order to approximate numerically the equilibrium of the heterogeneous utility maximization game. We analyze the accuracy and efficiency of the algorithm in a complete market when stock prices are lognormal. We analyze the quality of the learnt control by computing exploitability of the algorithm for different graphons. Lastly, We provide inferences of the risk aversion levels and graphons on equilibrium wealth, benchmarked wealth, and equilibrium utilities, in a complete market when the stock price coefficients are Markovian.

Electronic reproduction.
Ann Arbor, Mich. :
ProQuest,
2024

Mode of access: World Wide Web

ISBN: 9798381682984Subjects--Topical Terms:

1069907
Applied mathematics.
Subjects--Index Terms:

Nash equilibriaIndex Terms--Genre/Form:

554714
Electronic books.

Utility Maximization in a Market With Competitive Heterogeneous Agents : = Backward Propagation of Chaos and Learning.
LDR:03792ntm a22003977 4500 001 1148331
005 20240924101855.5
006 m o d
007 cr bn ---uuuuu
008 250605s2024 xx obm 000 0 eng d
020 $a 9798381682984
035 $a (MiAaPQ)AAI30694691
035 $a AAI30694691
040 $a MiAaPQ $b eng $c MiAaPQ $d NTU
100 1 $a Zhou, Xuchen. $3 1474275
245 1 0 $a Utility Maximization in a Market With Competitive Heterogeneous Agents : $b Backward Propagation of Chaos and Learning.
264 0 $c 2024
300 $a 1 online resource (155 pages)
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
500 $a Source: Dissertations Abstracts International, Volume: 85-08, Section: B.
500 $a Advisor: Tangpi, Ludovic.
502 $a Thesis (Ph.D.)--Princeton University, 2024.
504 $a Includes bibliographical references
520 $a This thesis is dedicated to the theory and numerics of expected utility maximization game under relative performance concerns, in a large population of competitive, heterogeneous agents.First, we consider an incomplete market model in which agents have CARA utilities, and we obtain characterizations of Nash equilibria in both the finite and infinite agent settings. The infinite agent setting leads to a stochastic graphon game, where a continuum of agents interact through a graphon. Under modest assumptions on the denseness of the interaction graph, we establish convergence results for the Nash equilibria of the finite agent problem to the infinite agent problem. This result is achieved as an application of a general backward propagation of chaos type result for systems of interacting forward-backward stochastic differential equations (FBSDEs), where the interaction is heterogeneous and through the control processes, and the generator is of quadratic growth. Characterizing the graphon game gives rise to a novel form of infinite-dimensional FBSDEs of McKean-Vlasov type, for which we provide well-posedness results.Next, we consider a class of McKean-Vlasov type BSDEs, with the interaction term dependent more generally on the laws of both the value processes and the diagonals of the control processes. We prove a convergence result from the finite particle system to the infinite particle system. Under certain assumptions on the Malliavin differentiabilities of the terminal value and the generator, we improve upon the usual Lipschitz conditions imposed on the generator, by allowing the generator to be locally Lipschitz. Under stronger conditions, we prove a point-wise convergence result for the control processes.Lastly, we adopt a neural network algorithm to learning Mckean-Vlasov type graphon FBSDEs, in order to approximate numerically the equilibrium of the heterogeneous utility maximization game. We analyze the accuracy and efficiency of the algorithm in a complete market when stock prices are lognormal. We analyze the quality of the learnt control by computing exploitability of the algorithm for different graphons. Lastly, We provide inferences of the risk aversion levels and graphons on equilibrium wealth, benchmarked wealth, and equilibrium utilities, in a complete market when the stock price coefficients are Markovian.
533 $a Electronic reproduction. $b Ann Arbor, Mich. : $c ProQuest, $d 2024
538 $a Mode of access: World Wide Web
650 4 $a Applied mathematics. $3 1069907
650 4 $a Finance. $3 559073
650 4 $a Mathematics. $3 527692
653 $a Nash equilibria
653 $a Heterogeneous agents
653 $a Neural network algorithm
653 $a Stock prices
653 $a Computing exploitability
655 7 $a Electronic books. $2 local $3 554714
690 $a 0405
690 $a 0508
690 $a 0364
710 2 $a Princeton University. $b Operations Research and Financial Engineering. $3 1182940
710 2 $a ProQuest Information and Learning Co. $3 1178819
773 0 $t Dissertations Abstracts International $g 85-08B.
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=30694691 $z click for full text (PQDT)