Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 43 tok/s
Gemini 2.5 Pro 48 tok/s Pro
GPT-5 Medium 21 tok/s Pro
GPT-5 High 20 tok/s Pro
GPT-4o 95 tok/s Pro
Kimi K2 180 tok/s Pro
GPT OSS 120B 443 tok/s Pro
Claude Sonnet 4.5 32 tok/s Pro
2000 character limit reached

Optimal stopping and a non-zero-sum Dynkin game in discrete time with risk measures induced by BSDEs (1705.03724v1)

Published 10 May 2017 in math.PR and q-fin.RM

Abstract: We first study an optimal stopping problem in which a player (an agent) uses a discrete stopping time in order to stop optimally a payoff process whose risk is evaluated by a (non-linear) $g$-expectation. We then consider a non-zero-sum game on discrete stopping times with two agents who aim at minimizing their respective risks. The payoffs of the agents are assessed by g-expectations (with possibly different drivers for the different players). By using the results of the first part, combined with some ideas of S. Hamad{`e}ne and J. Zhang, we construct a Nash equilibrium point of this game by a recursive procedure. Our results are obtained in the case of a standard Lipschitz driver $g$ without any additional assumption on the driver besides that ensuring the monotonicity of the corresponding $g$-expectation.

Summary

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

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.