Related papers: Stable Fixed Points of Card Trick Functions
We consider a problem of shuffling a deck of cards with ordered labels. Namely we split the deck of N=k^tq cards (where t>=1 is maximal) into k equally sized stacks and then take the top card off of each stack and sort them by the order of…
Gale and Shapley introduced a matching problem between two sets of agents where each agent on one side has an exogenous preference ordering over the agents on the other side. They defined a matching as stable if no unmatched pair can both…
We introduce a two-player game involving two tokens located at points of a fixed set. The players take turns to move a token to an unoccupied point in such a way that the distance between the two tokens is decreased. Optimal strategies for…
Fixed point results with respect to generalized rational contractive mappings in semi-metric spaces endowed with a directed graph are proved. Some examples are provided to illustrate the results. The obtained results extend, improve and…
The strategies adopted by individuals to select relevant information to pass on are central to understanding problem solving by groups. Here we use agent-based simulations to revisit a cooperative problem-solving scenario where the task is…
Mechanical shufflers used in many casinos employ a card shuffling scheme called \emph{shelf shuffling}. In a single-shelf shuffling, cards arrive sequentially, and each incoming card is independently placed on the top or the bottom of a…
Consider an n by n array of cards shuffled in the following manner. An element x of the array is chosen uniformly at random; Then with probability 1/2 the rectangle of cards above and to the left of x is rotated 180 degrees, and with…
Motivated by understanding non-strict and strict pure strategy equilibria in network anti-coordination games, we define notions of stable and, respectively, strictly stable colorings in graphs. We characterize the cases when such colorings…
In two-player games on graphs, the players move a token through a graph to produce an infinite path, which determines the winner of the game. Such games are central in formal methods since they model the interaction between a…
This paper studies the stabilization for a kind of linear and impulse control systems in finite-dimensional spaces, where impulse instants appear periodically. We present several characterizations on the stabilization; show how to design…
We derive a sufficient condition for stability in probability of an equilibrium of a randomly perturbed map in ${\mathbb R}^d$. This condition can be used to stabilize weakly unstable equilibria by random forcing. Analytical results on…
The aim of this paper is to give strict fixed point principles for multivalued operators $T:X\rightarrow P(X)$ satisfying some contraction conditions of \'Ciri\' c and of \'Ciri\' c-Reich-Rus type. We are interested, under which conditions,…
Consider a discrete-time linear time-invariant descriptor system $Ex(k+1)=Ax(k)$ for $k \in \mathbb Z_{+}$. In this paper, we tackle for the first time the problem of stabilizing such systems by computing a nearby regular index one stable…
The game "Spot It!" is played with a deck of cards in which every pair of cards has exactly one matching symbol and the aim is to be the fastest at finding the match. It is known that finite projective planes correspond to decks in which…
We propose a general technique for extracting a larger set of stable information from persistent homology computations than is currently done. The persistent homology algorithm is usually viewed as a procedure which starts with a filtered…
The stable marriage and stable roommates problems have been extensively studied due to their high applicability in various real-world scenarios. However, it might happen that no stable solution exists, or stable solutions do not meet…
We investigate a cops and robber game on directed graphs, where the robber moves along the arcs of the graph, while the cops can select any position at each time step. Our main focus is on the cop number: the minimum number of cops required…
The stability number of a graph G is the cardinality of a stability system of G (that is of a stable set of maximum size of G). A graph is alpha-stable if its stability number remains the same upon both the deletion and the addition of any…
The stable roommates problem is a non-bipartite version of the stable matching problem in a bipartite graph. In this paper, we consider the stable roommates problem with ties. In particular, we focus on strong stability, which is one of the…
It turned out that the set of the fixed points is not necessarily the same as the set of the local minima of the energy functional. It depends on the diagonal elements of the connection matrix. The simple method which allows to cut off…