Three steps ahead
نویسنده
چکیده
We study a variant of the repeated prisoner’s dilemma with uncertain horizon, in which each player chooses his foresight ability; that is, the timing in which he is informed about the realized length of the interaction. In addition, each player has an independent probability to observe the opponent’s foresight ability. We show that if this probability is not too close to 0 or 1, then the game admits an evolutionarily stable strategy, in which agents who look one step ahead and agents who look three steps ahead coexist. Moreover, this is the unique evolutionarily stable strategy in which players play efficiently at early stages of the interaction. We interpret our results as a novel evolutionary foundation for limited foresight and as a new mechanism to induce cooperation in the repeated prisoner’s dilemma.
منابع مشابه
A Few Steps Ahead to Select ACE2 in Pediatric COVID-19 Treatment: A Review of Literature
This review study aimed to examine the relationship between Coronavirus (COVID-19) and its uses in renin-angiotensin-aldosterone system (RAAS) to infect the patient using the related studies in this regard. Finally, the logical method of using the related medicine, and the benefits and harms of using these Medications will be indicated in the treatment of novel coronavirus. It is hoped that a s...
متن کاملPrediction of Driver’s Accelerating Behavior in the Stop and Go Maneuvers Using Genetic Algorithm-Artificial Neural Network Hybrid Intelligence
Research on vehicle longitudinal control with a stop and go system is presently one of the most important topics in the field of intelligent transportation systems. The purpose of stop and go systems is to assist drivers for repeatedly accelerate and stop their vehicles in traffic jams. This system can improve the driving comfort, safety and reduce the danger of collisions and fuel consumption....
متن کاملLook-ahead Levinson- and Schur-type Recurrences in the Padé Table∗
For computing Padé approximants, we present presumably stable recursive algorithms that follow two adjacent rows of the Padé table and generalize the well-known classical Levinson and Schur recurrences to the case of a nonnormal Padé table. Singular blocks in the table are crossed by look-ahead steps. Ill-conditioned Padé approximants are skipped also. If the size of these lookahead steps is bo...
متن کاملLook-Ahead Approaches for Integrated Planning in Public Transportation
In this paper we deal with three consecutive planning stages in public transportation: Line planning (including line pool generation), timetabling, and vehicle scheduling. These three steps are traditionally performed one after another in a sequential way often leading to high costs in the (last) vehicle scheduling stage. In this paper we propose three different ways to “look ahead”, i.e., to i...
متن کاملAn Implementation of the Look-ahead Lanczos Algorithm for Non-hermitian Matrices Part I
The nonsymmetric Lanczos method can be used to compute eigenvalues of large sparse non-Hermitian matrices or to solve large sparse non-Hermitian linear systems. However, the original Lanczos algorithm is susceptible to possible breakdowns and potential insta-bilities. We present an implementation of a look-ahead version of the Lanczos algorithm which overcomes these problems by skipping over th...
متن کامل