Results 161 to 170 of about 35,985 (198)
Some of the next articles are maybe not open access.
Nash bargaining solution under externalities
Mathematical Social Sciences, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tomohiko Kawamori, Toshiji Miyakawa
openaire +2 more sources
Characterizing the Nash bargaining solution without Pareto-Optimality
Social Choice and Welfare, 1988We consider the bargaining problem with a variable number of agents. The first author [J. Econ. Theory 45, No.2, 330-341 (1988; Zbl 0657.90106)] had previously characterized the Nash solution as the only solution to satisfy the following axioms: Pareto Optimality, Symmetry, Scale Invariance, and Multilateral Stability.
Lensberg, T., Thomson, W.
openaire +2 more sources
1992
Any book on axiomatic bargaining game theory should start with Nash’s 1950 article and with the Nash bargaining solution, and so will this one. Without any doubt the Nash bargaining solution is the most well-known and popular solution concept in bargaining — in the theoretical literature as well as in applied and empirical work.
openaire +1 more source
Any book on axiomatic bargaining game theory should start with Nash’s 1950 article and with the Nash bargaining solution, and so will this one. Without any doubt the Nash bargaining solution is the most well-known and popular solution concept in bargaining — in the theoretical literature as well as in applied and empirical work.
openaire +1 more source
Mediation and the Nash bargaining solution [PDF]
The author studies a model of bargaining in which two parties use a mediator who sequentially makes random proposals until agreement by both parties is reached. The main result of the paper is that the subgame perfect payoffs converge to the asymmetric Nash bargaining solution if the discount rates become arbitrarily small.
openaire +1 more source
Computing the Nash solution for scheduling bargaining problems
International Journal of Operational Research, 2009In this paper we focus on the Nash Bargaining Solution (NBS) in a scheduling scenario with two players. The problem is shown to be NP-hard, but an effective computing scheme for finding NBS is presented. Extensive computational results are provided, showing that NBS can always be found within reasonable computation time.
AGNETIS, ALESSANDRO +2 more
openaire +3 more sources
Barnett, Bargaining and The Nash Solution
Noûs, 1986Two people are given $100 to share on condition that between them they can come to some arrangement as to how it is to be divided. That is, if they can come to an agreement they each get what they have agreed to, but if they fail to agree neither gets anything. Is there a principle in conformity to which they will agree, and if so, what is it?
openaire +1 more source
Nash solution and timing of bargaining
Economics Letters, 1988zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Nash Bargaining Solutions of Multiparty Bargaining Problems
1987In multiparty systems situations often arise in which various coalitions could form and each potential coalition must decide on how the gains from their joint action should be shared. We view these situations as multilateral bargaining problems, take into account how players’ opportunities in other coalitions should affect their disagreement payoffs ...
openaire +1 more source
Intrinsic Comparative Statics of a Nash Bargaining Solution
International Game Theory Review, 2016A generalization of the class of bargaining problems examined by Engwerda and Douven [(2008) On the sensitivity matrix of the Nash bargaining solution, Int. J. Game Theory 37, 265–279] is studied. The generalized class consists of nonconvex bargaining problems in which the feasible set satisfies the requirement that the set of weak Pareto-optimal ...
openaire +3 more sources
Coincidence of two solutions to Nash’s bargaining problem
Economics Letters, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source

