Invincible Strategies of Iterated Prisoner's Dilemma

by   Shiheng Wang, et al.

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 strategies have been studied, from the simple tit-for-tat(TFT) strategy made famous by Axelrod after his influential tournaments to more involved ones like zero determinant strategies studied recently by Press and Dyson. In this paper, following Press and Dyson, we consider one memory probabilistic strategies. We consider that we call invincible strategies: a strategy is invincible if it never loses against any other strategy in terms of average payoff in the limit, if the limit exists. We show a strategy is invincible for infinite repeated iterated prisoner's dilemma.


Recognising and evaluating the effectiveness of extortion in the Iterated Prisoner's Dilemma

Since the introduction of zero-determinant strategies, extortionate stra...

Cooperation Enforcement and Collusion Resistance in Repeated Public Goods Games

Enforcing cooperation among substantial agents is one of the main object...

A Predictive Strategy for the Iterated Prisoner's Dilemma

The iterated prisoner's dilemma is a game that produces many counter-int...

An Unethical Optimization Principle

If an artificial intelligence aims to maximise risk-adjusted return, the...

The gift of the gab: Are rental scammers skilled at the art of persuasion?

Rental scams are a type of advance fee fraud, in which the scammer tries...

Balancing Cooperativeness and Adaptiveness in the (Noisy) Iterated Prisoner's Dilemma

Ever since Axelrod's seminal work, tournaments served as the main benchm...

Long term dynamics of the subgradient method for Lipschitz path differentiable functions

We consider the long-term dynamics of the vanishing stepsize subgradient...

Please sign up or login with your details

Forgot password? Click here to reset