IDEAS home Printed from
MyIDEAS: Log in (now much improved!) to save this paper

Evolutionary Stability in Alternatin-Offers Bargaining Games

Listed author(s):
  • Ken Binmore
  • Michele Piccione
  • Larry Samuelson
Registered author(s):

    This paper characterizes modified evolutiona.rily stable strategies (MESSes) in Rubinstein's alternatingoffers, infinite- horizon bargaining game. The MESS concept modifies the idea of an neutrally stable strategy by favoring a simple strategy over a more complex strategy when both yield the same pay-off. Our complexity notion is weaker than the common practice of counting states in automata. If strategy A is a MESS, then the use of A by both play- ers is a Nash equilibrium in which an agreement is achieved immediately, and neither player would be willing to delay the agreement by one period in order to achieve the other player's share of the surplus. Each player's share of the surplus is then bounded between the shares received by the two players in the unique subgame-perfect equilibrium of Rubinstein's game. As the probability of a breakdown in negotiations becomes small (or discount factors become large), these bounds collapse on the subgame-perfect equilib- rium. These results continue to hold when offers must be made in multiples of a smallest monetary unit.

    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.

    File URL:
    Download Restriction: no

    Paper provided by ESRC Centre on Economics Learning and Social Evolution in its series ELSE working papers with number 039.

    in new window

    Date of creation:
    Handle: RePEc:els:esrcls:039
    Contact details of provider: Web page:

    More information through EDIRC

    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.:

    in new window

    1. Banks, Jeffrey S. & Sundaram, Rangarajan K., 1990. "Repeated games, finite automata, and complexity," Games and Economic Behavior, Elsevier, vol. 2(2), pages 97-117, June.
    2. Abreu, Dilip & Rubinstein, Ariel, 1988. "The Structure of Nash Equilibrium in Repeated Games with Finite Automata," Econometrica, Econometric Society, vol. 56(6), pages 1259-1281, November.
    Full references (including those not matched with items on IDEAS)

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    When requesting a correction, please mention this item's handle: RePEc:els:esrcls:039. 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: (s. malkani)

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    This information is provided to you by IDEAS at the Research Division of the Federal Reserve Bank of St. Louis using RePEc data.