English
Related papers

Related papers: Shortfall Minimization for Game Options in Discret…

200 papers

In this paper, we provide an effective characterization of all the subgame-perfect equilibria in infinite duration games played on finite graphs with mean-payoff objectives. To this end, we introduce the notion of requirement, and the…

Computer Science and Game Theory · Computer Science 2022-04-22 Léonard Brice , Jean-François Raskin , Marie Van Den Bogaard

We study a class of optimal stopping games (Dynkin games) of preemption type, with uncertainty about the existence of competitors. The set-up is well-suited to model, for example, real options in the context of investors who do not want to…

Probability · Mathematics 2019-05-17 Tiziano De Angelis , Erik Ekström

In this paper we study the nonzero-sum Dynkin game in continuous time which is a two player non-cooperative game on stopping times. We show that it has a Nash equilibrium point for general stochastic processes. As an application, we…

Pricing of Securities · Quantitative Finance 2008-12-10 Said Hamadene , Jianfeng Zhang

We consider the problem of budget allocation for competitive influence maximization over social networks. In this problem, multiple competing parties (players) want to distribute their limited advertising resources over a set of social…

Computer Science and Game Theory · Computer Science 2021-08-31 S. Rasoul Etesami

We consider two-player non-zero-sum stopping games in discrete time. Unlike Dynkin games, in our games the payoff of each player is revealed after both players stop. Moreover, each player can adjust her own stopping strategy according to…

Optimization and Control · Mathematics 2015-08-26 Zhou Zhou

In this paper, we study a class of discrete-time mean-field games under the infinite-horizon risk-sensitive discounted-cost optimality criterion. Risk-sensitivity is introduced for each agent (player) via an exponential utility function. In…

Optimization and Control · Mathematics 2018-10-08 Naci Saldi , Tamer Basar , Maxim Raginsky

Solvency games, introduced by Berger et al., provide an abstract framework for modelling decisions of a risk-averse investor, whose goal is to avoid ever going broke. We study a new variant of this model, where, in addition to stochastic…

Computational Engineering, Finance, and Science · Computer Science 2013-10-14 Tomáš Brázdil , Taolue Chen , Vojtěch Forejt , Petr Novotný , Aistis Simaitis

Weighted timed games are two-player zero-sum games played in a timed automaton equipped with integer weights. We consider optimal reachability objectives, in which one of the players, that we call Min, wants to reach a target location while…

Computer Science and Game Theory · Computer Science 2025-03-05 Benjamin Monmege , Julie Parreaux , Pierre-Alain Reynier

This paper examines finite zero-sum stochastic games and demonstrates that when the game's duration is sufficiently long, there exists a pair of approximately optimal strategies such that the expected average payoff at any point in the game…

Optimization and Control · Mathematics 2024-12-02 Thomas Ragel , Bruno Ziliotto

We prove existence of a value for two-player zero-sum stopper vs. singular-controller games on finite-time horizon, when the underlying dynamics is one-dimensional, diffusive and bound to evolve in $[0,\infty)$. We show that the value is…

Optimization and Control · Mathematics 2025-06-26 Andrea Bovo , Tiziano De Angelis

Traditional solvable game theory and mean-field-type game theory (risk-aware games) predominantly focus on quadratic costs due to their analytical tractability. Nevertheless, they often fail to capture critical non-linearities inherent in…

Optimization and Control · Mathematics 2025-05-09 Julian Barreiro-Gomez , Tyrone E. Duncan , Bozenna Pasik-Duncan , Hamidou Tembine

We relate the property of discrete selectivity and its corresponding game, both recently introduced by V.V. Tkachuck, to a variety of selection principles and point picking games. In particular we show that player II can win the discrete…

General Topology · Mathematics 2018-06-18 Steven Clontz , Jared Holshouser

We consider multi-player stopping games in continuous time. Unlike Dynkin games, in our games the payoff of each player is revealed after all the players stop. Moreover, each player can adjust her own stopping strategy by observing other…

Optimization and Control · Mathematics 2015-09-15 Zhou Zhou

Generating competitive strategies and performing continuous motion planning simultaneously in an adversarial setting is a challenging problem. In addition, understanding the intent of other agents is crucial to deploying autonomous systems…

Robotics · Computer Science 2023-10-12 Hongrui Zheng , Zhijun Zhuang , Johannes Betz , Rahul Mangharam

Studying continuous time counterpart of some discrete time dynamics is now a standard and fruitful technique, as some properties hold in both setups. In game theory, this is usually done by considering differential games on Euclidean…

Optimization and Control · Mathematics 2018-11-13 Vianney Perchet , Marc Quincampoix

To what extent does the structure of the players' strategy space influence the efficiency of decentralized solutions in congestion games? In this work, we investigate whether better performance are possible when restricting to load…

Computer Science and Game Theory · Computer Science 2022-02-25 Vittorio Bilò , Cosimo Vinci

In this paper we consider a method of solving optimal stopping problems in discrete and continuous time based on their dual representation. A novel and generic simulation-based optimization algorithm not involving nested simulations is…

Probability · Mathematics 2013-09-10 Denis Belomestny

The aim of this short note is to present a solution to the discrete time exponential utility maximization problem in a case where the underlying asset has a multivariate normal distribution. In addition to the usual setting considered in…

Mathematical Finance · Quantitative Finance 2023-06-27 Yan Dolinsky , Or Zuk

We examine the problem of the existence of optimal deterministic stationary strategiesintwo-players antagonistic (zero-sum) perfect information stochastic games with finitely many states and actions.We show that the existenceof such…

Computer Science and Game Theory · Computer Science 2016-11-28 Hugo Gimbert , Wieslaw Zielonka

A multi-player competitive Dynkin stopping game is constructed. Each player can either exit the game for a fixed payoff, determined a priori, or stay and receive an adjusted payoff depending on the decision of other players. The single…

Computer Science and Game Theory · Computer Science 2012-11-20 Ivan Guo
‹ Prev 1 3 4 5 6 7 10 Next ›