In a series of papers we have examined what happens when individuals make very calculated choices of partners, based on past interaction histories 17, 1, 16. In Iterated Prisoner's Dilemma with Choice and Refusal (IPD/CR), players use expected payoffs, which are based on the play history between the players plus an initial expectation, to assess the relative desirability of potential partners and refuse play with those judged to be intolerable. We have primarily studied this model using evolved populations of finite state machines. In each generation, individual behaviors generate social networks of interacting players. Here we provide an overview of our previous evolutionary results, and include some preliminary results on the impact of increasing the population size and including more randomness into the partner selection procedure.
%0 Journal Article
%1 Stanley:1995p5785
%A Stanley, E.A
%A Ashlock, D
%A Smucker, M.D
%D 1995
%J Lecture Notes in Computer Science
%K Partner choice
%P 490--502
%T Iterated Prisoner's Dilemma with Choice and Refusal of Partners: Evolutionary Results
%V 929
%X In a series of papers we have examined what happens when individuals make very calculated choices of partners, based on past interaction histories 17, 1, 16. In Iterated Prisoner's Dilemma with Choice and Refusal (IPD/CR), players use expected payoffs, which are based on the play history between the players plus an initial expectation, to assess the relative desirability of potential partners and refuse play with those judged to be intolerable. We have primarily studied this model using evolved populations of finite state machines. In each generation, individual behaviors generate social networks of interacting players. Here we provide an overview of our previous evolutionary results, and include some preliminary results on the impact of increasing the population size and including more randomness into the partner selection procedure.
@article{Stanley:1995p5785,
abstract = {In a series of papers we have examined what happens when individuals make very calculated choices of partners, based on past interaction histories [17, 1, 16]. In Iterated Prisoner's Dilemma with Choice and Refusal (IPD/CR), players use expected payoffs, which are based on the play history between the players plus an initial expectation, to assess the relative desirability of potential partners and refuse play with those judged to be intolerable. We have primarily studied this model using evolved populations of finite state machines. In each generation, individual behaviors generate social networks of interacting players. Here we provide an overview of our previous evolutionary results, and include some preliminary results on the impact of increasing the population size and including more randomness into the partner selection procedure.},
added-at = {2009-02-08T16:38:56.000+0100},
author = {Stanley, E.A and Ashlock, D and Smucker, M.D},
biburl = {https://www.bibsonomy.org/bibtex/29bfec88669fd49d4b7d1a4e4fce2a7c5/svsegbro},
date-added = {2008-08-30 01:26:52 +0200},
date-modified = {2008-08-30 01:30:11 +0200},
interhash = {5577bb81d1421f7b39544e1a044c4791},
intrahash = {9bfec88669fd49d4b7d1a4e4fce2a7c5},
journal = {Lecture Notes in Computer Science},
keywords = {Partner choice},
pages = {490--502},
rating = {0},
timestamp = {2009-02-08T16:38:58.000+0100},
title = {Iterated Prisoner's Dilemma with Choice and Refusal of Partners: Evolutionary Results},
uri = {papers://B7B184F3-8CE5-4C43-B61C-B7952DE67982/Paper/p5785},
volume = 929,
year = 1995
}