English
Related papers

Related papers: Aspects of Muchnik's paradox in restricted betting

200 papers

We consider subsets of the (symbolic) sequence space that are invariant under the action of the semigroup of multiplicative integers. A representative example is the collection of all 0-1 sequences $(x_k)$ such that $x_k x_{2k}=0$ for all…

Dynamical Systems · Mathematics 2018-02-08 Richard Kenyon , Yuval Peres , Boris Solomyak

The recently discovered Parrondo's paradox claims that two losing games can result, under random or periodic alternation of their dynamics, in a winning game: "losing+losing=winning". In this paper we follow Parrondo's philosophy of…

Chaotic Dynamics · Physics 2009-11-10 J. Almeida , D. Peralta-Salas , M. Romera

Two losing gambling games, when alternated in a periodic or random fashion, can produce a winning game. This paradox has been inspired by certain physical systems capable of rectifying fluctuations: the so-called Brownian ratchets. In this…

Physics and Society · Physics 2014-10-03 J. M. R. Parrondo , L. Dinis

We analyze the susceptibility of instant runoff voting (IRV) to a lesser-studied paradox known as a \emph{reinforcement paradox}, which occurs when candidate $X$ wins under IRV in two distinct elections but $X$ loses in the combined…

Physics and Society · Physics 2026-04-20 David McCune , Jennifer Wilson

A real \alpha is called recursively enumerable ("r.e." for short) if there exists a computable, increasing sequence of rationals which converges to \alpha. It is known that the randomness of an r.e. real \alpha can be characterized in…

Computational Complexity · Computer Science 2015-05-13 Kohtaro Tadaki

Imitation sometimes achieves success in multi-agent situations even though it is very simple. In game theory, success of imitation has been characterized by unbeatability against other agents. Previous studies specified conditions under…

Physics and Society · Physics 2025-07-23 Masahiko Ueda

We give elementary examples within a framework for studying decisions under uncertainty where probabilities are only roughly known. The framework, in gambling terms, is that the size of a bet is proportional to the gambler's perceived…

Probability · Mathematics 2023-12-19 David J. Aldous , F. Thomas Bruss

Two-player (antagonistic) games on (possibly stochastic) graphs are a prevalent model in theoretical computer science, notably as a framework for reactive synthesis. Optimal strategies may require randomisation when dealing with inherently…

Computer Science and Game Theory · Computer Science 2024-11-25 James C. A. Main , Mickael Randour

I'll discuss how Goedel's paradox "This statement is false/unprovable" yields his famous result on the limits of axiomatic reasoning. I'll contrast that with my work, which is based on the paradox of "The first uninteresting positive whole…

History and Overview · Mathematics 2007-05-23 G. J. Chaitin

Parrondo's paradox is a well-known counterintuitive phenomenon, where the combination of unfavorable situations can establish favorable ones. In this paper, we study one-dimensional discrete-time quantum walks, manipulating two different…

Quantum Physics · Physics 2022-08-02 Munsif Jan , Niaz Ali Khan , Gao Xianlong

We consider billiard systems within compact domains bounded by confocal conics on a hyperboloid of one sheet in the Minkowski space. We derive conditions for elliptic periodicity for such billiards. We describe the topology of those…

Dynamical Systems · Mathematics 2021-08-31 Vladimir Dragovic , Sean Gasiorek , Milena Radnovic

The solution of parity games over pushdown graphs (Walukiewicz '96) was the first step towards an effective theory of infinite-state games. It was shown that winning strategies for pushdown games can be implemented again as pushdown…

Computer Science and Game Theory · Computer Science 2010-06-09 Wladimir Fridman

We study the problem of computing an $\epsilon$-Nash equilibrium in repeated games. Earlier work by Borgs et al. [2010] suggests that this problem is intractable. We show that if we make a slight change to their model---modeling the players…

Computer Science and Game Theory · Computer Science 2015-03-24 Joseph Y. Halpern , Rafael Pass , Lior Seeman

We reformulate the notion of uncertainty of pairs of unitary operators within the context of guessing games and derive an entropic uncertainty relation for a pair of such operators. We show how distinguishable operators are compatible while…

Quantum Physics · Physics 2023-06-05 Jesni Shamsul Shaari , Rinie N. M. Nasir , Stefano Mancini

Whether Kolmogorov-Loveland randomness (KLR) is the same as Martin-L\"of randomness (MLR) is a major open problem in the study of algorithmic randomness. More general classes of betting strategies than Kolmogorov-Loveland ones have been…

Information Theory · Computer Science 2025-03-06 Tomislav Petrović

Parrondo's paradox is extended to regime switching random walks in random environments. The paradoxical behavior of the resulting random walk is explained by the effect of the random environment. Full characterization of the asymptotic…

Probability · Mathematics 2017-06-02 Bruno Rémillard , Jean Vaillancourt

Von Neumann's Min-Max Theorem guarantees that each player of a zero-sum matrix game has an optimal mixed strategy. This paper gives an elementary proof that each player has a near-optimal mixed strategy that chooses uniformly at random from…

Computational Complexity · Computer Science 2015-06-02 Richard Lipton , Neal E. Young

Equilibrium in Economics has been seldom addressed in a situation where some variables are discrete. This work introduces a problem related to lot-sizing with several players, and analyses some strategies which are likely to be found in…

Computer Science and Game Theory · Computer Science 2016-04-28 João Pedro Pedroso , Yves Smeers

We develop a probabilistic approach to study the volumetric and geometric properties of unit balls $\mathbb B_{q,1}^n$ of finite-dimensional Lorentz sequences spaces $\ell_{q,1}^n$. More precisely, we show that the empirical distribution of…

Functional Analysis · Mathematics 2024-09-23 Zakhar Kabluchko , Joscha Prochno , Mathias Sonnleitner

This paper examines games with strategic complements or substitutes and incomplete information, where players are uncertain about the opponents' parameters. We assume that the players' beliefs about the opponent's parameters are selected…

Theoretical Economics · Economics 2025-01-28 Joep van Sloun
‹ Prev 1 8 9 10 Next ›