Article ID: | iaor20003693 |
Country: | Germany |
Volume: | 50 |
Issue: | 2 |
Start Page Number: | 355 |
End Page Number: | 366 |
Publication Date: | Jan 1999 |
Journal: | Mathematical Methods of Operations Research (Heidelberg) |
Authors: | Tijs S., Hamers Herbert, Granot D. |
Keywords: | game theory |
This paper studies a class of delivery problems associated with the Chinese postman problem and a corresponding class of delivery games. A delivery problem in this class is determined by a connected graph, a cost function defined on its edges and a special chosen vertex in that graph which will be referred to as the post office. It is assumed that the edges in the graph are owned by different individuals and the delivery game is concerned with the allocation of the traveling costs incurred by the server, who starts at the post office and is expected to traverse all edges in the graph before returning to the post office. A graph