Skip to main content Accessibility help
×
Hostname: page-component-78c5997874-lj6df Total loading time: 0 Render date: 2024-11-13T06:06:40.234Z Has data issue: false hasContentIssue false

IV - General Model of Repeated Games

Published online by Cambridge University Press:  05 February 2015

Sylvain Sorin
Affiliation:
Université de Paris VI (Pierre et Marie Curie)
Shmuel Zamir
Affiliation:
Hebrew University of Jerusalem and University of Exeter
Get access

Summary

THE MODEL

In this chapter we introduce formally the general model of repeated games.

We start with a non-cooperative game G and define a new game Г, a play of which is an infinite sequence of plays of G.

In fact, it appears in many applications that current moves not only influence the current payoff but also the future play, hence some state variable of the model. This is the reason why stochastic games appear in a natural way.

Moreover we have to describe the information available to the players. There may be some differences between their initial knowledge of the characteristics: initial state, preferences, even transition law. This is taken into account in the framework of games with incomplete information.

Finally it is necessary for a full description of the game to specify what additional information is transmitted to the players after each stage of the play. It is easy to see that assuming the knowledge of the other players' strategies is unrealistic. A more plausible weaker assumption may be that only the actual moves are observed. An even weaker assumption is that only the individual player's payoff is known to him. Even more generally, we may consider a model without full monitoring of previous moves, or of the outcomes, or even of the players' own payoffs. This leads to the notion of signals that may depend in a random way on the actual moves and state.

To integrate all such effects it is sufficient to define a state- and move-dependent lottery that selects at every stage the signals for the players, their payoffs, and the next state of nature. If one wants in addition to incorporate the effect of information lags, this transition may also depend on the past events. In fact, we will see that this quite huge construction can be reduced to a simple and convenient form (cf. Proposition IV.2.3, p. 183).

It follows from the above presentation that this model is an adequate description of a stationary multistage game in the sense that its formulation is time-shift invariant (which may require adding new states and payoffs, if necessary) and needs only some counter to let the stage of the game be known to the players.

Type
Chapter
Information
Repeated Games , pp. 171 - 212
Publisher: Cambridge University Press
Print publication year: 2015

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×