IDEAS home Printed from https://ideas.repec.org/a/spr/jogath/v38y2009i2p291-304.html
   My bibliography  Save this article

On the core of routing games with revenues

Author

Listed:
  • Arantza Estévez-Fernández

    ()

  • Peter Borm
  • Marc Meertens
  • Hans Reijnierse

Abstract

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.)

Suggested Citation

  • 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;Game Theory Society, vol. 38(2), pages 291-304, June.
  • Handle: RePEc:spr:jogath:v:38:y:2009:i:2:p:291-304
    DOI: 10.1007/s00182-009-0154-9
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s00182-009-0154-9
    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 below or search for a different version of it.

    Other versions of this item:

    References listed on IDEAS

    as
    1. 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;Game Theory Society, vol. 34(2), pages 259-272, August.
    2. Jeroen Suijs & Peter Borm & Herbert Hamers & Marieke Quant & Maurice Koster, 2005. "Communication and Cooperation in Public Network Situations," Annals of Operations Research, Springer, vol. 137(1), pages 117-140, July.
    3. M. Meertens & J. Potters, 2006. "The nucleolus of trees with revenues," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 64(2), pages 363-382, October.
    4. Jean Derks & Jeroen Kuipers, 1997. "On the Core of Routing Games," International Journal of Game Theory, Springer;Game Theory Society, vol. 26(2), pages 193-205.
    5. Estevez-Fernandez, Arantza & Borm, Peter & Hamers, Herbert, 2006. "On the core of multiple longest traveling salesman games," European Journal of Operational Research, Elsevier, vol. 174(3), pages 1816-1827, November.
    6. repec:spr:compst:v:64:y:2006:i:2:p:363-382 is not listed on IDEAS
    7. Potters, J.A.M. & Curiel, I. & Tijs, S.H., 1992. "Traveling salesman games," Other publications TiSEM 0dd4cf3d-25fa-4179-80f6-6, Tilburg University, School of Economics and Management.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Estévez-Fernández, Arantza & Reijnierse, Hans, 2014. "On the core of cost-revenue games: Minimum cost spanning tree games with revenues," European Journal of Operational Research, Elsevier, vol. 237(2), pages 606-616.
    2. 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.
    3. 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.

    More about this item

    Keywords

    Routing problems; Revenues; Core; C71;

    JEL classification:

    • C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. 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: (Sonal Shukla) or (Rebekah McClure). General contact details of provider: http://www.springer.com .

    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 CitEc recognized a reference but did not link an item in RePEc 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 RePEc Author Service 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.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.