Solution for a dynamic bargaining problem with an application to resource management (Q1093576)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4023067
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solution for a dynamic bargaining problem with an application to resource management |
scientific article; zbMATH DE number 4023067 |
Statements
Solution for a dynamic bargaining problem with an application to resource management (English)
0 references
1988
0 references
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.
0 references
dynamic games
0 references
computational methods
0 references
Nash's bargaining solution
0 references
dynamic, N-player problems
0 references
resource management
0 references
0.90297157
0 references
0.8951461
0 references
0.88657165
0 references
0.8740608
0 references
0.8711376
0 references
0.8705008
0 references
0.8690398
0 references
