IDEAS home Printed from https://ideas.repec.org/p/hal/pseptp/halshs-01630037.html

Reaching consensus through approval bargaining

Author

Listed:
  • Jean-François Laslier

    (PSE - Paris School of Economics - UP1 - Université Paris 1 Panthéon-Sorbonne - ENS-PSL - École normale supérieure - Paris - PSL - Université Paris Sciences et Lettres - EHESS - École des hautes études en sciences sociales - ENPC - École nationale des ponts et chaussées - CNRS - Centre National de la Recherche Scientifique - INRAE - Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement, PJSE - Paris Jourdan Sciences Economiques - UP1 - Université Paris 1 Panthéon-Sorbonne - ENS-PSL - École normale supérieure - Paris - PSL - Université Paris Sciences et Lettres - INRA - Institut National de la Recherche Agronomique - EHESS - École des hautes études en sciences sociales - ENPC - École nationale des ponts et chaussées - CNRS - Centre National de la Recherche Scientifique)

  • Matias Nunez

    (Université Paris Dauphine-PSL - PSL - Université Paris Sciences et Lettres, LAMSADE - Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision - Université Paris Dauphine-PSL - PSL - Université Paris Sciences et Lettres - CNRS - Centre National de la Recherche Scientifique, PSL - Université Paris Sciences et Lettres)

  • Carlos Pimienta

    (UNSW - University of New South Wales [Sydney])

Abstract

In the Approval Bargaining game, two players bargain over a finite set of alternatives. To this end, each one simultaneously submits a utility function u jointly with a real number α; by doing so she approves the lotteries whose expected utility according to u is at least α. The lottery to be implemented is randomly selected among the most approved ones. We first prove that there is an equilibrium where players truthfully reveal their utility function. We also show that, in any equilibrium, the equilibrium outcome is approved by both players. Finally, every equilibrium is sincere and Pareto efficient as long as both players are partially honest.

Suggested Citation

  • Jean-François Laslier & Matias Nunez & Carlos Pimienta, 2017. "Reaching consensus through approval bargaining," PSE-Ecole d'économie de Paris (Postprint) halshs-01630037, HAL.
    • Handle: RePEc:hal:pseptp:halshs-01630037
    DOI: 10.1016/j.geb.2017.04.002
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    Other versions of this item:

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Laslier, Jean-François & Núñez, Matías & Remzi Sanver, M., 2021. "A solution to the two-person implementation problem," Journal of Economic Theory, Elsevier, vol. 194(C).
    2. Su, Francis Edward & Zerbib, Shira, 2019. "Piercing numbers in approval voting," Mathematical Social Sciences, Elsevier, vol. 101(C), pages 65-71.
    3. Alós-Ferrer, Carlos & Buckenmaier, Johannes, 2019. "Strongly sincere best responses under approval voting and arbitrary preferences," Games and Economic Behavior, Elsevier, vol. 117(C), pages 388-401.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    JEL classification:

    • C70 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - General
    • C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hal:pseptp:halshs-01630037. See general information about how to correct material in RePEc.

    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.

    We have no bibliographic references for this item. You can help adding them by using 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Caroline Bauer (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.