Name
Abstract | ||
|---|---|---|
A repairman makes a round-trip along a set of customers. He starts in his home location, visits each customer exactly once, and returns home. The cost of his trip has to be shared by the customers. A cooperative cost game, calledrouting game, is associated with this allocation problem, and anO(n2) algorithm is given which computes a core element of a routing game if the core is non-empty. The non-emptiness of the core depends on the tour which is traversed by the repairman. Several procedures are given to construct tours which guarantee the non-emptiness of the core. |
Year | DOI | Venue |
|---|---|---|
1997 | 10.1007/s001820050025 | Int. J. Game Theory |
Keywords | DocType | Volume |
Economic Theory, Game Theory, Allocation Problem, Core Element, Home Location | Journal | 26 |
Issue | ISSN | Citations |
2 | 1432-1270 | 10 |
PageRank | References | Authors |
0.86 | 6 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jean Derks | 1 | 72 | 22.89 |
| Jeroen Kuipers | 2 | 130 | 14.48 |