Large Ranking Games with Diffusion Control

Author:

Ankirchner Stefan1ORCID,Kazi-Tani Nabil2,Wendt Julian1,Zhou Chao3ORCID

Affiliation:

1. Institute for Mathematics, University of Jena, 07743 Jena, Germany;

2. Institut Elie Cartan de Lorraine, Université de Lorraine, L’Unité de Formation et de Recherche Mathématiques Informatique et Mécanique (UFR MIM), 57073 Metz Cedex 03, France;

3. Department of Mathematics and Risk Management Institute, National University of Singapore, 119076, Singapore

Abstract

We consider a symmetric stochastic differential game where each player can control the diffusion intensity of an individual dynamic state process, and the players whose states at a deterministic finite time horizon are among the best [Formula: see text] of all states receive a fixed prize. Within the mean field limit version of the game, we compute an explicit equilibrium, a threshold strategy that consists of choosing the maximal fluctuation intensity when the state is below a given threshold and the minimal intensity otherwise. We show that for large n, the symmetric n-tuple of the threshold strategy provides an approximate Nash equilibrium of the n-player game. We also derive the rate at which the approximate equilibrium reward and the best-response reward converge to each other, as the number of players n tends to infinity. Finally, we compare the approximate equilibrium for large games with the equilibrium of the two-player case. Funding: Support from the Deutsche Forschungsgemeinschaft [Grant AN 1024/5-1] is acknowledged. The research of N. Kazi-Tani is supported by the Agence Nationale de la Recherche [Grant ANR-21-CE46-0002-03]. The research of C. Zhou is supported by the National Natural Science Foundation of China [Grant 11871364], the Singapore Ministry of Education [Grants A-8000453-00-00, A-0004273-00-00 and A-0004277-00-00] and the MERLION 2020 award [Grant A-0004589-00-00].

Publisher

Institute for Operations Research and the Management Sciences (INFORMS)

Subject

Management Science and Operations Research,Computer Science Applications,General Mathematics

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3