@techreport{0856995757414082ae18c96731113da4,
title = "On the Core of Multiple Longest Traveling Salesman Games",
abstract = "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.",
keywords = "game theory, traveling salesman problem, games, core",
author = "{Estevez Fernandez}, M.A. and P.E.M. Borm and H.J.M. Hamers",
note = "Pagination: 18",
year = "2003",
language = "English",
volume = "2003-127",
series = "CentER Discussion Paper",
publisher = "Operations research",
type = "WorkingPaper",
institution = "Operations research",
}