Related papers: Evasion numbers via zero-prediction
While classical concentration inequalities are typically restricted to two special cases -- independence and martingale difference sequences -- we extend concentration inequalities to a much broader class of stochastic processes by relaxing…
A random walk-like model is considered to discuss statistical aspects of tournaments. The model is applied to soccer leagues with emphasis on the scores. This competitive system was computationally simulated and the results are compared…
This paper is about a set-based computing method for solving a general class of two-player zero-sum Stackelberg differential games. We assume that the game is modeled by a set of coupled nonlinear differential equations, which can be…
Computing stable partitions in hedonic games is a challenging task because there exist games in which stable outcomes do not exist. Even more, these No-instances can often be leveraged to prove computational hardness results. We make this…
We investigate a family of relational systems arising from interval partitions of $\omega$, inspired by Vojt\'a\v{s}'s characterization of the bounding and dominating numbers. By varying the underlying asymptotic quantifiers and interval…
Impartial subtraction games on the nonnegative integers have been studied by many and discussed in detail in for example the remarkable work Winning Ways by Conway, Berlekamp and Guy. We describe how comply variations of these games,…
We study the behavior of a stochastic variant of replicator dynamics in two-agent zero-sum games. We characterize the statistics of such systems by their invariant measures which can be shown to be entirely supported on the boundary of the…
This paper provides a decomposition technique for the purpose of simplifying the solution of certain zero-sum differential games. The games considered terminate when the state reaches a target, which can be expressed as the union of a…
Pursuit and evasion conflicts represent challenging problems with important applications in aerospace and robotics. In pursuit-evasion problems, synthesis of intelligent actions must consider the adversary's potential strategies.…
We consider a zero-sum stochastic differential game over elementary mixed feed-back strategies. These are strategies based only on the knowledge of the past state, randomized continuously in time from a sampling distribution which is kept…
This paper investigates first-order game logic and first-order modal mu-calculus, which extend their propositional modal logic counterparts with first-order modalities of interpreted effects such as variable assignments. Unlike in the…
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…
The paper is concerned with a zero-sum continuous-time stochastic differential game with a dynamics controlled by a Markov process and a terminal payoff. The value function of the original game is estimated using the value function of a…
In this paper we study the zero-sum and nonzero-sum differential games with not assuming Isaacs condition. Along with the partition $\pi$ of the time interval $[0,T]$, we choose the suitable random non-anticipative strategy with delay to…
An $n$-player game $X$ in normal form can be modeled via undirected discrete graphical models where the discrete random variables represent the players and their state spaces are the set of pure strategies. There exists an edge between the…
In this paper, we address the problem of testing exchangeability of a sequence of random variables, $X_1, X_2,\cdots$. This problem has been studied under the recently popular framework of testing by betting. But the mapping of testing…
The game dynamical equations are derived from Boltzmann-like equations for individual pair interactions by assuming a certain kind of imitation behavior, the so-called proportional imitation rule. They can be extended to a stochastic…
We argue that fractional order (FO) differential equations are more suitable to model complex adaptive systems (CAS). Hence they are applied in replicator equations for non-cooperative game. Rock-Scissors-Paper game is discussed. It is…
Conventional noncooperative game theory hypothesizes that the joint strategy of a set of players in a game must satisfy an "equilibrium concept". All other joint strategies are considered impossible; the only issue is what equilibrium…
We investigate a variety of cut and choose games, their relationship with (generic) large cardinals, and show that they can be used to characterize a number of properties of ideals and of partial orders: certain notions of distributivity,…