Related papers: A note on the Screaming Toes game
In this paper I study the natural selection between two games to determine, which game will dominate in the community as a result of natural selection. The formalization of this question in the form of a parametrized game and the…
We say that two permutations $[n]\to [n]$ intersect if they map some element $x$ to the same element $y$. A matching in a family of permutations is a collection of pairwise disjoint permutations. In this paper, we study families of…
The Parrondo game, devised by Parrondo, means that winning strategy is constructed a combination of losing strategy. This situation is called the Parrondo paradox. The Parrondo game based on quantum walk and the search algorithm via quantum…
Matching games naturally generalize assignment games, a well-known class of cooperative games. Interest in matching games has grown recently due to some breakthrough results and new applications. This state-of-the-art survey provides an…
The origin of the phenomenological deterministic laws that approximately govern the quasiclassical domain of familiar experience is considered in the context of the quantum mechanics of closed systems such as the universe as a whole. We…
Text editing, such as grammatical error correction, arises naturally from imperfect textual data. Recent works frame text editing as a multi-round sequence tagging task, where operations -- such as insertion and substitution -- are…
In late May of 2014 I received an email from a colleague introducing to me a non-transitive game developed by Walter Penney. This paper explores this probability game from the perspective of a coin tossing game, and further discusses some…
Classical chaotic systems are distinguished by their sensitive dependence on initial conditions. The absence of this property in quantum systems has lead to a number of proposals for perturbation-based characterizations of quantum chaos,…
We demonstrate the presence of chaos in stochastic simulations that are widely used to study biodiversity in nature. The investigation deals with a set of three distinct species that evolve according to the standard rules of mobility,…
This paper presents an algorithmic method to study structural properties of nonlinear control systems in dependence of parameters. The result consists of a description of parameter configurations which cause different control-theoretic…
We consider uniform random permutations drawn from a family enumerated through generating trees. We develop a new general technique to establish a central limit theorem for the number of consecutive occurrences of a fixed pattern in such…
Color coding is an algorithmic technique used in parameterized complexity theory to detect "small" structures inside graphs. The idea is to derandomize algorithms that first randomly color a graph and then search for an easily-detectable,…
Random matrix theory is used to represent generic loss of coherence of a fixed central system coupled to a quantum-chaotic environment, represented by a random matrix ensemble, via random interactions. We study the average density matrix…
Real-world processes often exhibit temporal separation between actions and reactions - a characteristic frequently ignored in many modelling frameworks. Adding temporal aspects, like time delays, introduces a higher complexity of problems…
We give a general method for constructing a deterministic strategy of Reality from a randomized strategy in game-theoretic probability. The construction can be seen as derandomization in game-theoretic probability.
We develop a general theory of "bisets": sets with two commuting group actions. They naturally encode topological correspondences. Just as van Kampen's theorem decomposes into a graph of groups the fundamental group of a space given with a…
We consider a family of distributions on which natural tail orders can be constructed upon a representation of a distribution by a (single) hyper-real number. Past research revealed that the ordering can herein strongly depend on the…
Random walk kernels have been introduced in seminal work on graph learning and were later largely superseded by kernels based on the Weisfeiler-Leman test for graph isomorphism. We give a unified view on both classes of graph kernels. We…
We study the convergence properties of a pair of learning algorithms (learning with and without memory). This leads us to study the dominant eigenvalue of a class of random matrices. This turns out to be related to the roots of the…
An experimental analysis of the asynchronous version of the "Game of Life" is performed to estimate how topology perturbations modify its evolution. We focus on the study of a phase transition from an "inactive-sparse phase" to a "labyrinth…