On the Core of Routing Games

This file is part of IDEAS, which uses RePEc data

On the Core of Routing Games

Author Info

Jean Derks (Department of Mathematics, Faculty of General Sciences, University of Limburg, P.O. Box 616, 6200 MD Maastricht, The Netherlands)
Jeroen Kuipers (Department of Mathematics, Faculty of General Sciences, University of Limburg, P.O. Box 616, 6200 MD Maastricht, The Netherlands)

Additional information is available for the following registered author(s):

Jean Derks

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, called routing game, is associated with this allocation problem, and an {\cal O}(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.

Download Info
To our knowledge, this item is not available for download. To find whether it is available, there are three options:
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.

Publisher Info
Article provided by Springer in its journal International Journal of Game Theory.

Volume (Year): 26 (1997)
Issue (Month): 2 ()
Pages: 193-205
Download reference. The following formats are available: HTML (with abstract), plain text (with abstract), BibTeX, RIS (EndNote, RefMan, ProCite), ReDIF
Handle: RePEc:spr:jogath:v:26:y:1997:i:2:p:193-205

Note: Received May 1993 Revised version May 1994
Contact details of provider:
Web page: http://link.springer.de/link/service/journals/00182/index.htm

Order Information:
Web: http://link.springer.de/orders.htm

For technical questions regarding this item, or to correct its listing, contact: (Christopher F Baum).

Related research
Keywords:

Cited by:
(explanations, Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.)

Peter Borm & Herbert Hamers & Ruud Hendrickx, 2001. "Operations research games: A survey," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer, vol. 9(2), pages 139-199, December. [Downloadable!] (restricted)
Other versions:
- Borm, P. & Hamers, H. & Hendrickx,, 2001. "Operations research games : a survey," Discussion Paper 45, Tilburg University, Center for Economic Research. [Downloadable!]
Estevez-Fernandez, Arantza & Borm, Peter & Meertens, Marc & Reijnierse, Hans, 2006. "On the core of routing games with revenues," Discussion Paper 43, Tilburg University, Center for Economic Research. [Downloadable!]
Other versions:
- Arantza Estévez-Fernández & Peter Borm & Marc Meertens & Hans Reijnierse, 2009. "On the core of routing games with revenues," International Journal of Game Theory, Springer, vol. 38(2), pages 291-304, June. [Downloadable!] (restricted)

Statistics

Access and download statistics

Did you know? RePEc also has a blog.

This page was last updated on 2009-11-25.

This information is provided to you by IDEAS at the Department of Economics, College of Liberal Arts and Sciences, University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics.