Bargaining Games

A special issue of Games (ISSN 2073-4336).

Deadline for manuscript submissions: closed (1 June 2015) | Viewed by 39447

Special Issue Editor


E-Mail Website
Guest Editor
Department of Economics and Political Science, Duke University, 294B Gross Hall, 140 Science Drive, Durham, NC 27708-0097, USA
Interests: applied game theory; models of war; international bargaining; regime transitions; social mobility; ethnic conflict

Special Issue Information

Dear Colleagues,

This Special Issue invites original research on game theoretical approaches to bargaining failure. Bargaining failure is one of the main causes of socially inefficient strategic interactions in various settings, including but not limited to the marketplace, business, law, legislatures, and international relations. In the existing literature, informational problems and lack of commitment power remain the major rationalist explanations of bargaining failure. Despite the wealth of accumulated knowledge over the last few decades, we still need to investigate these areas more deeply, as well as environments where standard assumptions of game theory fail, e.g., lack of common knowledge, presence of agents with nonstandard preferences, i.e., preferences that are not represented by expected utility, or presence of behaviorally motivated agents. We welcome novel contributions to the existing rationalist explanations of inefficient bargaining as well as contributions that explore the frontiers of decision theory and behavioral economics in a bargaining framework.

Dr. Bahar Leventoglu
Guest Editor

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Games is an international peer-reviewed open access semimonthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 1600 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Benefits of Publishing in a Special Issue

  • Ease of navigation: Grouping papers by topic helps scholars navigate broad scope journals more efficiently.
  • Greater discoverability: Special Issues support the reach and impact of scientific research. Articles in Special Issues are more discoverable and cited more frequently.
  • Expansion of research network: Special Issues facilitate connections among authors, fostering scientific collaborations.
  • External promotion: Articles in Special Issues are often promoted through the journal's social media, increasing their visibility.
  • e-Book format: Special Issues with more than 10 articles can be published as dedicated e-books, ensuring wide and rapid dissemination.

Further information on MDPI's Special Issue polices can be found here.

Published Papers (6 papers)

Order results
Result details
Select all
Export citation of selected articles as:

Research

479 KiB  
Article
Time-Preference Heterogeneity and Multiplicity of Equilibria in Two-Group Bargaining
by Daniel Cardona and Antoni Rubí-Barceló
Games 2016, 7(2), 12; https://doi.org/10.3390/g7020012 - 12 May 2016
Cited by 1 | Viewed by 6417
Abstract
We consider a multilateral bargaining game in which the agents can be classified into two groups according to their instantaneous preferences. In one of these groups there is one agent with a different discount factor. We analyze how this time-preference heterogeneity may generate [...] Read more.
We consider a multilateral bargaining game in which the agents can be classified into two groups according to their instantaneous preferences. In one of these groups there is one agent with a different discount factor. We analyze how this time-preference heterogeneity may generate multiplicity of equilibria. When such an agent is sufficiently more patient than the rest, there is an equilibrium in which her group-mates make the same proposal as the members of the other group. Thus, in heterogeneous groups the presence of more patient members may reduce the utility of its members. Full article
(This article belongs to the Special Issue Bargaining Games)
Show Figures

Figure 1

266 KiB  
Article
Bargaining Mechanisms for One-Way Games
by Andrés Abeliuk, Gerardo Berbeglia and Pascal Van Hentenryck
Games 2015, 6(3), 347-367; https://doi.org/10.3390/g6030347 - 8 Sep 2015
Cited by 2 | Viewed by 6374
Abstract
We introduce one-way games, a two-player framework whose distinguishable feature is that the private payoff of one (independent) player is determined only by her own strategy and does not depend on the actions taken by the other (dependent) player. We show that the [...] Read more.
We introduce one-way games, a two-player framework whose distinguishable feature is that the private payoff of one (independent) player is determined only by her own strategy and does not depend on the actions taken by the other (dependent) player. We show that the equilibrium outcome in one-way games without side payments and the social cost of any ex post efficient mechanism can be far from the optimum. We also show that it is impossible to design a Bayes–Nash incentive-compatible mechanism for one-way games that is budget-balanced, individually rational and efficient. To address this negative result, we propose a privacy-preserving mechanism based on a single-offer bargaining made by the dependent player that leverages the intrinsic advantage of the independent player. In this setting the outside option of the dependent player is not known a priori; however, we show that the mechanism satisfies individual rationality conditions, is incentive-compatible, budget-balanced and produces an outcome that is more efficient than the equilibrium without payments. Finally, we show that a randomized multi-offer extension brings no additional benefit in terms of efficiency. Full article
(This article belongs to the Special Issue Bargaining Games)
2003 KiB  
Article
Bargaining over Strategies of Non-Cooperative Games
by Giuseppe Attanasi, Aurora García-Gallego, Nikolaos Georgantzís and Aldo Montesano
Games 2015, 6(3), 273-298; https://doi.org/10.3390/g6030273 - 31 Aug 2015
Cited by 7 | Viewed by 8771
Abstract
We propose a bargaining process supergame over the strategies to play in a non-cooperative game. The agreement reached by players at the end of the bargaining process is the strategy profile that they will play in the original non-cooperative game. We analyze the [...] Read more.
We propose a bargaining process supergame over the strategies to play in a non-cooperative game. The agreement reached by players at the end of the bargaining process is the strategy profile that they will play in the original non-cooperative game. We analyze the subgame perfect equilibria of this supergame, and its implications on the original game. We discuss existence, uniqueness, and efficiency of the agreement reachable through this bargaining process. We illustrate the consequences of applying such a process to several common two-player non-cooperative games: the Prisoner’s Dilemma, the Hawk-Dove Game, the Trust Game, and the Ultimatum Game. In each of them, the proposed bargaining process gives rise to Pareto-efficient agreements that are typically different from the Nash equilibrium of the original games. Full article
(This article belongs to the Special Issue Bargaining Games)
Show Figures

