Skip to main content
Log in

(In)efficiency and equitability of equilibrium outcomes in a family of bargaining games

  • Original Paper
  • Published:
International Journal of Game Theory Aims and scope Submit manuscript

Abstract

We construct a parametric family of (modified) divide-the-dollar games: when there is excess demand, some portion of the dollar may disappear and the remaining portion is distributed in a bankruptcy problem. In two extremes, this game family captures the standard divide-the-dollar game of Nash (Econometrica 21:128–140, 1953) (when the whole dollar vanishes) and the game studied in Ashlagi et al. (Math Soc Sci 63:228–233, 2012) (when the whole dollar remains) as special cases. We first show that in all interior members of our game family, all Nash equilibria are inefficient under the proportional rule if there are ‘too many’ players in the game. Moreover, in any interior member of the game family, the inefficiency increases as the number of players increases, and the whole surplus vanishes as the number of players goes to infinity. On the other hand, we show that any bankruptcy rule that satisfies certain normatively appealing axioms induces a unique and efficient Nash equilibrium in which everyone demands and receives an equal share of the dollar. The constrained equal awards rule is one such rule.

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. In addition to its stand-alone usage, it also appears in more sophisticated dynamic models, such as models of costly commitment (e.g., Ellingsen and Miettinen 2008 and Basak and Deb 2020).

  2. Leininger et al. (1989) showed the existence of inefficient equilibria in a sealed-bid bargaining game with incomplete information.

  3. Abreu and Pearce (2015) formalized and completed Nash’s treatment of perturbation functions. Along similar lines, Anbarci et al. (2019) provided support for the asymmetric Nash bargaining solutions as well.

  4. To the best of our knowledge, only Carlsson (1991) treated the case where the sum of demands is less than the dollar. Using an ad-hoc surplus partition rule, the author showed that the way the remainder is allocated can influence the equilibrium in a bargaining game where players can make errors.

  5. There are also papers that modify the game in other ways, which cannot be classified together under one title (see Andreozzi 2010; Rasmusen 2019).

  6. For excellent reviews of this literature, the reader is referred to Moulin (2002) and Thomson (2003, 2015, 2019).

  7. The free-riding tendency observed here is similar to the ‘cheating’ tendency observed in a model of tacit collusion with Cournot competition: given that all the other firms stick to their quotas, a firm’s best response is to produce more than its quota despite the fact that this will lead to an equilibrium price lower than the monopoly price. The reason is that the gains from an increased production compensates the losses from a decreased price.

  8. Stovall (2014) calls the same axiom “independence of irrelevant alternatives”.

  9. The authors introduce the axiom under the name of “exemption”. We use the name given in Thomson (2019).

  10. As it can be seen from our proof, one needs to find a profitable deviation from any inefficient strategy profile to prove such a result. Since CDI is only concerned with payoff invariance, it cannot be sufficient to find an increase in payoff after an individual deviation. From this perspective, FCCSEM could be sufficient for the claimed result, however since \({\mathcal {P}}\) satisfies FCCSEM but not CDI (see Stovall 2014; Thomson 2019), and since it is shown in this paper that an inefficient Nash equilibrium is possible under that rule, we can conclude that FCCSEM is also not sufficient for this result.

  11. The converse result does not hold, since another bankruptcy rule that satisfies all three axioms can be constructed. As an example, consider a rule that operates as follows: In any given bankruptcy problem (cE), let \(i^* \in N\) be the agent who has the maximum claim among all agents \(i \in N\) with \(c_i \le \frac{E}{n}\). The rule awards \(c_i\) to any agent \(i \in N\) with \(c_i \le c_{i^*}\) and awards \(c_{i^*}\) to any agent j with \(c_j > c_{i^*}\). If there is some excess surplus, then it is given to the latter type of agents by using a weighted gains rule (as in Moulin 2000).

  12. The reader is referred to the Appendix for the independence of these axioms.

