Abstract
We define excess rate to study the core of traveling salesman games from a perspective of optimization, propose a new variant of the traveling salesman problem, and build a link between the two problems. An exact formula for the lowest achievable excess rate is found, which explains the existence of core emptiness. We then develop an implementable method to check whether empty core exists in general case. The results apply for both symmetric and asymmetric traveling salesman games.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
