The computation of the Nash bargaining solution
From MaRDI portal
Recommendations
Cites work
- Axiomatic models of bargaining
- Constrained optimization methods in Hilbert spaces and their applications to optimal control problems with functional inequality constraints
- Nondominated decisions and cone convexity in dynamic multicriteria decision problems
- Rate of Convergence of a Class of Methods of Feasible Directions
- Solution for a dynamic bargaining problem with an application to resource management
- The computation of the Nash bargaining solution
Cited in
(18)- scientific article; zbMATH DE number 1148322 (Why is no real title available?)
- THE NASH BARGAINING SOLUTION AS MUTUAL EXPECTED-UTILITY MAXIMIZATION
- The Constrained Nash Bargaining Solution
- Computation of equilibrium values in the Baron and Ferejohn bargaining model
- Combinatorial structures of max-type functions characterizing the optimal solution of the equivalence problem
- Adjustment process-based approach for computing a Nash-Cournot equilibrium
- Nash solution and timing of bargaining
- Computing the Nash solution for scheduling bargaining problems
- The computation of the Nash bargaining solution
- The Nash bargaining solution is optimal
- On the relation between the Nash bargaining solution and the weighting method
- Nash implementation of the Nash bargaining solution using intuitive message spaces
- Collusive game solutions via optimization
- scientific article; zbMATH DE number 4114433 (Why is no real title available?)
- The representative Nash solution for two-sided bargaining problems
- scientific article; zbMATH DE number 3878720 (Why is no real title available?)
- scientific article; zbMATH DE number 4154254 (Why is no real title available?)
- scientific article; zbMATH DE number 1210331 (Why is no real title available?)
This page was built for publication: The computation of the Nash bargaining solution
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1264100)