You play (an action) only once
Consider an N-player normal form game played repeatedly in which each player should choose each strategy exactly one time (payoffs are aggregated). such "play only once" situations occur naturally in the context of scheduling. assume that each player has the same number of strategies. Then, regardless of the players' preferences, for each player to mix uniformly in each round over his remaining strategies consitutes a subgame perfect equilibrium.
(This abstract was borrowed from another version of this item.)
If you experience problems downloading a file, check if you have the proper application to view it first. 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.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
When requesting a correction, please mention this item's handle: RePEc:eee:ecolet:v:59:y:1998:i:3:p:299-303. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Shamier, Wendy)
If references are entirely missing, you can add them using this form.