Solution for a dynamic bargaining problem with an application to resource management
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.
scientific article; zbMATH DE number 4023067
scientific article