Related papers: 100 prisoners and a lightbulb -- looking back
In this paper we study the Three Hat Problem which appeared in Puzzle Corner of the Technology Review magazine. This puzzle gives a scenario in which three players wearing hats are sitting together and each hat can be seen by everyone…
In 1980 Steven Smale introduced a class of strategies for the Iterated Prisoner's Dilemma which used as data the running average of the previous payoff pairs. This approach is quite different from the Markov chain approach, common before…
For the iterated Prisoner's Dilemma, there exist Markov strategies which solve the problem when we restrict attention to the long term average payoff. When used by both players these assure the cooperative payoff for each of them. Neither…
Stability of evolutionary dynamics of non-repeated Prisoner's Dilemma game with non-uniform interaction rates [1], via benefit and cost dilemma is studied . Moreover, the stability condition (b+c/b-c)2 < r1r3 is derived in case of…
Quantum tunneling across multiple barriers as yet is an unsolved problem for barrier numbers greater than five. The complexity of the mathematical analysis even for small number of barriers pushed it into the realms of Numerical Analysis.…
In real-world scenarios, individuals often cooperate for mutual benefit. However, differences in wealth can lead to varying outcomes for similar actions. In complex social networks, individuals' choices are also influenced by their…
As an important psychological and social experiment, the Iterated Prisoner's Dilemma (IPD) treats the choice to cooperate or defect as an atomic action. We propose to study the behaviors of online learning algorithms in the Iterated…
This paper addresses a mathematically tractable model of the Prisoner's Dilemma using the framework of active inference. In this work, we design pairs of Bayesian agents that are tracking the joint game state of their and their opponent's…
The spatial Prisoner's Dilemma is a prototype model to show the emergence of cooperation in very competitive environments. It considers players, at site of lattices, that can either cooperate or defect when playing the Prisoner's Dilemma…
Iterated Prisoner's Dilemma(IPD) is a well-known benchmark for studying the long term behaviors of rational agents, such as how cooperation can emerge among selfish and unrelated agents that need to co-exist over long term. Many well-known…
This article seeks to encourage a mathematical dialog regarding a possible solution to Beals Conjecture. It breaks down one of the worlds most difficult math problems into laymans terms and encourages people to question some of the most…
A sliding puzzle is a combination puzzle where a player slide pieces along certain routes on a board to reach a certain end-configuration. In this paper, we propose a novel measurement of complexity of massive sliding puzzles with…
Pavlov, a well-known strategy in game theory, has been shown to have some advantages in the Iterated Prisoner's Dilemma (IPD) game. However, this strategy can be exploited by inveterate defectors. We modify this strategy to mitigate the…
The Connections puzzle published each day by the New York Times tasks players with dividing a bank of sixteen words into four groups of four words that each relate to a common theme. Solving the puzzle requires both common linguistic…
The Searchlight Scheduling Problem was first studied in 2D polygons, where the goal is for point guards in fixed positions to rotate searchlights to catch an evasive intruder. Here the problem is extended to 3D polyhedra, with the guards…
We consider the chessboard pebbling problem analyzed by Chung, Graham, Morrison and Odlyzko [3]. We study the number of reachable configurations $G(k)$ and a related double sequence $G(k,m)$. Exact expressions for these are derived, and we…
In many social dilemmas, individuals tend to generate a situation with low payoffs instead of a system optimum ("tragedy of the commons"). Is the routing of traffic a similar problem? In order to address this question, we present…
This is a survey paper on Poisson approximation using Stein's method of exchangeable pairs. We illustrate using Poisson-binomial trials and many variations on three classical problems of combinatorial probability: the matching problem, the…
We study the evolution of cooperation in populations where individuals play prisoner's dilemma on a network. Every node of the network corresponds on an individual choosing whether to cooperate or defect in a repeated game. The players…
In the classical coupon collector's problem, every box of breakfast cereal contains one coupon from a collection of n distinct coupons, each equally likely to appear. The goal is to find the expected number of boxes a player needs to…