Advanced Search
MyIDEAS: Login to save this article or follow this journal

On the core of routing games with revenues


Author Info

  • Arantza Estévez-Fernández


  • Peter Borm
  • Marc Meertens
  • Hans Reijnierse


Traveling salesman problems with revenues form a generalization of traveling salesman problems.Here, next to travel costs an explicit revenue is generated by visiting a city.We analyze routing problems with revenues, where a predetermined route on all cities determines the tours along subgroups.Corresponding routing games with revenues are analyzed.It is shown that these games have a nonempty core and a complete description of the core is provided.

(This abstract was borrowed from another version of this item.)

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:
Download Restriction: Access to full text is restricted to subscribers.

As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.

Bibliographic Info

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

Volume (Year): 38 (2009)
Issue (Month): 2 (June)
Pages: 291-304

as in new window
Handle: RePEc:spr:jogath:v:38:y:2009:i:2:p:291-304

Contact details of provider:
Web page:

Order Information:

Related research

Keywords: Routing problems; Revenues; Core; C71;

Other versions of this item:

Find related papers by JEL classification:


References listed on IDEAS
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.:
as in new window
  1. Potters, J.A.M. & Curiel, I. & Tijs, S.H., 1992. "Traveling salesman games," Open Access publications from Tilburg University urn:nbn:nl:ui:12-154221, Tilburg University.
  2. Rodica Brânzei & Elena Iñarra & Stef Tijs & José Zarzuelo, 2006. "A Simple Algorithm for the Nucleolus of Airport Profit Games," International Journal of Game Theory, Springer, vol. 34(2), pages 259-272, August.
  3. Estevez Fernandez, M.A. & Borm, P.E.M. & Hamers, H.J.M., 2003. "On the Core of Multiple Longest Traveling Salesman Games," Discussion Paper 2003-127, Tilburg University, Center for Economic Research.
  4. Suijs, J.P.M. & Borm, P.E.M. & Hamers, H.J.M. & Koster, M.A.L. & Quant, M., 2001. "Communications and Cooperation in Public Network Situations," Discussion Paper 2001-44, Tilburg University, Center for Economic Research.
  5. M. Meertens & J. Potters, 2006. "The nucleolus of trees with revenues," Computational Statistics, Springer, vol. 64(2), pages 363-382, October.
  6. Jean Derks & Jeroen Kuipers, 1997. "On the Core of Routing Games," International Journal of Game Theory, Springer, vol. 26(2), pages 193-205.
  7. Brânzei, R. & Inarra, E. & Tijs, S.H. & Zarzuelo, J., 2003. "An Algorithm for the Nucleolus of Airport Profit Problems," Discussion Paper 2003-50, Tilburg University, Center for Economic Research.
Full references (including those not matched with items on IDEAS)


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

Cited by:
  1. Andrzej Grzybowski, 2009. "A Note On A Single Vehicle And One Destination Routing Problem And Its Game-Theoretic Models," Advanced Logistic systems, University of Miskolc, Department of Material Handling and Logistics, vol. 3(1), pages 71-76, December.
  2. Arantza Estevez-Fernandez & Hans Reijnierse, 2012. "On the Core of Cost-Revenue Games: Minimum Cost Spanning Tree Games with Revenues," Tinbergen Institute Discussion Papers 12-101/II, Tinbergen Institute.
  3. repec:dgr:uvatin:2012101 is not listed on IDEAS
  4. Andrzej Grzybowski, 2010. "Probabilistic Model Of A Single Vehicle And One Destination Routing Problem And Its Monte Carlo Solutions," Advanced Logistic systems, University of Miskolc, Department of Material Handling and Logistics, vol. 4(1), pages 53-60, December.


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:spr:jogath:v:38:y:2009:i:2:p:291-304. 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: (Guenther Eichhorn) or (Christopher F Baum).

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.