Characterizing the Shapley value in fixed-route traveling salesman problems with appointments (Q422367)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Characterizing the Shapley value in fixed-route traveling salesman problems with appointments |
scientific article; zbMATH DE number 6035634
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Characterizing the Shapley value in fixed-route traveling salesman problems with appointments |
scientific article; zbMATH DE number 6035634 |
Statements
Characterizing the Shapley value in fixed-route traveling salesman problems with appointments (English)
0 references
16 May 2012
0 references
fixed-route traveling salesman games
0 references
routing games
0 references
appointment games
0 references
Shapley value
0 references
core
0 references
transferable-utility games
0 references
merging and splitting proofness
0 references
networks
0 references
cost allocation
0 references
0 references
0.849800705909729
0 references
0.831690788269043
0 references
0.8057823777198792
0 references
0.8021383285522461
0 references
0.7980939745903015
0 references
