Solution for a dynamic bargaining problem with an application to resource management

From MaRDI portal





Nash's bargaining solution for dynamic, N-player problems is considered. Computational methods for finding solution candidates to bargaining problems are presented and some sufficient conditions for bargaining solutions are established. The theory and computation is illustrated by a resource management example.











This page was built for publication: Solution for a dynamic bargaining problem with an application to resource management

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1093576)