Logo
Munich Personal RePEc Archive

A non-cooperative Pareto-efficient solution to a one-shot Prisoner's Dilemma

Wu, Haoyang (2011): A non-cooperative Pareto-efficient solution to a one-shot Prisoner's Dilemma.

This is the latest version of this item.

[thumbnail of MPRA_paper_34953.pdf]
Preview
PDF
MPRA_paper_34953.pdf

Download (477kB) | Preview

Abstract

The Prisoner's Dilemma is a simple model that captures the essential contradiction between individual rationality and global rationality. Although the one-shot Prisoner's Dilemma is usually viewed simple, in this paper we will categorize it into five different types. For the type-4 Prisoner's Dilemma game, we will propose a self-enforcing algorithmic model to help non-cooperative agents obtain Pareto-efficient payoffs. The algorithmic model is based on an algorithm using complex numbers and can work in macro applications.

Available Versions of this Item

Atom RSS 1.0 RSS 2.0

Contact us: mpra@ub.uni-muenchen.de

This repository has been built using EPrints software.

MPRA is a RePEc service hosted by Logo of the University Library LMU Munich.