Skip to main content
Log in

Two Person Bargaining Mechanisms: A Laboratory Experiment

  • Published:
Group Decision and Negotiation Aims and scope Submit manuscript

Abstract

We conduct a series of experiments in which two subjects bargain over five options. Following an experimental design closely related to De Clippel et al. (Am Econ Rev 104:3434–3458, 2014), we evaluate the performance of three bargaining mechanisms: (α) one subject shortlists a block of three options before the other chooses one among them, (\(\beta\)) both subjects veto options simultaneously and in a block, and (\(\gamma\)) both subjects veto options simultaneously and gradually one after the other. We document that the non-symmetric shortlisting mechanism (α) is highly efficient, but our data also suggest the existence of a first-mover advantage as subjects become more experienced. The simultaneous mechanism (\(\beta\)) is less efficient than (α) and generates a high level of ex-post inequality. The gradual veto mechanism (\(\gamma\)) is no less efficient than (α), but has the important advantage of shutting down the possibility of any first-mover advantage.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Notes

  1. Note that we are implicitly referring to the literature on structured bargaining, where bargaining occurs following some predetermined steps (see Camerer et al. 2019 for the distinction between structured and unstructured bargaining). Yet, there is also an experimental literature on unstructured free-form bargaining. For instance, Galeotti et al. (2019) focuses on efficiency and equity. They observe that many bargaining outcomes are Pareto efficient and document the existence of a compromise effect, i.e., that subjects tend to select equal-earnings outcomes.

  2. De Clippel et al. (2014) designed their mechanism to minimize the number of rounds.

  3. It takes at least two rounds to reach an option. In our data, 63% of all games finish after two rounds, 96% finish after a third round, and 100% finish after a fourth round.

  4. The impossibility result can also be stated as “No Pareto efficient social choice rule is Nash implementable when the domain of preferences is unrestricted”. Dutta and Sen (1991) and Moore and Repullo (1990) independently characterize the set of social choice rules that can be Nash implemented with two players and show that suitable domain restrictions (especially in the Euclidean space) can overcome this powerful negative result. In this sense, our contribution also speaks to the literature on partial honesty (see Dutta and Sen 2012) and the one on King Solomon’s dilemma (see Perry and Reny 1999).

  5. The idea of Fallback bargaining (Brams and Kilgour 2001; De Clippel and Eliaz 2012) is also present in the literature under different names: for instance, the Rawlsian arbitration rule in Sprumont (1993), the Kant-Rawls social compromise in Hurwicz and Sertel (1999), the Unanimity Compromise in Kıbrıs and Sertel (2007) and the Maximin rule (Congar and Merlin 2012).

  6. This applies to the mechanism α (which is deterministic) but also to mechanisms \(\beta\) and \(\gamma\) where lotteries are involved as long as players’ preferences over lotteries satisfy stochastic dominance.

  7. If one randomizes the identity of the first mover, the set of subgame-perfect equilibria outcomes for each preference profile equals \({o}_{\mathrm{1,2}}\) (≻) \({\cup o}_{\mathrm{1,2}}\) (≻). This guarantees ex-ante fairness but no ex-post fairness. In this paper, we focus on ex-post fairness.

  8. We would like to thank an anonymous referee for suggesting this example.

  9. For any set \(X\subseteq A\),\(uni(X)\) is the uniform lottery over elements in \(X\). A uniform lottery is defined as follows: for any \(X\subseteq A\), \(uni(X)\) is the lottery such that \({uni(X)}_{i}=\frac{1}{\#X}\) if \(i\in X\) and \({uni(X)}_{i}=0\) otherwise.

  10. See Laslier et al. (2021) for a precise analysis; stochastic dominance suffices to prove this claim.

  11. To avoid any lab effect, we reproduce the entire analysis in restricting the sample to data coming from the lab in which we covered all: CREST. The results are remarkably similar, see "Appendix D".

  12. The full instructions as presented to subjects at the beginning of the experiment are in the supplementary material. After reading instructions and before starting the experiment, we let subjects answer a quiz about the rules to facilitate their understanding. The quiz questions are also available in the supplementary material.

  13. This additional profile, Pf5 is equal is \(a \succ _{1}\;b \succ_{1}\;c \succ _{1}\;d \succ_{1}\;e\) vs \(e \succ_{2}\;c \succ_{2}\;a \succ_{2}\;b\succ_{2}\;d\). Note that we also standardized the payoff from 0 to 20 in their data to make their results comparable to ours. In their experiment, stage payoffs range from 0 to 1 with a scale of 0.25 whereas our stage payoffs range from 0 to 20 with a scale of 5. In both experiments, the monetary payoff that a subject associates to an option is simply linear with its rank.

  14. See De Clippel et al. (2014) section D for a discussion on the role of other-regarding preferences in their data. Note that we also attribute the differences between the results in the data of De Clippel et al. (2014) and our data to the nature of the sample. De Clippel et al. (2014) conducted their experiment with a sample of undergraduate students in economics and social sciences, whereas we conducted ours with a more diverse sample in which students do not represent a majority of subjects. Evidence shows that students tend to be less generous than non-students, while not particularly better at coordinating (see Carpenter et al. 2008; Falk et al. 2013; Belot et al. 2015 and Bol et al. 2016 among others).

  15. Full results can be found in “Appendix B.3”. We also report some regression analysis of the data in "Appendix F", in which we account for the non-independence of the observations at the experimental-session level.

  16. We also present the (absence of) first-mover advantage under the alternative mechanisms in “Appendix C”. This is not surprising given that which subject "plays first" is purely artificial in these symmetric mechanisms in which all subjects play at the same time.

  17. We find a small negative correlation between the number of cautious vetoes and the gains in the simultaneous mechanism (− 0.06) whereas this correlation is positive for the other mechanisms (between 0.02 and 0.08).

  18. In “Appendix G”, we explore other forms of strategies and find some interesting patterns, in particular, that subjects are more aggressive under the mechanism with gradual vetoes. However, we focus in the main text on the rate of same vetoes as it is the most striking difference between mechanisms and the one that really explains the aggregate results.

  19. Note that this can be seen as a hard test for this difference in coordination between the two mechanisms. Our experimental design allows subjects to partially coordinate even in the simultaneous mechanism because the pairs play together for five rounds before being reshuffled. This for example explains why there are, in the simultaneous mechanism, "only" 39% of common vetoes in profile A5 where subjects have the exact same preferences over the options available. In the first round played between each pair, this rate is 65%. Meanwhile, this rate is 36% of common vetoes in the first round in the gradual vetoes mechanism.

  20. We would like to thank an anonymous referee for this suggestion.

References

  • Anbarci N (2006) Finite alternating-move arbitration schemes and the equal area solution. Theory Decis 61:21–50

    Article  Google Scholar 

  • Barberà S, Coelho D (2022) Compromising on compromise rules. RAND J Econ. https://doi.org/10.1111/1756-2171.12401

    Article  Google Scholar 

  • Belot M, Duch R, Miller L (2015) A comprehensive comparison of students and non-students in classic experimental games. J Econ Behav Organ 113:26–33

    Article  Google Scholar 

  • Bermant G, Shapard J (1981) The voir dire examination, juror challenges, and adversary advocacy. In: Sales BD (ed) The trial process. Springer, Boston, pp 69–114

    Chapter  Google Scholar 

  • Bloom D, Cavanagh C (1986) An analysis of the selection of arbitrators. Am Econ Rev 76(3):408–422

    Google Scholar 

  • Bol D, Labbé St-Vincent S, Lavoie J-M (2016) Recruiting for laboratory voting experiments: exploring the (potential) sampling bias. In: Blais A, Laslier J-F, Van der Straeten K (eds) Voting experiments. Springer, Cham, pp 271–286

    Chapter  Google Scholar 

  • Brams SJ, Kilgour DM (2001) Fallback bargaining. Group Decis Negot 10:287–316

    Article  Google Scholar 

  • Camerer CF, Dreber A, Forsell E, Ho T-H, Huber J, Johannesson M, Kirchler M, Almenberg J, Altmejd A, Chan T (2016) Evaluating replicability of laboratory experiments in economics. Science 351(6280):1433–1436

    Article  Google Scholar 

  • Camerer CF, Nave G, Smith A (2019) Dynamic unstructured bargaining with private information: theory, experiment, and outcome prediction via machine learning. Manag Sci 65(4):1867–1890

    Article  Google Scholar 

  • Carpenter J, Connolly C, Myers CK (2008) Altruistic behavior in a representative dictator experiment. Exp Econ 11(3):282–298

    Article  Google Scholar 

  • Congar R, Merlin V (2012) A characterization of the maximin rule in the context of voting. Theory Decis 72(1):131–147

    Article  Google Scholar 

  • De Clippel G, Eliaz K (2012) Reason-based choice: A bargaining rationale for the attraction and compromise effects. Theor Econ 7(1):125–162

    Article  Google Scholar 

  • De Clippel G, Eliaz K, Knight B (2014) On the selection of arbitrators. Am Econ Rev 104:3434–3458

    Article  Google Scholar 

  • Dutta B, Sen A (1991) A necessary and sufficient condition for two-person Nash implementation. Rev Econ Stud 58:121–128

    Article  Google Scholar 

  • Dutta B, Sen A (2012) Nash implementation with partially honest individuals. Games Econ Behav 74:154–169

    Article  Google Scholar 

  • Falk A, Meier S, Zehnder C (2013) Do lab experiments misrepresent social preferences? The case of self-selected student samples. J Eur Econ Assoc 11(4):839–852

    Article  Google Scholar 

  • Fischbacher U (2007) z-tree: Zurich toolbox for ready-made economic experiments. Exp Econ 10(2):171–178

    Article  Google Scholar 

  • Flanagan FX (2015) Peremptory challenges and jury selection. J Law Econ 58(2):385–416

    Article  Google Scholar 

  • Galeotti F, Montero M, Poulsen A (2019) Efficiency versus equality in bargaining. J Eur Econ Assoc 17(6):1941–1970

    Article  Google Scholar 

  • Güth W, Schmittberger R, Schwarze B (1982) An experimental analysis of ultimatum bargaining. J Econ Behav Organ 3(4):367–388

    Article  Google Scholar 

  • Harsanyi JC (1956) Approaches to the bargaining problem before and after the theory of games: a critical discussion of Zeuthen’s, Hicks’, and Nash’s theories. Econometrica 24:144–157

    Article  Google Scholar 

  • Harsanyi JC (1961) On the rationality postulates underlying the theory of cooperative games. J Confl Resolut 5(2):179–196

    Article  Google Scholar 

  • Hurwicz L, Schmeidler D (1978) Construction of outcome functions guaranteeing existence and Pareto optimality of Nash equilibria. Econometrica 46:1447–1474

    Article  Google Scholar 

  • Hurwicz L, Sertel MR (1999) Designing mechanisms, in particular for electoral systems: the majoritarian compromise. In: Sertel Murat R (ed) Economic design and behaviour. MacMillan, London

    Google Scholar 

  • Kıbrıs O, Sertel MR (2007) Bargaining over a finite set of alternatives. Soc Choice Welf 28:421–437

    Article  Google Scholar 

  • Laslier J-F, Núñez M, Sanver R (2021) A solution to the two-person implementation problem. J Econ Theory 194:105261

    Article  Google Scholar 

  • Li S (2017) Obviously strategy-proof mechanisms. Am Econ Rev 107(11):3257–3287

    Article  Google Scholar 

  • Maskin E (1999) Nash equilibrium and welfare optimality. Rev Econ Stud 66:23–38

    Article  Google Scholar 

  • Moore J, Repullo R (1990) Nash implementation: a full characterization. Econometrica 58:1083–1099

    Article  Google Scholar 

  • Nash JF (1950) The bargaining problem. Econometrica 18:155–162

    Article  Google Scholar 

  • Nash JF (1953) Two-person cooperative games. Econometrica 21:128–140

    Article  Google Scholar 

  • Perry M, Reny PJ (1999) A general solution to King Solomon’s dilemma. Games Econ Behav 26(2):279–285

    Article  Google Scholar 

  • Rubinstein A (1982) Perfect equilibrium in a bargaining model. Econometrica 50:97–109

    Article  Google Scholar 

  • Sprumont Y (1993) Intermediate preferences and Rawlsian arbitration rules. Soc Choice Welf 10:1–15

    Article  Google Scholar 

  • Van der Linden M (2018) Bounded rationality and the choice of jury selection procedures. J Law Econ 61(4):711–738

    Article  Google Scholar 

  • Zeuthen F (1930) Problems of monopoly and economic warfare, vol 25. Routledge, Abingdon

    Google Scholar 

Download references

Acknowledgements

We would like to thank Kfir Eliaz, Remzi Sanver, and Marie-Claire Villeval for useful remarks, as well as seminar participants in Berlin and Montpellier. This paper also benefited from comments and remarks from three anonymous referees. Financial support from the projects IDEX ANR-10-IDEX-0001-02 PSL MIFID, ANR-11-IDEX-0003/Labex Ecodec/ANR-11-LABX-0047 and EUR grant ANR-17-EURE-0001 is gratefully acknowledged.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Matías Núñez.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Electronic supplementary material

Below is the link to the electronic supplementary material.

Supplementary file1 (DOCX 27 kb)

Appendices

Appendix

A. Equilibria of the Gradual Vetoes Mechanism

This section shows that the subgame-perfect equilibrium outcomes of the gradual vetoes mechanism coincide with the FB options in the profiles used in the experiment. The game we are considering is an extensive form game with complete information and simultaneous moves, and the definition of subgame-perfect equilibrium is standard: it is a strategy profile that generates a Nash equilibrium in each subgame.

The main result of this section holds under two assumptions: (i) players only use weakly undominated strategies and (ii) their preferences over lotteries satisfy stochastic dominance. Ruling out weakly undominated strategies implies that, at each stage, no player casts a veto against her best available option on the stage. Stochastic dominance is satisfied by most preference extensions in the literature. It simply requires that, when comparing two lotteries, a shift in probability to strictly preferred options yields strictly preferred lotteries. As in the case of subgame perfect equilibrium, we do not include its formal definition since it is standard.

Before laying out the analysis of the four profiles, we fully describe the outcomes with only two and three options since this will be useful in the sequel.

  1. 1.

    Two options

With two options, only four preference profiles are possible: (i) \(a \succ_{i} b\) for \(i\) = 1, 2, (ii) \(b \succ_{i} a\) for \(i\) = 1, 2, (iii) \(a \succ_{1} b\) and \(b \succ_{2} a\) and (iv) \(b \succ_{1} a\) and \( a \succ_{2} b\). Since every player vetoes her worst option since this the only weakly non-dominated strategy, it follows that in profiles (i) and (ii), the only equilibrium outcome is the unanimously preferred option whereas in profiles (iii) and (iv) the only outcome is the lottery \(uni\left( {a, b} \right).\)

  1. 2.

    Three options

Each equilibrium selects a unique FB option and the set of equilibrium outcomes corresponds to the set of FB options. W.l.o.g we fix \(a\)1 \(b\)1 \(c\) and consider the different preferences of player 2. This is possible since the game is symmetric so permuting the name of the options would give the corresponding payoff matrix and equilibrium outcome.

When \(a\)2 \(b\)2 \(c\) and when \(a\)2 \(c\)2 \(b\), \(a\) is the unique equilibrium outcome since the payoff matrix equals:

 

b

c

b

a

a

c

a

a

When \(b\)2 \(a\)2 \(c\), both \(a\) and \(b\) are equilibrium outcomes whereas \(b\) is the only equilibrium outcome when b2 c2 a as one deduces from the payoff matrix:

 

a

c

b

c

a

c

b

uni(a,b)

Finally, when \(c\)2 \(a\)2 \(b\), the unique equilibrium outcome is \(a\) whereas when \(c\)2 \(b\)2 \(a\), only b is selected in equilibrium as one can see in the next payoff matrix:

 

a

b

b

c

uni(a,c)

c

b

a

  1. 3.

    Profile A0

In this profile \(a\)1 \( b\)1 \( c\)1 \( d\)1 \( e\) and \(e\)2 \( d\)2 \( c\)2 \(b\)2 \( a\). The matrix of the game is as follows:

 

a

b

c

d

b

d

\({\Gamma }\left( {a,c,d,e} \right)\)

d

c

c

d

d

\({\Gamma }\left( {a,b,d,e} \right)\)

b

d

c

c

b

\({\Gamma }\left( {a,b,c,e} \right)\)

e

c*

c

b

b

It follows that \(c\) is the unique equilibrium outcome with the strategy \( \left( {e, a} \right)\) being an equilibrium. This outcome is independent of the outcomes of the subgames that involve 4 options, analyzed in the sequel.

\(\Gamma \left( {a,c,d,e} \right)\): This game admits a unique equilibrium (e, a) with outcome \(uni\left( {c, d} \right)\) with preferences \(a\)1 \( c\)1 \( d\)1 \( e\) and \(e\)2 \( d\)2 \( c\)2 \( a\). Its matrix is as follows.

 

a

d

e

c

d or e

d

uni(a,e)

d

uni(c,e)

uni(a,e)

c

e

uni(c,d)

uni(a,d)

uni(a,c)

\(\Gamma \left( {a,b,d,e} \right)\): This game admits a unique equilibrium \(\left( {e, a} \right)\) with outcome \(uni\left( {b, d} \right)\) since restricted preferences are given by \(a\)1 \(b\)1 \(d\)1 \( e\) and \(e\)2 \(d\)2 \(b\)2 \(a\) as the following matrix shows:

 

a

b

d

b

uni(d,e)

d

uni(a,e)

d

uni(b,e)

uni(a,e)

b

e

uni(b,d)

uni(a,d)

uni(a,b)

\(\Gamma \left( {a,b,c,e} \right)\): This game admits a unique equilibrium \( \left( {e, a} \right)\) with outcome \(uni\left( {b, c} \right)\) as preferences over \(\left( {a, b, c, e} \right) \) are given by \(a\)1 \( b\)1 \( c\)1 \(e\) and \(e\)2 \(c\)2 \(b\)2 \( a\).

 

a

b

c

b

uni(c,e)

c

uni(a,e)

c

uni(b,e)

uni(a,e)

b

e

uni(b,c)

uni(a,c)

uni(a,b)

  1. 4.

    Profile A2

In this profile \(a\)1 \(b\)1 \( c\)1 \(d\)1 \( e\) and \(c\)2 \(b\)2 \(a\)2 \(d\)2 \(e\). The matrix of the game is as follows:

 

b

a

d

e

b

\({\Gamma }\left( {a,c,d,e} \right)\)

\(c\)

a or c

a or c

c

a

b

a or b

a or b

d

a or c

b or c

\({\Gamma }\left( {a,b,c,e} \right)\)

b

e

a or c

b or c

b

\({\Gamma }\left( {a,b,c,d} \right)\)

The equilibria for the subgames that with 4 non-vetoed options are determined in the sequel; their outcome is irrelevant to prove that b is the unique equilibrium outcome. For instance, the strategy (c, a) is an equilibrium.

\(\Gamma \left( {a,c,d,e} \right)\): This game admits two equilibrium outcomes, \(a\) or \(c\), since restricted preferences are \(a\)1 \( c\)1 \( d\)1 \(e\) and \(c\)2 \(a\)2 \(d\)2 \(e\), as one can deduce from the following matrix.

 

a

d

e

c

d

a

a

d

c

a or c

uni(a,c)

e

c

uni(a,c)

a or c

\(\Gamma \left( {a,b,c,e} \right)\): This game admits \(\left( {c, a} \right)\) which leads to \(b\) as the unique equilibrium as implied by the preferences \(a\)1 \( b\)1 \( c\)1 \(e\) and \(c\)2 \( b\)2 \(a\)2 \(e\), as the matrix shows.

 

a

b

e

b

c

a or c

uni(a,c)

c

b

a

uni(a,b)

e

uni(b,c)

uni(a,c)

b

\(\Gamma \left( {a,b,c,d} \right)\): This game admits \(\left( {c, a} \right)\) with outcome \(b\) as the unique equilibrium as implied by preferences \(a\)1 \(b\)1 \(c\)1 \( d\) and \(c\)2 \(b\)2 \( a\)2 \(d\).

 

a

b

d

b

c

a or c

uni(a,c)

c

b

a

uni(a,b)

d

uni(b,c)

uni(a,c)

b

  1. 5.

    Profile A3

In this profile \(a\)1 \(b\)1 \(c\)1 \(d\)1 \(e\) and \(b\)2 \( a\)2 \( c\)2 \(d\)2 \(e\). The matrix of the game is as follows:

 

a

c

d

e

b

\({\Gamma }\left( {c,d,e} \right)\)

\({\Gamma }\left( {a,d,e} \right)\)

\({\Gamma }\left( {a,c,e} \right)\)

\({\Gamma }\left( {a,c,d} \right)\)

c

\({\Gamma }\left( {b,d,e} \right)\)

\({\Gamma }\left( {a,b,d,e} \right)\)

\({\Gamma }\left( {a,b,e} \right)\)

\({\Gamma }\left( {a,b,d} \right)\)

d

\({\Gamma }\left( {b,c,e} \right)\)

\({\Gamma }\left( {a,b,e} \right)\)

\({\Gamma }\left( {a,b,c,e} \right)\)

\({\Gamma }\left( {a,b,c} \right)\)

e

\({\Gamma }\left( {b,c,d} \right)\)

\({\Gamma }\left( {a,b,d} \right)\)

\({\Gamma }\left( {a,b,c} \right)\)

\({\Gamma }\left( {a,b,c,d} \right)\)

where \(\Gamma (X\)) stands for the subgame where players bargain over \(X\). Whenever \(X\) has three options, the outcome is determined directly by the analysis in Section A.2. This directly implies that the payoff matrix can be simplified as follows:

 

a

c

d

e

b

c

a*

a

\(a\)

c

b*

\({\Gamma }\left( {a,b,d,e} \right)\)

a or b

a or b

d

b

\(a{\text{ or }}b\)

\({\Gamma }\left( {a,b,c,e} \right)\)

a or b

e

b

\(a{\text{ or }}b\)

\(a{\text{ or }}b\)

\({\Gamma }\left( {a,b,c,d} \right)\)

The subgames that involve 4 options are determined in the sequel. Each of these subgames admits an equilibrium; moreover, their equilibrium outcome is irrelevant to determine the set of equilibrium outcomes over the whole game. It follows that the equilibrium outcomes are \(a\) (sustained by the profile \(\left( {b, c} \right)\)) and \(b\) (sustained by the profile \(\left( {c, a} \right)\)), as wanted.

\(\Gamma \left( {a,b,d,e} \right)\): This game admits two equilibrium outcomes, \(a\) and \(b\), with the restricted preferences \(a\)1 \(b\)1 \( d\)1 \(e\) and \(b\)2 \(a\)2 \(d\)2 \(e\). The payoff matrix is as follows.

 

a

d

e

b

d

a

a

d

b

a or b

uni(a,b)

e

b

uni(a,b)

a or b

\(\Gamma \left( {a,b,c,e} \right)\): This game admits two equilibrium outcomes, a or b, with the restricted preferences \(a\)1 \(b\)1 \( c\)1 \( e\) and \(b\)2 \(a\)2 \(c\)2 \(e\).

 

a

c

e

b

c

a

a

c

b

a or b

uni(a,b)

e

b

uni(a,b)

a or b

\(\Gamma \left( {a,b,c,d} \right)\): This game admits two equilibrium outcomes, \(a\) or \(b\), with the restricted preferences \(a\)1 \( b\)1 \( c\)1 \(d\) and \(b\)2 \( a\)2 \( c\)2 \(d\).

 

a

c

d

b

c

a

a

c

b

a or b

uni(a,b)

d

b

uni(a,b)

a or b

  1. 6.

    Profile A5

In this profile ai bi ci di e for \(i\) = 1, 2. The restriction that players rule out weakly dominated strategies implies that neither of the players vetoes \(a\) at any stage. Thus, the only outcome of the game is \(a\) since in any subgame \(a\) is always unanimously preferred and hence never vetoed.

B. Coordination Patterns in Experimental Sessions

In each of the experiments analyzed in this paper, the subjects play together for a certain number of rounds. It is thus possible that they learn how to play a strategy that increases their payoff during the experiment. Consequently, the results of games played in the first rounds of the experiment may differ from the ones in the last rounds. The tables below report the results of the experimental session by distinguishing the games happening at the beginning of the sessions and those at the end. In doing so, we aim to identify possible coordination and learning patterns between subjects.

3.1 B.1. Coordination Patterns with the Non-Symmetric Shortlisting Mechanism

In the data of De Clippel et al. (2014), there are 40 rounds in each session. To identify coordination patterns between subjects, we reproduce Tables 3 and 4 of the main text by splitting the sample in two: the games played in the 20 first rounds of the session on the one hand and those played in the 20 last rounds on the other. In our data, there are also 40 rounds per session, so we use the same split-sample strategy. Note however that the preference profile A0 was always played first. so there is an empty cell for this profile in the rows for the 20 last rounds.

We find some coordination patterns between subjects, but only a few are systematic across preference profiles. The patterns are indeed quite different depending on the profile: in some, efficiency increases and inequality decreases as the experiment advances (e.g. Pf5), in others, this pattern is reversed (e.g., A2). The most systematic pattern deals with the first-mover advantage: the first-mover advantage tends to increase as the experiment progresses in both De Clippel et al. (2014) and our data. This pattern is observed in virtually all profiles. It suggests that subjects learn how to take advantage of their position during the experiment.

 

Efficiency

Inequality

 

20 first rounds

20 last rounds

20 first rounds

20 last rounds

A0

20.00

20.00

3.00

1.90

A2

27.96

27.55

5.92

6.35

A3

34.62

34.25

4.87

4.83

Pf5

25.40

26.56

8.15

7.56

  1. Coordination efficiency and inequality in De Clippel et al. (2014).
 

First-mover advantage

 

20 first rounds

20 last rounds

A0

− 1.17

− 1.20

A2

2.92

4.05

A3

1.72

3.62

Pf5

0.60

5.27

  1. First-mover advantage in De Clippel et al. (2014).
 

Efficiency

Inequality

 

20 first rounds

20 last rounds

20 first rounds

20 last rounds

A0

20.00

 

2.50

 

A2

29.00

26.75

2.87

2.75

A3

30.25

30.55

3.65

3.89

A5

38.00

38.05

0.00

0.00

  1. Efficiency and inequality in our data (20 first vs. 20 last rounds).
 

First-mover advantage

 

20 first rounds

20 last rounds

A0

− 0.43

 

A2

− 1.62

0.45

A3

0.15

1.39

A5

0.00

0.00

  1. First-mover advantage in our data (20 first vs. 20 last rounds).

3.2 B.2. Coordination Patterns with Alternative Mechanisms

We reproduce the results of Table 5 of the text using the same sample split-sample strategy as above. Again, we do not find much pattern of coordination between subjects as the experimental session advance. The only (mild) pattern that we find is for the simultaneous mechanism: efficiency and but also inequality increase as the experiment progresses. This suggests that subjects managed to coordinate and learn how to play the most profitable strategy for them as the experiment advanced. Note however that these increases are small, and cannot be found for the gradual vetoes mechanism.

 

Efficiency

Inequality

 

20 first rounds

20 last rounds

20 first rounds

20 last rounds

A0

20.00

 

3.07

 

A2

27.40

28.61

3.70

3.50

A3

27.37

28.77

3.00

3.32

A5

35.50

35.00

0.00

0.00

  1. Efficiency and inequality with the simultaneous mechanism (20 first vs. 20 last rounds).
 

Efficiency

Inequality

 

20 first rounds

20 last rounds

20 first rounds

20 last rounds

A0

20.00

 

3.04

 

A2

26.78

27.11

0.78

1.55

A3

31.72

28.75

4.17

3.30

A5

38.89

39.83

0.00

0.00

  1. Efficiency and inequality with the gradual vetoes mechanism (20 first vs. 20 last rounds).

3.3 B.3. Full Results

The table below presents the full results of our experimental sessions. It gives the selection rate of each option, \(a\), \(b\), \(c\),\( d\), and \(e\), under each profile of preferences and mechanism.

 

Shorlisting (%)

Simultaneous (%)

Gradual Vetoes (%)

A0

a

2.50

5.36

4.44

b

5.36

9.29

10.74

c

81.79

76.43

75.93

d

6.07

7.14

7.04

e

4.29

1.79

1.85

A2

a

13.21

17.86

5.56

b

60.00

56.07

74.44

c

14.64

17.86

7.41

d

10.36

6. 43

7.78

e

1.79

1.79

4.81

A3

a

47.50

30.71

32.96

b

28.57

33.93

38.89

c

15.71

25.00

20.00

d

6.79

7.50

5.93

e

1.43

2.86

2.22

A5

a

90.71

70.71

96.30

b

2.14

15.71

2.59

c

5.00

9.64

1.11

d

1.07

2.50

0.00

e

1.07

1.43

0.00

  1. Rates at which each option is selected in each profile and each mechanism in our data.

C. First-Mover Advantage in Alternative Mechanisms

The table below presents the first-mover advantage for the alternative mechanisms. Unsurprisingly, we do not find any effect given that, in these mechanisms, which subject play “first" or “second" is purely artificial. They indeed both play at the same time. Yet, for coding purposes, there is a first and a second-mover in our Z-tree program. This is what we use in the analysis below.

 

Simultaneous

Gradual Vetoes

A0

0.93

0.89

A2

0.00

− 0.19

A3

− 0.16

− 0.30

A5

0.00

0.00

  1. First-mover advantage in alternative mechanisms. Entries are average differences between the payoff of the first-mover and the payoff of the second-mover in our data.

D. Analysis of Data from the CREST Lab

For our data, we conducted 6 experimental sessions: 3 in the PSE lab and 6 in the CREST lab. To discard any possibility to our results are driven by a lab effect, we reproduce Table 5 by focusing on data coming from sessions organized in the CREST lab. All three mechanisms were covered in the sessions of the CREST lab whereas only the non-symmetric shortlisting mechanism was covered in the PSE lab. Focusing on data from the CREST lab, we still have 400 games for the simultaneous mechanism (1 session), 800 games for the simultaneous mechanism (2 sessions), and 1080 games for the gradual vetoes mechanism (3 sessions).

 

Shorlisting

Simultaneous

Gradual

 

Efficiency

Inequality

Efficiency

Inequality

Efficiency

Inequality

A0

20.00

2.60

20.00

(.)

2.95

(0.62)

20.00

(.)

(.)

3.04

(0.52)

(0.87)

A2

26.10

1.30

27.75

(0.08)

3.15

(0.00)

27.00

(0.36)

(0.29)

1.30

(0.99)

(0.00)

A3

28.80

3.40

28.77

(0.98)

3.32

(0.8)

29.74

(0.38)

(0.26)

3.59

(0.47)

(0.21)

A5

38.00

0.00

35.25

(0.00)

0.00

(.)

39.52

(0.00)

(0.00)

0.00

(.)

(.)

  1. Entries are means using CREST experimental data only. In parentheses are p-values of t-tests testing the equality of means between shortlisting versus simultaneous/gradual (first row of parentheses) and between simultaneous versus gradual (second row of parentheses) (two-tailed). N per cell = 100 (shortlisting), 200 (simultaneous), 270 (gradual).

The results are going in the same direction as those that include data from both labs: the results of the gradual vetoes mechanism are not statistically significantly different from those of the non-symmetric shortlisting mechanism, and when they are it is the gradual vetoes mechanism that performs better (i.e. profile A5). By contrast, the performance of the simultaneous mechanism is generally poorer than the non-symmetric shortlisting and gradual vetoes mechanisms (e.g., profile A5) although differences are not always statistically significant due to the relatively low number of observations.

E. Regression Analysis

In our experiment, subjects are grouped by sessions. To account for the non-independence among the sessions and their effects on p-values, we reproduce Table 5 using an OLS regression framework, in which we cluster standard errors by session. The regression model is the following:

$$ Y_{ij} = {\text{A}} + {\text{B}}\beta_{ij} + {\text{C}}\gamma_{ij} + \epsilon_{ij} $$
(3)

where Y is efficiency (first table) or inequality (second table) of each pair of subjects \(i\) at session \(j\), \(\beta\) is a dummy variable capturing the simultaneous mechanism and \(\gamma\) a dummy variable capturing the gradual vetoes mechanism. The non-symmetric shortlisting mechanism is thus the reference category. To calculate the p-value of the difference between the simultaneous mechanism and the one with gradual vetoes, we estimate an extra OLS regression:

$$ Y_{ij} = {\text{A}} + {\text{B}}\alpha_{ij} + {\text{C}}\gamma_{ij} + \varepsilon_{ij} $$
(4)

where α is a dummy variable capturing the non-symmetric shortlisting mechanism. The reference category is thus the simultaneous mechanism. We find that results hold: differences in efficiency are statistically significant in particular for preference profiles A3 and A5, and differences in inequalities are statistically significant in profiles A2 and A3.

 

Profile A0

Profile A2

Profile A3

Profile A5

(1)

(2)

(1)

(2)

(1)

(2)

(1)

(2)

Shorlisting

(ref)

(.)

(ref)

− 0.79

(0.82)

(ref)

2.07*

(1.01)

(ref)

2.86***

(0.85)

Simultaneous

(.)

(.)

− 0.79

(0.82)

(ref)

− 2.07*

(1.02)

(ref)

− 2.86***

(0.85)

(ref)

Gradual

(.)

(.)

− 0.40

(1.05)

− 1.18

(0.90)

− 0.71

(0.94)

1.48

(0.98)

1.45

(0.88)

4.34***

(0.32)

  1. Entries are coefficients from OLS regressions predicting efficiency. In regression (1), the non-symmetric shortlisting mechanism is the reference category, in regression (2) the simultaneous mechanism is the reference category. In parentheses are standard errors clustered by session. *p < 0.1, **p < 0.05, ***p < 0.01.
 

Profile A0

Profile A2

Profile A3

Profile A5

(1)

(2)

(1)

(2)

(1)

(2)

(1)

(2)

Shortlisting

(ref)

− 0.57

(0.58)

(ref)

− 0.79

(0.92)

(ref)

0.57*

(0.30)

(ref)

(.)

Simultaneous

0.57

(0.58)

(ref)

0.79

(0.92)

(ref)

− 0.57*

(0.3)

(ref)

(.)

(ref)

Gradual

0.53

(0.64)

− 0.03

(0.65)

− 1.49

(0.82)

− 2.28***

(0.56)

− 0.21

(0.38)

0.36

(0.3)

(.)

(.)

  1. Entries are coefficients from OLS regressions predicting inequality. In regression (1), the non-symmetric shortlisting mechanism is the reference category, in regression (2) the simultaneous mechanism is the reference category. In parentheses are standard errors clustered by session. *p < 0.1, **p < 0.05, ***p < 0.01.

F. Analysis of Individual Decisions (Same Vetoes)

The table below presents the detail of individual decisions of subjects under the gradual vetoes mechanism. It shows the rate of common vetoes, i.e., vetoes that are put on the same option by both subjects at the same time, at each round of elimination: first, second, and third. Mechanically, it takes at least two rounds to reach a final selected option. 63% of all games finish there, and 96% finish after a third round. Since the numbers are too small, we do not include the fourth round in the table (depending on the profile, the N is as small as 8). We observe that the rate of common vetoes increases with the number of rounds. This is not particularly surprising given that there are fewer and fewer options available and that subjects are likely to pick the same veto, even by chance.

 

Same Vetoes

Round 1 (%)

Round 2 (%)

Round 3 (%)

A0

10

7

20

A2

17

33

46

A3

21

39

58

A5

23

30

90

  1. Entries are the rate of common vetoes at each round of elimination in the gradual vetoes mechanism.

G. Analysis of Individual Decisions (Other Strategies)

To further study the individual decisions made by subjects during the experiment, we define two intuitive veto strategies: a cautious veto and an aggressive veto. The cautious strategy consists in putting a veto on the option associated with the smallest personal payoff for the subject among the remaining options. The aggressive strategy consists in putting a veto on the option associated with the largest payoff for the opponent. The first table below reproduces Table 8 of the main text and presents the share of cautious and aggressive vetoes adopted by subjects. To make the results comparable across mechanisms, we focus on the two first vetoes put by each subject under both mechanisms. In the case of the simultaneous mechanism, this means analyzing the universe of decisions made by subjects. For the gradual vetoes mechanism, this means focusing on the two first rounds of elimination. From the first table below, we observe both strategies capture a substantial share of individual decisions. We also observe that while the share of cautious vetoes tends to be larger under the simultaneous mechanism compared to the one with gradual vetoes, the share of aggressive vetoes tends to be lower, regardless of the preference profiles. Note however that overall the individual strategies seem to follow similar patterns under both mechanisms in the sense that the share of cautious and aggressive vetoes is mostly a function of the preference profile. For example, nobody has adopted an aggressive strategy in profile A5, which is not a surprise given that both paired subjects share the same preference for the options available.

To further explore individual decisions, we construct a second table in which we report the share aggressive and cautious vetoes under the gradual vetoes mechanism at each round of elimination: first, second, and third. The most striking pattern is that, with the exception of Profile A0, the rate of cautious vetoes increases with the round of elimination, whereas the rate of aggressive vetoes decreases (at least from the first to the second elimination round). This suggests that subjects adopt a strategy of first acting aggressively, probably as they anticipate that their opponent will seek the options associated with their highest payoff, and then, as the final decision is getting closer, they secure their payoff by removing the option associated with their smallest personal payoff.

 

Simultaneous

Gradual

Cautious

Aggressive

Cautious

Aggressive

A0

86%

93%

82%

(0.01)

94%

(0.15)

A2

52%

34%

43%

(0.00)

42%

(0.00)

A3

58%

18%

50%

(0.00)

20%

(0.26)

A5

60%

0%

58%

(0.31)

0%

(.)

  1. Entries are proportions of vetoes put on the option associated with the smallest personal payoff of the subject (cautious) and on the option associated with the largest payoff of the opponent (aggressive) among the remaining options (out of two vetoes). In parentheses are p-values of t-tests testing the equality of proportions between simultaneous versus gradual. N per cell = 1120 (simultaneous), 1080 (gradual).
 

Cautious

Aggressive

Round 1 (%)

Round 2 (%)

Round 3 (%)

Round 1 (%)

Round 2 (%)

Round 3 (%)

A0

72

94

85

93

96

88

A2

31

67

95

53

32

53

A3

38

72

88

24

16

31

A5

54

69

92

0

0

0

  1. Entries are the rate of cautious and gradual vetoes at each round of elimination in the gradual vetoes mechanism.

Rights and permissions

Springer Nature or its licensor holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Bol, D., Laslier, JF. & Núñez, M. Two Person Bargaining Mechanisms: A Laboratory Experiment. Group Decis Negot 31, 1145–1177 (2022). https://doi.org/10.1007/s10726-022-09793-y

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10726-022-09793-y

Keywords

JEL Classification

Navigation