English
Related papers

Related papers: Trapping the Ultimate Success

200 papers

Based on Brownian ratchets, a counter-intuitive phenomenon has recently emerged -- namely, that two losing games can yield, when combined, a paradoxical tendency to win. A restriction of this phenomenon is that the rules depend on the…

Statistical Mechanics · Physics 2009-10-31 Juan M. R. Parrondo , Gregory P. Harmer , Derek Abbott

We consider a specialized form of risk management for betting opportunities with low payout frequency, presented in particular for exotic horse race wagering. An optimization problem is developed which limits losing streaks with high…

Optimization and Control · Mathematics 2017-08-03 Antoine Deza , Kai Huang , Michael R. Metel

This paper considers the problem of constructing a confidence sequence, which is a sequence of confidence intervals that hold uniformly over time, for estimating the mean of bounded real-valued random processes. This paper revisits the…

Probability · Mathematics 2024-08-27 J. Jon Ryu , Alankrita Bhatt

It is shown in recent studies that in a Stackelberg game the follower can manipulate the leader by deviating from their true best-response behavior. Such manipulations are computationally tractable and can be highly beneficial for the…

Computer Science and Game Theory · Computer Science 2023-02-28 Yurong Chen , Xiaotie Deng , Jiarui Gan , Yuhao Li

Parrondo's paradox arises in sequences of games in which a winning expectation may be obtained by playing the games in a random order, even though each game in the sequence may be lost when played individually. We present a suitable version…

Probability · Mathematics 2007-06-19 Antonio Di Crescenzo

We develop a theory for solving continuous time optimal stopping problems for non-linear expectations. Our motivation is to consider problems in which the stopper uses risk measures to evaluate future rewards.

Optimization and Control · Mathematics 2011-01-11 Erhan Bayraktar , Song Yao

Combinatorial games lead to several interesting, clean problems in algorithms and complexity theory, many of which remain open. The purpose of this paper is to provide an overview of the area to encourage further research. In particular, we…

Computational Complexity · Computer Science 2009-09-25 Erik D. Demaine , Robert A. Hearn

There are $n$ independent Bernoulli random variables with parameters $p_i$ that are observed sequentially. Two players, A and B, act in turns starting with player A. Each player has the possibility on his turn, when $I_k=1$, to choose…

Probability · Mathematics 2019-01-15 José María Grau Ribas

Stackelberg games (SGs) constitute the most fundamental and acclaimed models of strategic interactions involving some form of commitment. Moreover, they form the basis of more elaborate models of this kind, such as, e.g., Bayesian…

Computer Science and Game Theory · Computer Science 2024-05-14 Francesco Bacchiocchi , Matteo Bollini , Matteo Castiglioni , Alberto Marchesi , Nicola Gatti

We study a Stackelberg variant of the classical discrete-time Dynkin game, in which Player 1 (the leader) commits to a stopping strategy first and Player 2 (the follower) responds optimally. This leader-follower structure induces an optimal…

Optimization and Control · Mathematics 2026-05-26 Jingjie Zhang , Zhou Zhou

We introduce a new non-zero-sum game of optimal stopping with asymmetric exercise opportunities. Given a stochastic process modelling the value of an asset, one player observes and can act on the process continuously, while the other player…

Probability · Mathematics 2024-05-16 José Luis Pérez , Neofytos Rodosthenous , Kazutoshi Yamazaki

In this paper we introduce polytopal stochastic games, an extension of two-player, zero-sum, turn-based stochastic games, in which we may have uncertainty over the transition probabilities. In these games the uncertainty over the…

Logic in Computer Science · Computer Science 2025-02-26 Pablo F. Castro , Pedro D'Argenio

This paper introduces the new concept of (follower) satisfaction in Stackelberg games and compares the standard Stackelberg game with its satisfaction version. Simulation results are presented which suggest that the follower adopting…

Computer Science and Game Theory · Computer Science 2024-08-22 Langford White , Duong Nguyen , Hung Nguyen

This paper revisits a classical problem of slotted multiple access with success, idle, and collision events on each slot. First, results of a 2-user multiple access game are reported. The game was conducted at the University of Southern…

Computer Science and Game Theory · Computer Science 2021-12-24 Michael J. Neely

The Labouchere gambling system is hypothesized to increase the probability of winning a predetermined arbitrary profit in a gambling system such as a coin flip or a roulette game in which both payouts and odds are 1:1. However, use of the…

General Finance · Quantitative Finance 2017-07-04 Jake Billings , Sebastian Del Barco

This paper focuses on "tracing player knowledge" in educational games. Specifically, given a set of concepts or skills required to master a game, the goal is to estimate the likelihood with which the current player has mastery of each of…

Artificial Intelligence · Computer Science 2019-08-16 Pavan Kantharaju , Katelyn Alderfer , Jichen Zhu , Bruce Char , Brian Smith , Santiago Ontañón

In a multi-follower Bayesian Stackelberg game, a leader plays a mixed strategy over $L$ actions to which $n\ge 1$ followers, each having one of $K$ possible private types, best respond. The leader's optimal strategy depends on the…

Computer Science and Game Theory · Computer Science 2026-03-03 Gerson Personnat , Tao Lin , Safwan Hossain , David C. Parkes

In this paper, we consider a discrete-time stochastic Stackelberg game with a single leader and multiple followers. Both the followers and the leader together have conditionally independent private types, conditioned on action and previous…

Optimization and Control · Mathematics 2022-09-21 Deepanshu Vasal

"Guess Who?" is a popular two player game where players ask "Yes"/"No" questions to search for their opponent's secret identity from a pool of possible candidates. This is modeled as a simple stochastic game. Using this model, the optimal…

Probability · Mathematics 2025-11-24 Mihai Nica

The laws of chance are often subtle and deceptive. This is why games of chance work. People are convinced that they obey seemingly intuitive laws, while the underlying mathematical structure reveals a different and more complex reality.…

History and Overview · Mathematics 2023-09-06 Paolo Bartesaghi
‹ Prev 1 4 5 6 7 8 10 Next ›