English
Related papers

Related papers: Game pricing and double sequence of random variabl…

200 papers

Minority game is a model of heterogeneous players who think inductively. In this game, each player chooses one out of two alternatives every turn and those who end up in the minority side wins. It is instructive to extend the minority game…

Statistical Mechanics · Physics 2007-05-23 F. K. Chow , H. F. Chau

We propose a sequential optimizing betting strategy in the multi-dimensional bounded forecasting game in the framework of game-theoretic probability of Shafer and Vovk (2001). By studying the asymptotic behavior of its capital process, we…

Probability · Mathematics 2011-02-16 Masayuki Kumon , Akimichi Takemura , Kei Takeuchi

Pricing financial or real options with arbitrary payoffs in regime-switching models is an important problem in finance. Mathematically, it is to solve, under certain standard assumptions, a general form of optimal stopping problems in…

Mathematical Finance · Quantitative Finance 2018-09-11 Masahiko Egami , Rusudan Kevkhishvili

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…

Mathematical Finance · Quantitative Finance 2022-12-27 Libo Li , Ruyi Liu , Marek Rutkowski

Priced timed games are two-player zero-sum games played on priced timed automata (whose locations and transitions are labeled by weights modeling the costs of spending time in a state and executing an action, respectively). The goals of the…

Computer Science and Game Theory · Computer Science 2017-04-05 Thomas Brihaye , Gilles Geeraerts , Axel Haddad , Engel Lefaucheux , Benjamin Monmege

We design and analyze minimax-optimal algorithms for online linear optimization games where the player's choice is unconstrained. The player strives to minimize regret, the difference between his loss and the loss of a post-hoc benchmark…

Machine Learning · Computer Science 2013-02-12 H. Brendan McMahan

We study a random game in which two players in turn play a fixed number of moves. For each move, there are two possible choices. To each possible outcome of the game we assign a winner in an i.i.d. fashion with a fixed parameter p. In the…

Probability · Mathematics 2024-09-05 Natalia Cardona-Tobón , Anja Sturm , Jan M. Swart

We study the classic divide-and-choose method for equitably allocating divisible goods between two players who are rational, self-interested Bayesian agents. The players have additive values for the goods. The prior distributions on those…

Computer Science and Game Theory · Computer Science 2024-10-22 Jamie Tucker-Foltz , Richard Zeckhauser

We prove the existence and computability of optimal strategies in weighted limit games, zero-sum infinite-duration games with a B\"uchi-style winning condition requiring to produce infinitely many play prefixes that satisfy a given regular…

Computer Science and Game Theory · Computer Science 2020-09-08 Aniello Murano , Sasha Rubin , Martin Zimmermann

In this paper we introduce a deep learning method for pricing and hedging American-style options. It first computes a candidate optimal stopping policy. From there it derives a lower bound for the price. Then it calculates an upper bound, a…

Computational Finance · Quantitative Finance 2021-03-23 Sebastian Becker , Patrick Cheridito , Arnulf Jentzen

We consider an investment problem in which an investor performs capital injections to increase the liquidity of a firm for it to maximise profit from market operations. Each time the investor performs an injection, the investor incurs a…

Optimization and Control · Mathematics 2019-10-04 David Mguni

Consider a game consisting of independent turns with even money payoffs in which the player wins with a fixed probability $p \geq 1/3$ and loses with probability $1 - p$. The Labouchere system is a betting strategy which entails keeping a…

Probability · Mathematics 2018-08-29 Nina Zubrilina

Suppose one buys two very similar stocks and is curious about how much, after some time T, one of them will contribute to the overall asset, expecting, of course, that it should be around 1/2 of the sum. Here we examine this question within…

Statistical Finance · Quantitative Finance 2011-05-31 Gleb Oshanin , Gregory Schehr

A double auction game with an infinite number of buyers and sellers is introduced. All sellers posses one unit of a good, all buyers desire to buy one unit. Each seller and each buyer has a private valuation of the good. The distribution of…

Computer Science and Game Theory · Computer Science 2012-10-23 Matthijs Ruijgrok

We prove the existence and computability of optimal strategies in weighted limit games, zero-sum infinite-duration games with a B\"uchi-style winning condition requiring to produce infinitely many play prefixes that satisfy a given regular…

Computer Science and Game Theory · Computer Science 2020-09-25 Aniello Murano , Sasha Rubin , Martin Zimmermann

We consider the maximization of the long-term growth rate in the Black-Scholes model under proportional transaction costs as in Taksar, Klass and Assaf [Math. Oper. Res. 13, 1988]. Similarly as in Kallsen and Muhle-Karbe [Ann. Appl.…

Portfolio Management · Quantitative Finance 2010-10-12 Stefan Gerhold , Johannes Muhle-Karbe , Walter Schachermayer

In this paper, we combine modern portfolio theory and option pricing theory so that a trader who takes a position in a European option contract and the underlying assets can construct an optimal portfolio such that at the moment of the…

Mathematical Finance · Quantitative Finance 2020-01-06 Abootaleb Shirvani , Frank J. Fabozzi , Stoyan V. Stoyanov

Sponsored search is an important monetization channel for search engines, in which an auction mechanism is used to select the ads shown to users and determine the prices charged from advertisers. There have been several pieces of work in…

Computer Science and Game Theory · Computer Science 2014-06-05 Di He , Wei Chen , Liwei Wang , Tie-Yan Liu

We study the complexity of solving two-player infinite duration games played on a fixed finite graph, where the control of a node is not predetermined but rather assigned randomly. In classic random-turn games, control of each node is…

Computer Science and Game Theory · Computer Science 2026-01-13 Sarvin Bahmani , Rasmus Ibsen-Jensen , Soumyajit Paul , Sven Schewe , Friedrich Slivovsky , Qiyi Tang , Dominik Wojtczak , Shufang Zhu

The problem of stock hedging is reconsidered in this paper, where a put option is chosen from a set of available put options to hedge the market risk of a stock. A formula is proposed to determine the probability that the potential loss…

Risk Management · Quantitative Finance 2011-10-04 Guanghui Huang , Jing Xu , Wenting Xing
‹ Prev 1 4 5 6 7 8 10 Next ›