Domination in Iterated Prisoner's Dilemma

Domination is a concept in Game Theory which has not been fully explored in the Iterated Prisoner's Dilemma. The idea of domination has previously been restricted to current moves looking at a single game and not a sequence of moves. An extension of the notion of domination is made that allows...

Full description

Saved in:
Bibliographic Details
Published in2011 24th Canadian Conference on Electrical and Computer Engineering(CCECE) pp. 001125 - 001128
Main Authors Brown, Joseph Alexander, Ashlock, Daniel A.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.05.2011
Subjects
Biology
Evolutionary computation
Game theory
Games
Internet
Thin film transistors
Online AccessGet full text
ISBN9781424497881
1424497884
ISSN0840-7789
DOI10.1109/CCECE.2011.6030637

Cover

More Information
Summary:Domination is a concept in Game Theory which has not been fully explored in the Iterated Prisoner's Dilemma. The idea of domination has previously been restricted to current moves looking at a single game and not a sequence of moves. An extension of the notion of domination is made that allows for the formalization of various behaviours exhibited in agents playing IPD. This formalization organizes behaviours such as "nice" into sets of dominated agents in an elegant fashion. In this initial study, we focus on dominators for sets of agents drawn from the set: Always Cooperate, Always Defect, and Tit-for-Tat.
ISBN:9781424497881
1424497884
ISSN:0840-7789
DOI:10.1109/CCECE.2011.6030637