Related papers: A Variant on the Feline Josephus Problem
Given a finite abelian group $G$, consider the complete graph on the set of all elements of $G$. Find a Hamiltonian cycle in this graph and for each pair of consecutive vertices along the cycle compute their sum. What are the smallest and…
Picture countably many logicians all wearing a hat in one of $\kappa$-many colours. They each get to look at finitely many other hats and afterwards make finitely many guesses for their own hat's colour. For which $\kappa$ can the logicians…
Light-like galileon solutions have been used to investigate the chronology problem in galileon-like theories, and in some cases may also be considered as solitons, evading a non-existence constraint from a zero-mode argument. Their…
Plateau's problem is not a single conjecture or theorem, but rather an abstract framework, encompassing a number of different problems in several related areas of mathematics. In its most general form, Plateau's problem is to find an…
An alternative form of Fermats equation[1] is proposed. It represents a portion of the identity that includes three terms of Fermats original equation. This alternative form permits an elementary and compact proof of the first case of…
We present a new O(k log n) algorithm of the Josephus problem. The time complexity of our algorithm is O(k log n), and this time complexity is on a par with the existing O(k log n) algorithm. We do not have any recursion overhead or stack…
There are many papers written on the Two Envelopes Problem that usually study some of its variations. In this paper we will study and compare the most significant variations of the problem. We will see the correct decisions for each player…
The concept of sequential choice functions is introduced and studied. This concept applies to the reduction of the problem of stable matchings with sequential workers to a situation where the workers are linear.
In the marriage problem, a variant of the bi-parted matching problem, each member has a `wish-list' expressing his/her preference for all possible partners; this list consists of random, positive real numbers drawn from a certain…
This paper is concerned with the study of a model case of first order Hamilton-Jacobi equations posed on a "junction", that is to say the union of a finite number of half-lines with a unique common point. The main result is a comparison…
Partially observable stochastic games provide a rich mathematical paradigm for modeling multi-agent dynamic decision making under uncertainty and partial information. However, they generally do not admit closed-form solutions and are…
We present a new variant of the secretary problem. Let $A$ be a totally ordered set of $n$ \emph{applicants}. Given $P\subseteq A$ and $x\in A$, let $rr(P,x)=\vert\{z\in P \mid z\leq x\}\vert\mbox{ }$ be the \emph{relative rank of} $x$…
We discuss some stability problems when each agent of a linear flock on the line interacts with its two nearest neighbors (one on either side).
A new evolutionary solution to Prisoner Dilemma situations is proposed in this paper. A specific genetic code may have different phenotypes, meaning different strategies for different individuals carrying that gene. This means that, under…
We consider a bilevel optimization problem in which the ground set is partitioned between two decision makers, a leader and a follower, whose optimization problems are interleaved. We study the Bilevel Independent Set problem, and its…
The aim of this paper is to solve the "gift exchange" problem: you are one of n players, and there are n wrapped gifts on display; when your turn comes, you can either choose any of the remaining wrapped gifts, or you can "steal" a gift…
The Deviants' Dilemma is a two-person game with the individual gain conflicting with the choice for global good. Evolutionary considerations yield fixed point attractors, with the phenomena of exclusion potentially playing an important role…
This paper investigates obstacle-free simple motion pursuit-evasion problems where the pursuer is faster and game termination is point capture. It is well known that the interior of the Apollonius Circle (AC) is the evader's dominance…
"Zombies and Survivor" is a variant of the well-studied game of "Cops and Robber" where the zombies (cops) can only move closer to the survivor (robber). We consider the deterministic version of the game where a zombie can choose their path…
On computers, discrete problems are solved instead of continuous ones. One must be sure that the solutions of the former problems, obtained in real time (i.e., when the stepsize h is not infinitesimal) are good approximations of the…