Stability, Fairness and Random Walks in the Bargaining Problem
Jakob Kapeller and
Stefan Steinerberger ()
Additional contact information
Stefan Steinerberger: Department of Mathematics, Yale University, US
No 67, ICAE Working Papers from Johannes Kepler University, Institute for Comprehensive Analysis of the Economy
Abstract:
We study the classical bargaining problem and its two canonical solutions, (Nash and Kalai-Smorodinsky), from a novel point of view: we ask for stability of the solution if both players are able distort the underlying bargaining process by reference to a third party (e.g. a court). By exploring the simplest case, where decisions of the third party are made randomly we obtain a stable solution, where players do not have any incentive to refer to such a third party. While neither the Nash nor the Kalai-Smorodinsky solution are able to ensure stability in case reference to a third party is possible, we found that the Kalai-Smorodinsky solution seems to always dominate the stable allocation which constitutes novel support in favor of the latter.
Pages: 15 pages
Date: 2017-08
New Economics Papers: this item is included in nep-des and nep-gth
References: Add references at CitEc
Citations:
Downloads: (external link)
https://www.jku.at/fileadmin/gruppen/108/ICAE_Working_Papers/wp67.pdf First version, 2017 (application/pdf)
Related works:
Journal Article: Stability, fairness and random walks in the bargaining problem (2017) 
Working Paper: Stability, Fairness and Random Walks in the Bargaining Problem (2017) 
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:ico:wpaper:67
Access Statistics for this paper
More papers in ICAE Working Papers from Johannes Kepler University, Institute for Comprehensive Analysis of the Economy Contact information at EDIRC.
Bibliographic data for series maintained by Teresa Griesebner ( this e-mail address is bad, please contact ).