TY - JOUR
T1 - Repeated games with incomplete information on one side
T2 - The case of different discount factors
AU - Lehrer, Ehud
AU - Yariv, Leeat
PY - 1999
Y1 - 1999
N2 - Two players engage in a repeated game with incomplete information on one side, where the underlying stage-games are zero-sum. In the case where players evaluate their stage-payoffs by using different discount factors, the payoffs of the infinitely repeated game are typically non zero-sum. However, if players grow infinitely patient, then the equilibrium payoffs will sometimes approach the zero-sum result, depending on the asymptotic relative patience of the players. We provide sufficient conditions that ensure a zero-sum limit. Moreover, we provide examples of games violating these conditions that possess `cooperative' equilibria whose payoffs are bounded away from the zero-sum payoffs set.
AB - Two players engage in a repeated game with incomplete information on one side, where the underlying stage-games are zero-sum. In the case where players evaluate their stage-payoffs by using different discount factors, the payoffs of the infinitely repeated game are typically non zero-sum. However, if players grow infinitely patient, then the equilibrium payoffs will sometimes approach the zero-sum result, depending on the asymptotic relative patience of the players. We provide sufficient conditions that ensure a zero-sum limit. Moreover, we provide examples of games violating these conditions that possess `cooperative' equilibria whose payoffs are bounded away from the zero-sum payoffs set.
UR - http://www.scopus.com/inward/record.url?scp=0033075392&partnerID=8YFLogxK
U2 - 10.1287/moor.24.1.204
DO - 10.1287/moor.24.1.204
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0033075392
SN - 0364-765X
VL - 24
SP - 204
EP - 218
JO - Mathematics of Operations Research
JF - Mathematics of Operations Research
IS - 1
ER -