2017arXiv (Cornell University)Open access

Press-Dyson Analysis of Asynchronous, Sequential Prisoner's Dilemma

Robert Young

Open full text 1 citations

Abstract

Two-player games have had a long and fruitful history of applications stretching across the social, biological, and physical sciences. Most applications of two-player games assume synchronous decisions or moves even when the games are iterated. But different strategies may emerge as preferred when the decisions or moves are sequential, or the games are iterated. Zero-determinant strategies developed by Press and Dyson are a new class of strategies that have been developed for synchronous two-player games, most notably the iterated prisoner's dilemma. Here we apply the Press-Dyson analysis to sequential or asynchronous two-player games. We focus on the asynchronous prisoner's dilemma. As a first application of the Press-Dyson analysis of the asynchronous prisoner's dilemma, tit-for-tat is shown to be an efficient defense against extortionate zero-determinant strategies. Nice strategies like tit-for-tat are also shown to lead to Pareto optimal payoffs for both players in repeated prisoner's dilemma.

Open-access reader

About this research paper

What this paper is about

Two-player games have had a long and fruitful history of applications stretching across the social, biological, and physical sciences. Most applications of two-player games assume synchronous decisions or moves even when the games are iterated. But different strategies may emerge as preferred when the decisions or moves are sequential, or the games are iterated. Zero-determinant strategies developed by Press and Dyson are a new class of strategies that have been developed for synchronous two-player games, most notably the iterated prisoner's dilemma. Here we apply the Press-Dyson analysis to sequential or asynchronous two-player games. We focus on the asynchronous prisoner's dilemma. As a first application of the Press-Dyson analysis of the asynchronous prisoner's dilemma, tit-for-tat is shown to be an efficient defense against extortionate zero-determinant strategies. Nice strategies like tit-for-tat are also shown to lead to Pareto optimal payoffs for both players in repeated prisoner's dilemma.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Two-player games have had a long and fruitful history of applications stretching across the social, biological, and physical sciences. Most applications of two-player games assume synchronous decisions or moves even when the games are iterated. But different strategies may emerge as preferred when the decisions or moves are sequential, or the games are iterated. Zero-determinant strategies developed by Press and Dyson are a new class of strategies that have been developed for synchronous two-player games, most notably the iterated prisoner's dilemma. Here we apply the Press-Dyson analysis to sequential or asynchronous two-player games. We focus on the asynchronous prisoner's dilemma. As a first application of the Press-Dyson analysis of the asynchronous prisoner's dilemma, tit-for-tat is shown to be an efficient defense against extortionate zero-determinant strategies. Nice strategies like tit-for-tat are also shown to lead to Pareto optimal payoffs for both players in repeated prisoner's dilemma.

Key concepts: Superrationality, Prisoner's dilemma, Dilemma, Asynchronous communication, Iterated function, Mathematical economics, Computer science, Game theory

Related papers

Back to paper searchBrowse research topicsOriginal source
Press-Dyson Analysis of Asynchronous, Sequential Prisoner's Dilemma — Research Paper | ScholarLens