IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-030-76666-5_19.html
   My bibliography  Save this book chapter

Using Machine Learning to Understand Bargaining Experiments

In: Bargaining

Author

Listed:
  • Colin F. Camerer

    (California Institute of Technology)

  • Hung-Ni Chen

    (Ludwig Maximilians University of Munich)

  • Po-Hsuan Lin

    (California Institute of Technology)

  • Gideon Nave

    (University of Pennsylvania)

  • Alec Smith

    (Virginia Tech)

  • Joseph Tao-yi Wang

    (National Taiwan University)

Abstract

We study dynamic unstructured bargaining with deadlines and one-sided private information about the amount available to share (the “pie size”). “Unstructured” means that players can make or withdraw any offers and demands they want at any time. Such paradigms, while lifelike, have been displaced in experimental research by highly structured bargaining because they are hard to analyze. Machine learning comes to the rescue because the players’ unstructured bargaining behavior can be taken as “features” to predict outcomes. Machine learning approaches can accommodate a large number of features and guard against overfitting using test samples and methods such as penalized LASSO regression. In previous research, we found that the LASSO could add power to theoretical variables in predicting whether bargaining ended in disagreement. We replicate this work with higher stakes, subject experience, and special attention to gender differences, demonstrating the robustness of this approach.

Suggested Citation

  • Colin F. Camerer & Hung-Ni Chen & Po-Hsuan Lin & Gideon Nave & Alec Smith & Joseph Tao-yi Wang, 2022. "Using Machine Learning to Understand Bargaining Experiments," Springer Books, in: Emin Karagözoğlu & Kyle B. Hyndman (ed.), Bargaining, chapter 0, pages 407-431, Springer.
  • Handle: RePEc:spr:sprchp:978-3-030-76666-5_19
    DOI: 10.1007/978-3-030-76666-5_19
    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 search for a similarly titled item that would be available.

    Citations

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


    Cited by:

    1. Po-Hsuan Lin, 2022. "Cognitive Hierarchies in Multi-Stage Games of Incomplete Information: Theory and Experiment," Papers 2208.11190, arXiv.org, revised Nov 2023.

    More about this item

    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:spr:sprchp:978-3-030-76666-5_19. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.