Dynamic unstructured bargaining with private information: Theory, experiment, and outcome prediction via machine learning

We study dynamic unstructured bargaining with deadlines and one-sided private information about the amount available to share (the "pie size"). Using mechanism design theory, we show that given the players' incentives, the equilibrium incidence of bargaining failures ("strikes&qu...

Full description

Bibliographic Details
Main Authors: Camerer, C.F (Author), Nave, G. (Author), Smith, A. (Author)
Format: Article
Language:English
Published: INFORMS Inst.for Operations Res.and the Management Sciences 2019
Subjects:
Online Access:View Fulltext in Publisher
LEADER 02366nam a2200349Ia 4500
001 10.1287-mnsc.2017.2965
008 220511s2019 CNT 000 0 und d
020 |a 00251909 (ISSN) 
245 1 0 |a Dynamic unstructured bargaining with private information: Theory, experiment, and outcome prediction via machine learning 
260 0 |b INFORMS Inst.for Operations Res.and the Management Sciences  |c 2019 
856 |z View Fulltext in Publisher  |u https://doi.org/10.1287/mnsc.2017.2965 
520 3 |a We study dynamic unstructured bargaining with deadlines and one-sided private information about the amount available to share (the "pie size"). Using mechanism design theory, we show that given the players' incentives, the equilibrium incidence of bargaining failures ("strikes") should increase with the pie size, and we derive a condition under which strikes are efficient. In our setting, no equilibrium satisfies both equality and efficiency in all pie sizes. We derive two equilibria that resolve the trade-off between equality and efficiency by favoring either equality or efficiency. Using a novel experimental paradigm, we confirm that strike incidence is decreasing in the pie size. Subjects reach equal splits in small pie games (in which strikes are efficient), while most payoffs are close to either the efficient or the equal equilibrium prediction, when the pie is large.We employ a machine learning approach to show that bargaining process features recorded early in the game improve out-of-sample prediction of disagreements at the deadline. The process feature predictions are as accurate as predictions from pie sizes only, and adding process and pie data together improves predictions even more. © 2018 The Author(s). 
650 0 4 |a Bargaining 
650 0 4 |a Dynamic game 
650 0 4 |a Dynamic games 
650 0 4 |a Dynamics 
650 0 4 |a Economic and social effects 
650 0 4 |a Efficiency 
650 0 4 |a Forecasting 
650 0 4 |a Learning systems 
650 0 4 |a Machine design 
650 0 4 |a Machine learning 
650 0 4 |a Machine learning approaches 
650 0 4 |a Mechanism design 
650 0 4 |a Mechanism design theories 
650 0 4 |a Outcome prediction 
650 0 4 |a Private information 
650 0 4 |a Trade off 
700 1 |a Camerer, C.F.  |e author 
700 1 |a Nave, G.  |e author 
700 1 |a Smith, A.  |e author 
773 |t Management Science