1994
DOI: 10.1006/game.1994.1012
|View full text |Cite
|
Sign up to set email alerts
|

Strongly Symmetric Subgame Perfect Equilibria in Infinitely Repeated Games with Perfect Monitoring and Discounting

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
39
0

Year Published

1998
1998
2018
2018

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 41 publications
(39 citation statements)
references
References 0 publications
0
39
0
Order By: Relevance
“…15 In the U.S. credit card lending market potential rival banks are identifiable because credit card lending is highly concentrated and this concentration has been persistent. The Federal Reserve has collected data on credit card lending and related charge-offs since the first quarter of 1991 in the Call Reports.…”
Section: The Credit Card Loan Marketmentioning
confidence: 99%
“…15 In the U.S. credit card lending market potential rival banks are identifiable because credit card lending is highly concentrated and this concentration has been persistent. The Federal Reserve has collected data on credit card lending and related charge-offs since the first quarter of 1991 in the Call Reports.…”
Section: The Credit Card Loan Marketmentioning
confidence: 99%
“…We follow the recursive approach developed by APS and applied by Cronshaw and Luenberger(1990) to perfect information games. In the recursive formulation of the problem, each subgame perfect equilibrium payoff vector is supported by a profile of current actions consistent with Nash play in the current period and a vector of continuation payoffs that are themselves payoffs in some subgame perfect equilibrium.…”
Section: Assumptionmentioning
confidence: 99%
“…Abreu, Pearce and Stacchetti (APS) (1986,1990) developed set-valued techniques for solving repeated games with imperfect monitoring, showing that the set of sequential equilibrium payoffs is a fixed point of a monotone operator similar to the Bellman operator in dynamic programming. Cronshaw and Luenberger (1990) extend the APS analysis to games with perfect monitoring. More generally, the APS method can be applied to any problem reducible to finding the maximal fixed point of a monotone set-valued operator.…”
Section: Introductionmentioning
confidence: 99%
“…In repeated games, the set of subgame-perfect equilibria can be defined recursively: a strategy profile is an equilibrium if certain equilibrium payoffs are available as continuation payoffs, and these continuation payoffs may be generated by means of other equilibrium strategy profiles. This construction has been presented for pure strategies in Abreu et al [1,2], where they give a fixed-point characterization of the set of equilibrium payoffs (see also [3][4][5][6][7][8][9][10][11][12]). …”
Section: Introductionmentioning
confidence: 99%