English
Related papers

Related papers: Generalized Gambler's Ruin Problem: explicit formu…

200 papers

This note is a complement to the paper by Eberlein, Kabanov, and Schmidt on the asymptotic of the ruin probability in a Sparre Andersen non-life insurance model with investments a risky asset whose price follows a geometric L\'evy process.…

Probability · Mathematics 2026-04-08 Yuri Kabanov , Platon Promyslov

Pseudo-games are a natural and well-known generalization of normal-form games, in which the actions taken by each player affect not only the other players' payoffs, as in games, but also the other players' strategy sets. The solution…

Computer Science and Game Theory · Computer Science 2022-10-20 Denizalp Goktas , Amy Greenwald

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…

Computer Science and Game Theory · Computer Science 2025-01-14 Alankrita Bhatt , Or Ordentlich , Oron Sabag

In adversarial interactions, one is often required to make strategic decisions over multiple periods of time, wherein decisions made earlier impact a player's competitive standing as well as how choices are made in later stages. In this…

Computer Science and Game Theory · Computer Science 2022-09-14 Rahul Chandan , Keith Paarporn , Mahnoosh Alizadeh , Jason R. Marden

Most work in game theory assumes that players are perfect reasoners and have common knowledge of all significant aspects of the game. In earlier work, we proposed a framework for representing and analyzing games with possibly unaware…

Computer Science and Game Theory · Computer Science 2007-07-17 Leandro C. Rego , Joseph Y. Halpern

This paper investigates the performance of different general-game-playing heuristics for games in the Ludii general game system. Based on these results, we train several regression learning models to predict the performance of these…

Artificial Intelligence · Computer Science 2021-07-06 Matthew Stephenson , Dennis J. N. J. Soemers , Eric Piette , Cameron Browne

Resource allocation problems across multiple contests are ubiquitous in adversarial settings, from military operations to market competition. While Colonel Blotto and General Lotto games have provided valuable theoretical foundations for…

Computer Science and Game Theory · Computer Science 2026-04-09 Keith Paarporn , Jason R. Marden

The study deals with the ruin problem when an insurance company invests its reserve in a risky asset whose the price dynamics is given by a geometric L\'evy process. Considering the ruin probability as a of the capital reserve we obtain for…

Probability · Mathematics 2024-01-10 Viktor Antipov , Yuri Kabanov

Public goods games in undirected networks are generally known to have pure Nash equilibria, which are easy to find. In contrast, we prove that, in directed networks, a broad range of public goods games have intractable equilibrium problems:…

Computer Science and Game Theory · Computer Science 2021-07-15 Christos Papadimitriou , Binghui Peng

We study a dynamic model of a non-life insurance portfolio. The foundation of the model is a compound Poisson process that represents the claims side of the insurer. To introduce clusters of claims appearing, e.g. with catastrophic events,…

Risk Management · Quantitative Finance 2026-03-03 Jonathan Klinge , Maren Diane Schmeck

This paper derives the asymptotic behavior of the following ruin probability $$P\{\exists t \in G(\delta):B_H(t)-c_1t>q_1u,B_H(t)-c_2t>q_2u\}, \ \ \ u \rightarrow \infty,$$ where $B_H$ is a standard fractional Brownian motion,…

Probability · Mathematics 2020-02-13 Grigori Jasnovidov

We consider multiplayer stochastic games in which the payoff of each player is a bounded and Borel-measurable function of the infinite play. By using a generalization of the technique of Martin (1998) and Maitra and Sudderth (1998), we show…

Optimization and Control · Mathematics 2022-08-26 János Flesch , Eilon Solan

Simple stochastic games are turn-based 2.5-player games with a reachability objective. The basic question asks whether one player can ensure reaching a given target with at least a given probability. A natural extension is games with a…

Computer Science and Game Theory · Computer Science 2021-02-02 Pranav Ashok , Krishnendu Chatterjee , Jan Kretinsky , Maximilian Weininger , Tobias Winkler

We study the asymptotics of the ruin probability in the Cram\'er-Lundberg model with a modified notion of ruin. The modification is as follows. If the portfolio becomes negative, the asset is not immediately declared ruined but may survive…

Probability · Mathematics 2019-04-26 Frank Aurzada , Micha Buck

In this paper, we settle the sampling complexity of solving discounted two-player turn-based zero-sum stochastic games up to polylogarithmic factors. Given a stochastic game with discount factor $\gamma\in(0,1)$ we provide an algorithm that…

Machine Learning · Computer Science 2019-08-30 Aaron Sidford , Mengdi Wang , Lin F. Yang , Yinyu Ye

We consider the problem of computing a mixed-strategy generalized Nash equilibrium (MS-GNE) for a class of games where each agent has both continuous and integer decision variables. Specifically, we propose a novel Bregman…

Optimization and Control · Mathematics 2022-06-14 Wicak Ananduta , Sergio Grammatico

For the iterated Prisoner's Dilemma, there exist Markov strategies which solve the problem when we restrict attention to the long term average payoff. When used by both players these assure the cooperative payoff for each of them. Neither…

Dynamical Systems · Mathematics 2017-04-27 Ethan Akin

For a bivariate \Levy process $(\xi_t,\eta_t)_{t\ge 0}$ and initial value $V_0$ define the Generalised Ornstein-Uhlenbeck (GOU) process \[ V_t:=e^{\xi_t}\Big(V_0+\int_0^t e^{-\xi_{s-}}\ud \eta_s\Big),\quad t\ge0,\] and the associated…

Probability · Mathematics 2011-01-06 Damien Bankowski , Claudia Klüppelberg , Ross Maller

Domain generalization (DG) tends to alleviate the poor generalization capability of deep neural networks by learning model with multiple source domains. A classical solution to DG is domain augmentation, the common belief of which is that…

Computer Vision and Pattern Recognition · Computer Science 2023-03-24 Fangrui Lv , Jian Liang , Shuang Li , Jinming Zhang , Di Liu

We investigate the asymptotic of ruin probabilities when the company combines the life- and non-life insurance businesses and invests its reserve into a risky asset with stochastic volatility and drift driven by a two-state Markov process.…

Probability · Mathematics 2020-12-10 Anastasiya Ellanskaya , Yuri Kabanov
‹ Prev 1 8 9 10 Next ›