Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
194 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Continuous-time limit of dynamic games with incomplete information and a more informed player (1501.00293v2)

Published 1 Jan 2015 in math.OC

Abstract: We study a two-player, zero-sum, dynamic game with incomplete information where one of the players is more informed than his opponent. We analyze the limit value as the players play more and more frequently. The more informed player observes the realization of a Markov process (X,Y) on which the payoffs depend, while the less informed player only observes Y and his opponent's actions. We show the existence of a limit value as the time span between two consecutive stages goes to zero. This value is characterized through an auxiliary optimization problem and as the unique viscosity solution of a second order Hamilton-Jacobi equation with convexity constraints.

Summary

We haven't generated a summary for this paper yet.