We study the extent to which equilibrium payo®s of discounted repeated games can be obtained by 1 { memory strategies. First, we present robust examples of games in which there is a subgame perfect equilibrium payo® pro¯le that cannot be obtained by any 1 { memory subgame perfect equilibrium. Then, a complete characterization of 1 { memory simple strategies is provided, and it is employed to establish the following in games with more than two players each having connected action spaces: 1. all subgame perfect equilibrium payo®s can be approximately supported by an " { sub- game perfect equilibrium strategy of 1 { memory, 2. all strictly enforceable subgame perfect equilibrium payo®s can be approximately sup- ported by a 1 { memory subgame equilibrium, and 3. the subgame perfect Folk Theorem holds for 1 { memory strategies. While no further restrictions are needed for the third result to hold in 2 { player games, an additional restriction is needed for the ¯rst two: players must have common punishments.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Publisher Info
Paper provided by Universidade Nova de Lisboa, Faculdade de Economia in its series FEUNL Working Paper Series with number
wp500.
References listed on IDEAS Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.: