IDEAS home Printed from https://ideas.repec.org/
MyIDEAS: Log in (now much improved!) to save this paper

On the Core of Cost-Revenue Games: Minimum Cost Spanning Tree Games with Revenues

Listed author(s):
  • Arantza Estevez-Fernandez

    (VU University Amsterdam)

  • Hans Reijnierse

    (CentER, Tilburg University)

This discussion paper led to an article in 'European Journal of Operational Research' , (2014), 237, 606-616. In this paper, we analyze cost sharing problems arising from a general service by explicitly taking into account the generated revenues. To this cost-revenue sharing problem, we associate a cooperative game with transferable utility, called cost-revenue game. By considering cooperation among the agents using the general service, the value of a coalition is defined as the maximum net profit that the coalition may obtain by means of cooperation. As a result, a coalition may profit from not allowing all its members to get the service that generates the revenues. We focus on the study of the core of cost-revenue games. Under the assumption that cooperation among the members of the grand coalition grants the use of the service under consideration to all its members, it is shown that a cost-revenue game has a non-empty core for any vector of revenues if, and only if, the dual game of the cost game has a large core. Using this result, we investigate minimum cost spanning tree games with revenues. We show that if every connection cost can take only two values (low or high cost), then, the corresponding minimum cost spanning tree game with revenues has a non-empty core. Furthermore, we provide an example of a minimum cost spanning tree game with revenues with an empty core where every connection cost can take only one of three values (low, medium, or high cost).

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: http://papers.tinbergen.nl/12101.pdf
Download Restriction: no

Paper provided by Tinbergen Institute in its series Tinbergen Institute Discussion Papers with number 12-101/II.

as
in new window

Length:
Date of creation: 27 Sep 2012
Handle: RePEc:tin:wpaper:20120101
Contact details of provider: Postal:
Gustav Mahlerplein 117, 1082 MS Amsterdam

Phone: +31 (0)20 598 4580
Web page: http://www.tinbergen.nl/
Email:


More information through EDIRC

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. Moretti, S., 2008. "Cost allocation problems arising from connection situations in an interactive cooperative setting," Other publications TiSEM 2d63e0bf-18b7-4695-bdee-e, Tilburg University, School of Economics and Management.
  2. Norde, Henk & Moretti, Stefano & Tijs, Stef, 2004. "Minimum cost spanning tree games and population monotonic allocation schemes," European Journal of Operational Research, Elsevier, vol. 154(1), pages 84-97, April.
  3. 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.
  4. Daniel Granot & Michael Maschler, 1998. "Spanning network games," International Journal of Game Theory, Springer;Game Theory Society, vol. 27(4), pages 467-500.
  5. 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.
  6. 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.
  7. Tijs, Stef & Branzei, Rodica & Moretti, Stefano & Norde, Henk, 2006. "Obligation rules for minimum cost spanning tree situations and their monotonicity properties," European Journal of Operational Research, Elsevier, vol. 175(1), pages 121-134, November.
  8. 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.
  9. repec:dau:papers:123456789/4874 is not listed on IDEAS
  10. repec:spr:compst:v:64:y:2006:i:2:p:363-382 is not listed on IDEAS
  11. 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)

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

When requesting a correction, please mention this item's handle: RePEc:tin:wpaper:20120101. 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: (Tinbergen Office +31 (0)10-4088900)

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.

This information is provided to you by IDEAS at the Research Division of the Federal Reserve Bank of St. Louis using RePEc data.