That question’s potentially ambiguous: does “previous interactions” mean previous moves within a single game, or previous games played? If the former, quite a bit of research on the PD played by finite state machines would fit. If the latter, Toby Ord’s work on the “societal iterated prisoner’s dilemma” would fit.
Has there been research on Prisoner’s Dilemma where the players have limited amounts of memory for keeping track of previous interactions?
Google gives these:
http://www.pnas.org/content/95/23/13755.full.pdf
http://www.icmp.lviv.ua/journal/zbirnyk.79/33001/art33001.pdf
http://www.complex-systems.com/pdf/19-4-4.pdf
https://editorialexpress.com/cgi-bin/conference/download.cgi?db_name=ASSET2007&paper_id=287
http://ms.mcmaster.ca/~rogern4/pdf/publications_2009/annie_ltm.pdf
http://210.26.51.93/chenlab/images/4/4e/025.pdf
That question’s potentially ambiguous: does “previous interactions” mean previous moves within a single game, or previous games played? If the former, quite a bit of research on the PD played by finite state machines would fit. If the latter, Toby Ord’s work on the “societal iterated prisoner’s dilemma” would fit.