Related papers: 100 prisoners and a lightbulb -- looking back
Since the breakthroughs in 2005 which have led to long term stable solutions of the binary black hole problem in numerical relativity, much progress has been made. I present here a short summary of the state of the field, including the…
Epidemiologists have a growing interest in employing computational approaches to solve analytic problems, with simulation being arguably the most accessible among all approaches. While previous literature discussed the utility of simulation…
We study environments in which agents are randomly matched to play a Prisoner's Dilemma, and each player observes a few of the partner's past actions against previous opponents. We depart from the existing related literature by allowing a…
The Chow-Robbins game is a classical still partly unsolved stopping problem introduced by Chow and Robbins in 1965. You repeatedly toss a fair coin. After each toss, you decide if you take the fraction of heads up to now as a payoff,…
In the gift exchange game there are n players and n wrapped gifts. When a player's number is called, that person can either choose one of the remaining wrapped gifts, or can "steal" a gift from someone who has already unwrapped it, subject…
We introduce the concept of a threefold Post correspondence system (3PCS for short) and we consider it as an instance of the threefold Post correspondence problem. With each 3PCS, we associate three Post correspondence systems, i.e., three…
In a delightful article that recently appeared in the American Mathematics Monthly, Norbert Henze and Guenter Last discuss the "Absent-Minded Passengers" Problem, but left open finding an explicit expression for the probability generating…
The Iterated Prisoner's Dilemma with Choice and Refusal (IPD/CR) is an extension of the Iterated Prisoner's Dilemma with evolution that allows players to choose and to refuse their game partners. From individual behaviors, behavioral…
This is a pedagogical article cited in the foregoing research note, quant-ph/9911050
Recent experimental evidence [Gruji\'c et al., PLoS ONE 5, e13749 (2010)] on the spatial Prisoner's Dilemma suggests that players choosing to cooperate or not on the basis of their previous action and the actions of their neighbors coexist…
Assume that $n = 2k$ potential roommates each have an ordered preference of the $n-1$ others. A stable matching is a perfect matching of the $n$ roommates in which no two unmatched people prefer each other to their matched partners. In…
We investigate evolutionary dynamics of altruism with long-range interaction on a cycle. The interaction between individuals is described by a simplified version of the prisoner's dilemma (PD) game in which the payoffs are parameterized by…
The rational solution of the Monty Hall problem unsettles many people. Most people, including the authors, think it feels wrong to switch the initial choice of one of the three doors, despite having fully accepted the mathematical proof for…
I discuss puzzles that require thinking outside the box. I also discuss the box inside of which many people think.
This paper is written for "Gribov Memorial Volume", Heavy Ion Physics, Acta Physica Hungarica. This is a report on my 25 years activity in understanding of the Pomeron structure. Since I was involved in the Pomeron business moreless from…
In 1979, David Fabian found a complete game of two-person Chinese Checkers in 30 moves (15 by each player) [Martin Gardner, Penrose Tiles to Trapdoor Ciphers, MAA, 1997]. This solution requires that the two players cooperate to generate a…
As large language models (LLMs) are increasingly deployed across diverse domains, ensuring their safety has become a critical concern. In response, studies on jailbreak attacks have been actively growing. Existing approaches typically rely…
The Prisoner's Dilemma (PD) deals with the cooperation/defection conflict between two agents. The agents are represented by a cell of $L \times L$ square lattice. The agents are initially randomly distributed according to a certain…
In the light bulb problem, one is given uniformly random vectors $x_1, \ldots, x_n, y_1, \ldots, y_n \in \{-1,1\}^d$. They are all chosen independently except a planted pair $(x_{i^*}, y_{j^*})$ is chosen with correlation $\rho>0$. The goal…
The clustering problem has many applications in Machine Learning, Operations Research, and Statistics. We propose three algorithms to create starting solutions for improvement algorithms for this problem. We test the algorithms on 72…