Related papers: A Variant on the Feline Josephus Problem

We study a modified prisoner's dilemma game taking place on two-dimensional disordered square lattices. The players are pure strategists and can either cooperate or defect with their immediate neighbors. In the generations each player…

In this paper, we investigate the problem of separating a set $X$ of points in $\mathbb{R}^{2}$ with an arrangement of $K$ lines such that each cell contains an asymptotically equal number of points (up to a constant ratio). We consider a…

A particular case of the Jacobian conjecture is considered and for small dimensional cases a computational approach is offered

This paper presents a new approach to determine the number of solutions of three variable Frobenius related problems and to find their solutions by using order reducing methods. Here, the order of a Frobenius related problem means the…

We study a variant of the classical Wythoff's game. The classical form is played with two piles of stones, from which two players take turns to remove stones from one or both piles. When removing stones from both piles, an equal number must…

The angel-devil game is played on an infinite two-dimensional ``chessboard''. The squares of the board are all white at the beginning. The players called angel and devil take turns in their steps. When it is the devil's turn, he can turn a…

The problems of enumerating lattice walks, with an arbitrary finite set of allowed steps, both in one and two dimensions, where one must always stay in the non-negative half-line and quarter-plane respectively, are used, as case studies, to…

The solution of Apollonius' problem on constructing a circle (line), tangent to three given circles (lines), is presented in terms of oriented circles and inversive invariants. Tangency is understood as the coincidence of tangent vectors at…

In this paper the fractional order logistic map in the sense of Caputo's fractional differences is numerically approached. It is shown that the necessary iterations number to avoid transients must be of order of thousand, not of order of…

The case of the classical Hill problem is numerically investigated by performing a thorough and systematic classification of the initial conditions of the orbits. More precisely, the initial conditions of the orbits are classified into four…

This paper presents research comparing the effects of different environments on the outcome of an extended Prisoner's Dilemma, in which agents have the option to abstain from playing the game. We consider three different pure strategies:…

We investigate the hardness of establishing as many stable marriages (that is, marriages that last forever) in a population whose memory is placed in some arbitrary state with respect to the considered problem, and where traitors try to…

In classical works on a planar differential pursuit-evasion game with a faster pursuer, the intercept point resulting from the equilibrium strategies lies on the Apollonius circle. This property was exploited for the construction of the…

We consider two variations of the classical secretary problem. * A variation of the returning secretary problem where each interviewee may appear a second time with a fixed probability p. The decision-maker observes interviewees…

Here we present a new approach to deal with first order ordinary differential equations (1ODEs), presenting functions. This method is an alternative to the one we have presented in [1]. In [2], we have establish the theoretical background…

We consider transient nearest neighbor random walks on the positive part of the real line. We give criteria for the finiteness of the number of cutpoints and strong cutpoints. Examples and open problems are presented.

In this paper the chaos persistence in a class of discontinuous dynamical systems of fractional-order is analyzed. To that end, the Initial Value Problem is first transformed, by using the Filippov regularization [1], into a set-valued…

The motion of pedestrian crowds (e.g. for simulation of an evacuation situation) can be modeled as a multi-body system of self driven particles with repulsive interaction. We use a few simple situations to determine the simplest allowed…

We introduce a variant of the watchman route problem, which we call the quickest pair-visibility problem. Given two persons standing at points $s$ and $t$ in a simple polygon $P$ with no holes, we want to minimize the distance they travel…

We study cut elimination for a multifocused variant of full linear logic in the sequent calculus. The multifocused normal form of proofs yields problems that do not appear in a standard focused system, related to the constraints in grouping…