No label defined (Q3758554)
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 4008090
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 4008090 |
Statements
1986
0 references
adjacent service network
0 references
negotiation process
0 references
cooperative game
0 references
capacity queue
0 references
0.7181426286697388
0 references
0.7144074440002441
0 references
0.7026588320732117
0 references
0.693781852722168
0 references
[For the entire collection see Zbl 0611.90001.] The paper assumes that two adjacent service network (e.g., ambulance, fire) wish to cooperate at times, however, they maintain local autonomy, hence a global dispatching policy is not a viable solution. Rather they devise alternative local dispatching policies which account for cooperation under certain circumstances. The examination of various local policies initiates transmissions of information between the networks' managers about probabilities of demand and supply of services. This develops into a negotiation process which may (or may not) terminate upon reaching a coordination agreement. The negotiation process resembles a cooperative game. The above approach, which requires a mathematical approximation, is compared with an exact ''overall'' approach where an ''outsider'' analyst devises a dispatching policy for both networks. Two cases are analyzed with respect to requests for service that occur when all the servers are busy. In the first case, a zero line capacity queue is considered; in the second case an infinite capacity queue is allowed to form.
0 references