中文
相关论文

相关论文: General Duality for Perpetual American Options

200 篇论文

We introduce an algorithm for the pricing of finite expiry American options driven by L\'evy processes. The idea is to tweak Carr's `Canadisation' method, cf. Carr [9] (see also Bouchard et al [5]), in such a way that the adjusted algorithm…

概率论 · 数学 2013-04-17 Florian Kleinert , Kees van Schaik

We consider the problem of finding a consistent upper price bound for exotic options whose payoff depends on the stock price at two different predetermined time points (e.g. Asian option), given a finite number of observed call prices for…

数理金融 · 定量金融 2021-07-21 Nicole Bäuerle , Daniel Schmithals

We consider the robust utility maximization using a static holding in derivatives and a dynamic holding in the stock. There is no fixed model for the price of the stock but we consider a set of probability measures (models) which are not…

概率论 · 数学 2013-07-19 Erhan Bayraktar , Zhou Zhou

The aim of this article is to provide a systematic analysis of the conditions such that Fourier transform valuation formulas are valid in a general framework; i.e. when the option has an arbitrary payoff function and depends on the path of…

证券定价 · 定量金融 2010-07-08 Ernst Eberlein , Kathrin Glau , Antonis Papapantoleon

In mean-payoff games, the objective of the protagonist is to ensure that the limit average of an infinite sequence of numeric weights is nonnegative. In energy games, the objective is to ensure that the running sum of weights is always…

计算机科学中的逻辑 · 计算机科学 2010-10-05 Krishnendu Chatterjee , Laurent Doyen , Thomas A. Henzinger , Jean-Francois Raskin

We consider the classical question of predicting binary sequences and study the {\em optimal} algorithms for obtaining the best possible regret and payoff functions for this problem. The question turns out to be also equivalent to the…

机器学习 · 计算机科学 2013-05-08 Alexandr Andoni , Rina Panigrahy

Mean-payoff games on timed automata are played on the infinite weighted graph of configurations of priced timed automata between two players, Player Min and Player Max, by moving a token along the states of the graph to form an infinite…

计算机科学与博弈论 · 计算机科学 2020-01-16 Shibashis Guha , Marcin Jurdzinski , Krishna S. , Ashutosh Trivedi

In online betting, the bookmaker can update the payoffs it offers on a particular event many times before the event takes place, and the updated payoffs may depend on the bets accumulated thus far. We study the problem of bookmaking with…

计算机科学与博弈论 · 计算机科学 2025-01-14 Alankrita Bhatt , Or Ordentlich , Oron Sabag

We investigate how well continuous-time fictitious play in two-player games performs in terms of average payoff, particularly compared to Nash equilibrium payoff. We show that in many games, fictitious play outperforms Nash equilibrium on…

计算机科学与博弈论 · 计算机科学 2014-11-20 Georg Ostrovski , Sebastian van Strien

We study optimal perfect distinguishability between a unitary and a general quantum operation. In 2-dimensional case we provide a simple sufficient and necessary condition for sequential perfect distinguishability and an analytical formula…

量子物理 · 物理学 2010-10-13 Cheng Lu , Jianxin Chen , Runyao Duan

We study the convex duality method for robust utility maximization in the presence of a random endowment. When the underlying price process is a locally bounded semimartingale, we show that the fundamental duality relation holds true for a…

计算金融 · 定量金融 2015-03-17 Keita Owari

In a two-player zero-sum graph game the players move a token throughout a graph to produce an infinite path, which determines the winner or payoff of the game. Traditionally, the players alternate turns in moving the token. In {\em bidding…

理论经济学 · 经济学 2020-12-22 Guy Avni , Ismaël Jecker , Đorđe Žikelić

Two-player win/lose games of infinite duration are involved in several disciplines including computer science and logic. If such a game has deterministic winning strategies, one may ask how simple such strategies can get. The answer may…

计算机科学与博弈论 · 计算机科学 2020-02-04 Stéphane Le Roux

We study the upper and lower bounds for prices of European and American style options with the possibility of an external termination, meaning that the contract may be terminated at some random time. Under the assumption that the underlying…

数理金融 · 定量金融 2022-12-27 Libo Li , Ruyi Liu , Marek Rutkowski

In computing, as in many aspects of life, changes incur cost. Many optimization problems are formulated as a one-time instance starting from scratch. However, a common case that arises is when we already have a set of prior assignments, and…

数据结构与算法 · 计算机科学 2013-02-11 Edith Cohen , Graham Cormode , Nick Duffield , Carsten Lund

We revisit the classical phenomenon of duality between random integer-valued height functions with positive definite potentials and abelian spin models with O(2) symmetry. We use it to derive new results in quite high generality including:…

概率论 · 数学 2025-10-15 Diederik van Engelenburg , Marcin Lis

The existence and uniqueness of probabilistic solutions of variational inequalities for the general American options are proved under the hypothesis of hypoellipticity of the infinitesimal generator of the underlying diffusion process which…

概率论 · 数学 2008-10-09 Ali Süleyman Üstünel

We study the optimal multiple stopping time problem defined for each stopping time $S$ by $v(S)=\operatorname {ess}\sup_{\tau_1,...,\tau_d\geq S}E[\psi(\tau_1,...,\tau_d)|\mathcal{F}_S]$. The key point is the construction of a new reward…

In this paper, we solve the constant-payoff conjecture formulated by Sorin, Venel and Vigeral (2010), for absorbing games with an arbitrary evaluation of the stage rewards. That is, the existence of a pair of asymptotically optimal…

最优化与控制 · 数学 2020-03-06 Miquel Oliu-Barton

We study the Option pricing with linear investment strategy based on discrete time trading of the underlying security, which unlike the existing continuous trading models provides a feasible real market implementation. Closed form formulas…

应用统计 · 统计学 2022-04-06 Niloofar Ghorbani , Andrzej Korzeniowski