Robust non-zero-sum stochastic differential reinsurance game by Pun, Chi Seng, Wong, Hoi Ying

Subjects: Get full text
Get full text

The speed of convergence in congestion games under best-response dynamics by Fanelli, Angelo., Flammini, Michele., Moscardelli, Luca.

“…In Ackermann et al. [2008] it has been shown that the convergence time of such dynamics to Nash equilibrium may be exponential in the number of players n. …”
Get full text
Get full text

Mean-field games of optimal stopping : a relaxed solution approach by Bouveret, Géraldine, Dumitrescu, Roxana, Tankov, Peter

“…This framework allows us to prove the existence of a relaxed Nash equilibrium and the uniqueness of the associated value of the representative agent under mild assumptions. …”
Get full text

Non-zero-sum reinsurance games subject to ambiguous correlations by Pun, Chi Seng, Siu, Chi Chung, Wong, Hoi Ying

“…We establish the general framework of Nash equilibrium for the coupled optimization problems. …”
Get full text
Get full text

Robust Time-Inconsistent Stochastic Control Problems by Pun, Chi Seng

“…We adopt a game-theoretic framework and the concept of subgame perfect Nash equilibrium to derive an extended dynamic programming equation and extended Hamilton–Jacobi–Bellman–Isaacs equations for characterizing the robust dynamically optimal control of the problem. …”
Get full text
Get full text

Technological change in water use : a mean-field game approach to optimal investment timing by Bouveret, Géraldine, Dumitrescu, Roxana, Tankov, Peter

“…We formulate the problem of finding a Nash equilibrium as a mean-fi eld game (MFG) of optimal stopping. …”
Get full text

An extended McKean–Vlasov dynamic programming approach to robust equilibrium controls under ambiguous covariance matrix by Lei, Qian, Pun, Chi Seng

“…We apply a game-theoretic concept of subgame perfect Nash equilibrium to develop a robust equilibrium control approach, which can yield robust time-consistent decisions. …”
Get full text

Learning GANs in simultaneous game using Sinkhorn with positive features by Risman Adnan, Muchlisin Adi Saputra, Junaidillah Fadlil, Ezerman, Martianus Frederic, Muhamad Iqbal, Tjan Basaruddin

“…These are the local Nash equilibrium points. We carried out numerical experiments to confirm that our model is computationally stable. …”
Get full text

Approximate pure nash equilibria in weighted congestion games: existence, efficient computation, and structure by Caragiannis, Ioannis, Fanelli, Angelo, Gravin, Nick, Skopalik, Alexander

“…As a byproduct of our techniques, we also show the following interesting structural statement for weighted congestion games with polynomial latency functions of maximum degree d ≥ 2: polynomially-long sequences of best-response moves from any initial state to a d O(d2)-approximate pure Nash equilibrium exist and can be efficiently identified in such games as long as d is constant. …”
Get full text
Get full text