Advanced Search
MyIDEAS: Login to save this paper or follow this series

On the Core of Multiple Longest Traveling Salesman Games


Author Info

  • Estevez Fernandez, M.A.
  • Borm, P.E.M.
  • Hamers, H.J.M.

    (Tilburg University, Center for Economic Research)


In this paper we introduce multiple longest traveling salesman (MLTS) games. An MLTS game arises from a network in which a salesman has to visit each node (player) precisely once, except its home location, in an order that maximizes the total reward.First it is shown that the value of a coalition of an MLTS game is determined by taking the maximum of suitable combinations of one and two person coalitions.Secondly it is shown that MLTS games with ¯ve or less players have a nonempty core.However, a six player MLTS game may have an empty core.For the special instance where the reward between a pair of nodes is equal to 0 or 1, we provide relations between the structure of the core and the underlying network.

Download Info

If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
File URL:
Our checks indicate that this address may not be valid because: 404 Not Found. If this is indeed the case, please notify (Richard Broekman)
Download Restriction: no

Bibliographic Info

Paper provided by Tilburg University, Center for Economic Research in its series Discussion Paper with number 2003-127.

as in new window
Date of creation: 2003
Date of revision:
Handle: RePEc:dgr:kubcen:2003127

Contact details of provider:
Web page:

Related research

Keywords: game theory; traveling salesman problem; games; core;

Other versions of this item:

This paper has been announced in the following NEP Reports:


No references listed on IDEAS
You can help add them by filling out this form.


Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as in new window

Cited by:
  1. repec:hal:cesptp:hal-00625339 is not listed on IDEAS
  2. Estevez Fernandez, M.A. & Borm, P.E.M. & Meertens, M. & Reijnierse, J.H., 2006. "On the Core of Routing Games with Revenues," Discussion Paper 2006-43, Tilburg University, Center for Economic Research.
  3. Grabisch, Michel & Li, Tong, 2011. "On the set of imputations induced by the k-additive core," European Journal of Operational Research, Elsevier, vol. 214(3), pages 697-702, November.


This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.


Access and download statistics


When requesting a correction, please mention this item's handle: RePEc:dgr:kubcen:2003127. See general information about how to correct material in RePEc.

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Richard Broekman).

If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

If references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

Please note that corrections may take a couple of weeks to filter through the various RePEc services.