References

  • Abreu D, Pearce D (2015) A dynamic reinterpretation of Nash bargaining with endogenous threats. Econometrica 83:1641–1655

    Google Scholar 

  • Anbarci N (2001) Divide-the-dollar game revisited. Theory Decis 50:295–304

  • Anbarci N, Rong K, Roy J (2019) Random-settlement arbitration and the generalized Nash solution: one-shot and infinite-horizon cases. Econ Theory 68:21–52

    Google Scholar 

  • Andreozzi L (2010) An evolutionary theory of social justice: choosing the right game. Eur J Polit Econ 26:320–329

    Google Scholar 

  • Ashlagi I, Karagözoğlu E, Klaus B-E (2012) A non-cooperative support for equal division in estate division problems. Math Soc Sci 63:228–233

    Google Scholar 

  • Basak D, Deb J (2020) Gambling over public opinion. Am Econ Rev 110:3492–3521

    Google Scholar 

  • Bolton GE (1997) The rationality of splitting equally. J Econ Behav Org 32:365–381

    Google Scholar 

  • Bossert W, Tan G (1995) An arbitration game and the egalitarian bargaining solution. Soc Choice Welf 12:29–41

    Google Scholar 

  • Brams SJ, Taylor AD (1994) Divide the dollar: three solutions and extensions. Theory Decis 37:211–231

    Google Scholar 

  • Carlsson H (1991) A bargaining model where parties make errors. Econometrica 59:1487–1496

    Google Scholar 

  • Cetemen ED, Karagözoğlu E (2014) Implementing equal division with an ultimatum threat. Theory Decis 77:223–236

    Google Scholar 

  • Chun Y (1989) A noncooperative justification for egalitarian surplus sharing. Math Soc Sci 17:245–261

    Google Scholar 

  • Dizarlar A, Karagözoğlu E (2021) Kantian equilibria of a class of Nash bargaining games. Working paper

  • Dutta R (2012) Bargaining with revoking costs. Games Econ Behav 74:144–153

    Google Scholar 

  • Ellingsen T, Miettinen T (2008) Commitment and conflict in bilateral bargaining. Am Econ Rev 98:1629–1635

    Google Scholar 

  • García-Jurado I, González-Díaz J, Villar A (2006) A non-cooperative approach to bankruptcy problems. Span Econ Rev 8:189–197

    Google Scholar 

  • Habis H, Herings PJJ (2013) Stochastic bankruptcy games. Int J Game Theory 42:973–988

    Google Scholar 

  • Hagiwara M, Hanato S (2021) A strategic justification of the constrained equal awards rule through a procedurally fair multilateral bargaining game. Theory Decis 90:233–243

    Google Scholar 

  • Herrero C, Villar A (2001) The three musketeers: four classical solutions to bankruptcy problems. Math Soc Sci 42:307–328

    Google Scholar 

  • Karagözoğlu E, Rachmilevitch S (2018) Implementing egalitarianism in a class of Nash demand games. Theory Decis 85:495–508

    Google Scholar 

  • Kıbrıs Ö, Kıbrıs A (2013) On the investment implications of bankruptcy laws. Games Econ Behav 80:85–99

    Google Scholar 

  • Leininger W, Linhart PB, Radner R (1989) Equilibria of the sealed-bid mechanism for bargaining with incomplete information. J Econ Theory 48:63–106

    Google Scholar 

  • Li J, Ju Y (2016) Divide and choose: a strategic approach to bankruptcy problems. Mimeo, New York

    Google Scholar 

  • Moulin H (2000) Priority rules and other asymmetric rationing methods. Econometrica 68:643–684

    Google Scholar 

  • Moulin H (2002) Axiomatic cost and surplus sharing. In: Arrow K, Sen A, Suzumura K (eds) Handbook of social choice and welfare, vol 1. Elsevier, Amsterdam

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  • Nydegger RV, Owen G (1975) Two person bargaining: an experimental test of Nash axioms. Int J Game Theory 3:239–249

    Google Scholar 

  • Rachmilevitch S (2017) Punishing greediness in divide-the-dollar games. Theory Decis 82:341–351

    Google Scholar 

  • Rachmilevitch S (2020a) An implementation of the Nash bargaining solution by iterated strict dominance. Econ Lett 188:108960

    Google Scholar 

  • Rachmilevitch S (2020b) Rewarding moderate behavior in a dynamic Nash demand game. Int J Game Theory 49:639–650

    Google Scholar 

  • Rasmusen E (2019) Back to bargaining basics: a breakdown model for splitting a pie. Mimeo, New York

    Google Scholar 

  • Roth A, Malouf MWK (1979) Game theoretic models and the role of information in bargaining. Psychol Rev 86:574–594

    Google Scholar 

  • Schelling TC (1960) The strategy of conflict. Harvard University Press, Cambridge

    Google Scholar 

  • Skyrms B (1996) Evolution of the social contract. Cambridge University Press, Cambridge

    Google Scholar 

  • Sonn S (1992) Sequential bargaining for bankruptcy problems. Mimeo, New York

    Google Scholar 

  • Stovall J (2014) Collective rationality and monotone path division rules. J Econ Theory 154:1–24

    Google Scholar 

  • Thomson W (2003) Axiomatic and game-theoretic analysis of bankruptcy and taxation problems: a survey. Math Soc Sci 45:249–297

    Google Scholar 

  • Thomson W (2015) Axiomatic and game-theoretic analysis of bankruptcy and taxation problems: an update. Math Soc Sci 74:41–59

    Google Scholar 

  • Thomson W (2019) How to divide when there isn’t enough: from Aristotle, the Talmud, and Maimonides to the axiomatics of resource allocation. Cambridge University Press, Cambridge

    Google Scholar 

  • Tsay M-H, Yeh C-H (2019) Relations among the central rules in bankruptcy problems: a strategic perspective. Games Econ Behav 113:515–532

    Google Scholar 

  • Van Huyck J, Battalio R, Mathur S, Van Huyck P (1995) On the origin of convention: evidence from symmetric bargaining games. Int J Game Theory 24:187–212

    Google Scholar 

  • Young PH (1993) An evolutionary model of bargaining. J Econ Theory 59:145–168

    Google Scholar 

Download references

Acknowledgements

We would like to thank the associate editor, two anonymous reviewers, Nejat Anbarci, and Shiran Rachmilevitch for useful comments and suggestions. We also thank Tara Sylvestre for language editing. The authors do not have any competing interests to declare. The usual disclaimers apply.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Emin Karagözoğlu.

Additional information

Publisher's Note

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

Appendix

Appendix

This Appendix shows that, in Corollary 4.4, none of our axioms is implied by the other two axioms.

\(\diamond\) A rule that satisfies CDI and EDCFC, but not FCCSEM: Let \({\dot{R}}\) be a weighted gains rule for some vector of positive weights, \(w = \left( w_1, \ldots , w_n\right)\) (see Moulin 2000). As such, for any bankruptcy problem (cE), we have \({\dot{R}}_i(c,E) = \min \{\lambda w_i, c_i\}\) for every \(i \in N\) where \(\lambda\) is such that \(\sum _{i \in N} {{\dot{R}}_i (c,E)} = E\).

The rule \({\dot{R}}\) satisfies CDI, because any agent \(i \in N\) with \({\dot{R}}_i(c,E) < c_i\) collects an award of \(\lambda w_i\). After a decrease in his claim to some \(c'_i \ge {\dot{R}}_i(c,E)\), it can be seen that \(\min \{\lambda w_i, c'_i\} = \lambda w_i\), so that his award does not change. The rule \({\dot{R}}\) also satisfies FCCSEM, because any increase in the endowment amount increases \(\lambda\), so that all unsatisfied agents become better-off.

However, \({\dot{R}}\) does not satisfy EDCFC for the weights vector \(w = (1,2,3,4)\). For that, consider an example with \(N= \{1,2,3,4\}\), \(c=(20, 40, 60, 80)\), and \(E = 100\). Then, \(\lambda\) is found to be 10, so that the awards vector is \({\dot{R}}(c,E) = (10,20,30,40)\). But now, although \(c_1 = 20 < 25 = \frac{100}{4} = \frac{E}{n}\), we have \({\dot{R}}_1(c,E) = 10 < c_1\).