Figure 1

229 KiB  
Article
A Tale of Two Bargaining Solutions
by Emin Karagözoğlu and Kerim Keskin
Games 2015, 6(2), 161-174; https://doi.org/10.3390/g6020161 - 19 Jun 2015
Cited by 5 | Viewed by 6287
Abstract
We set up a rich bilateral bargaining model with four salient points (disagreement point, ideal point, reference point, and tempered aspirations point), where the disagreement point and the utility possibilities frontier are endogenously determined. This model allows us to compare two bargaining solutions [...] Read more.
We set up a rich bilateral bargaining model with four salient points (disagreement point, ideal point, reference point, and tempered aspirations point), where the disagreement point and the utility possibilities frontier are endogenously determined. This model allows us to compare two bargaining solutions that use reference points, the Gupta-Livne solution and the tempered aspirations solution, in terms of Pareto efficiency in a strategic framework. Our main result shows that the weights solutions place on the disagreement point do not directly imply a unique efficiency ranking in this bargaining problem with a reference point. In particular, the introduction of a reference point brings one more degree of freedom to the model which requires also the difference in the weights placed on the reference point to be considered in reaching an efficiency ranking. Full article
(This article belongs to the Special Issue Bargaining Games)
Show Figures

Figure 1

280 KiB  
Article
From Bargaining Solutions to Claims Rules: A Proportional Approach
by José-Manuel Giménez-Gómez, António Osório and Josep E. Peris
Games 2015, 6(1), 32-38; https://doi.org/10.3390/g6010032 - 5 Mar 2015
Cited by 5 | Viewed by 5539
Abstract
Agents involved in a conflicting claims problem may be concerned with the proportion of their claims that is satisfied, or with the total amount they get. In order to relate both perspectives, we associate to each conflicting claims problem a bargaining-in-proportions set. Then, [...] Read more.
Agents involved in a conflicting claims problem may be concerned with the proportion of their claims that is satisfied, or with the total amount they get. In order to relate both perspectives, we associate to each conflicting claims problem a bargaining-in-proportions set. Then, we obtain a correspondence between classical bargaining solutions and usual claims rules. In particular, we show that the constrained equal losses, the truncated constrained equal losses and the contested garment (Babylonian Talmud) rules can be obtained throughout the Nash bargaining solution. Full article
(This article belongs to the Special Issue Bargaining Games)
230 KiB  
Article
The Seawall Bargaining Game
by Rémy Delille and Jean-Christophe Pereau
Games 2014, 5(2), 127-139; https://doi.org/10.3390/g5020127 - 24 Jun 2014
Cited by 2 | Viewed by 5382
Abstract
Agents located from downstream to upstream along an estuary and exposed to a flooding risk have to invest in facilities like a seawall (or dike). As the benefits of that local public good increase along the estuary, upstream agents have to bargain for [...] Read more.
Agents located from downstream to upstream along an estuary and exposed to a flooding risk have to invest in facilities like a seawall (or dike). As the benefits of that local public good increase along the estuary, upstream agents have to bargain for monetary compensation with the most downstream agent in exchange for more protection effort. The paper analyses different bargaining protocols and determines the conditions under which agents are better off. The results show that upstream agents are involved in a chicken game when they have to bargain with the most downstream agent. Full article
(This article belongs to the Special Issue Bargaining Games)
Back to TopTop