UNSPECIFIED. (2002) Convergence of the iterated prisoner's dilemma game. COMBINATORICS PROBABILITY & COMPUTING, 11 (2). pp. 135-147. ISSN 0963-5483

Full text not available from this repository.

Abstract

We consider a stochastic process based on the iterated prisoner's dilemma game. During the game, each of n players has a state, either cooperate or defect. The players are connected by an 'interaction graph', During each step of the process, an edge of the graph is chosen uniformly at random and the states of the players connected by the edge are modified according to the Pavlov strategy. The process converges to a unique absorbing state in which all players cooperate. We prove two conjectures of Kittock: the convergence rate is exponential in n when the interaction graph is a complete graph, and it is polynomial in n when the interaction graph is a cycle. In fact, we show that the rate is O(n log n) in the latter case.

Item Type:	Journal Article
Subjects:	Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software Q Science > QA Mathematics
Journal or Publication Title:	COMBINATORICS PROBABILITY & COMPUTING
Publisher:	CAMBRIDGE UNIV PRESS
ISSN:	0963-5483
Date:	March 2002
Volume:	11
Number:	2
Number of Pages:	13
Page Range:	pp. 135-147
Identification Number:	10.1017/S096354830100503X
Publication Status:	Published
URI:	http://wrap.warwick.ac.uk/id/eprint/11139

Data sourced from Thomson Reuters' Web of Knowledge

Request changes to a record

Actions (login required)

View Item