\(\diamond\) A rule that satisfies CDI and EDCFC, but not FCCSEM: Let \({\bar{R}}\) be defined as follows. In any given bankruptcy problem (cE), let \(i^* \in N\) be the agent who has the maximum claim among all agents \(i \in N\) with \(c_i \le \frac{E}{n}\). The rule \({\bar{R}}\) awards \(c_i\) to any agent \(i \in N\) with \(c_i \le c_{i^*}\) and awards \(c_{i^*}\) to any agent j with \(c_j > c_{i^*}\). If there is some excess surplus, then it is given to the remaining agents lexicographically following an order of their index numbers. That is, the remaining surplus is given to agent 1 until his award reaches his claim; if there is still some excess surplus, it is given to agent 2 until his award reaches his claim; and so on.

The rule \({\bar{R}}\) satisfies CDI, because any agent \(i \in N\) with \({\bar{R}}_i(c,E) < c_i\) needs to have \(c_i > c_{i^*}\), so that after he collects \(c_{i^*}\), the rest of his award was given according to his index number. Given that he is unsatisfied, a decrease in his claim to some \(c'_i \ge {\bar{R}}_i(c,E)\) cannot change his award. The rule \({\bar{R}}\) also satisfies EDCFC, by definition.

However, \({\bar{R}}\) does not satisfy FCCSEM. For that, consider an example with \(N= \{1,2,3,4\}\), \(c=(10, 60, 20, 90)\), and \(E = 100\). Then, from the first part of the rule definition, we know that \(i^* = 3\), so that agents collect (10, 20, 20, 20) at first. The excess surplus is 30. It cannot be given to agent 1 since he is already fully compensated. It is then given to agent 2, and since there is no surplus left, the process stops here. We find that \({\bar{R}}(c,E) = (10, 50, 20, 20)\). Now, if we increase the surplus to \(E' = 105\), following similar steps, we can find \({\bar{R}}(c,E') = (10, 55, 20, 20)\). But then, although \({\bar{R}}_4(c,E) < c_4\), we have \({\bar{R}}_4(c,E') = {\bar{R}}_4(c,E)\).

\(\diamond\) A rule that satisfies FCCSEM and EDCFC, but not CDI: Let \({\tilde{R}}\) be defined as follows. In any given bankruptcy problem (cE), let \(i^* \in N\) be the agent who has the maximum claim among all agents \(i \in N\) with \(c_i \le \frac{E}{n}\). The rule \({\tilde{R}}\) awards \(c_i\) to any agent \(i \in N\) with \(c_i \le c_{i^*}\) and awards \(c_{i^*}\) to any agent j with \(c_j > c_{i^*}\). If there is some excess surplus, then it is given to the latter type of agents by using the proportional rule.

The rule \({\tilde{R}}\) satisfies FCCSEM, because any agent \(i \in N\) with \({\tilde{R}}_i(c,E) < c_i\) needs to have \(c_i > c_{i^*}\), so that after he collects \(c_{i^*}\), the rest of his award was given using the proportional rule, and it is known that \({\mathcal {P}}\) satisfies strict endowment monotonicty (see Thomson 2019), which implies FCCSEM. The rule \({\tilde{R}}\) also satisfies EDCFC, by definition.

However, \({\tilde{R}}\) does not satisfy CDI. For that, consider an example with \(N= \{1,2,3,4\}\), \(c=(10, 60, 20, 90)\), and \(E = 100\). Then, from the first part of the rule definition, we know that \(i^* = 3\), so that agents collect (10, 20, 20, 20) at first. The excess surplus is 30, which is then divided between agents 2 and 4 using the proportional rule. Given their claims, they additionally get the 2/5th and 3/5th of that excess surplus, respectively. As such, we find that \({\tilde{R}}(c,E) = (10, 32, 20, 38)\). Now, if we decrease agent 4’s claim to \(c'_4 = 60\), we can find \({\tilde{R}}(c',E) = (10, 35, 20, 35)\), so that the awards vector changes following an allowed decrease in claims.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) 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

Karagözoğlu, E., Keskin, K. & Sağlam, Ç. (In)efficiency and equitability of equilibrium outcomes in a family of bargaining games. Int J Game Theory 52, 175–193 (2023). https://doi.org/10.1007/s00182-022-00814-3

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00182-022-00814-3

Keywords

JEL Classification

Navigation