Premiile Ad Astra
Revista Ad Astra
Biblioteca de știință
Cartea albă
Topul universităților
Who's who
Publicații
Teze și dizertații
Asociația Ad Astra
 
Comunicate
Știri
Evenimente
Oportunități de finanțare
 
Login
Înregistrare
 
>> English
 
   
 

Leslie A. Goldberg, Catherine Greenhill, Martin Dyer, Gabriel Istrate and Mark Jerrum. The convergence of the Iterated Prisoner' s Dilemma game. Combinatorics, Probability and Computing, 11, pp. 135-157, 2002.

Rezumat: We investigate a simple dynamics on graphs, motivated by:
1. The Pavlov rule in Prisoner's Dilemma
2. A special case of co-learning, a concept in distributed Artificial Intelligence introduced by Shoham and Tennenholtz , and further investigated by Kittock.

We prove two results:
1. On cycles absorbtion takes O(n log(n)) steps.
2. In contrast, the number of steps is exponential on the
complete graph.

Cuvinte cheie: Prisoner's Dilemma, Markov chains, mixing time

URL: http://dx.doi.org/doi:10.1017/S096354830100503X

Adăugată pe site de Gabriel Istrate

Înapoi

   
© Ad Astra 2001-2013