IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v204y2010i1p117-124.html
   My bibliography  Save this article

Highway games on weakly cyclic graphs

Author

Listed:
  • Çiftçi, BarIs
  • Borm, Peter
  • Hamers, Herbert

Abstract

A highway problem is determined by a connected graph which provides all potential entry and exit vertices and all possible edges that can be constructed between vertices, a cost function on the edges of the graph and a set of players, each in need of constructing a connection between a specific entry and exit vertex. Mosquera (2007) introduce highway problems and the corresponding cooperative cost games called highway games to address the problem of fair allocation of the construction costs in case the underlying graph is a tree. In this paper, we study the concavity and the balancedness of highway games on weakly cyclic graphs. A graph G is called highway-game concave if for each highway problem in which G is the underlying graph the corresponding highway game is concave. We show that a graph is highway-game concave if and only if it is weakly triangular. Moreover, we prove that highway games on weakly cyclic graphs are balanced.

Suggested Citation

  • Çiftçi, BarIs & Borm, Peter & Hamers, Herbert, 2010. "Highway games on weakly cyclic graphs," European Journal of Operational Research, Elsevier, vol. 204(1), pages 117-124, July.
    • Handle: RePEc:eee:ejores:v:204:y:2010:i:1:p:117-124
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(09)00668-7
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Peter Borm & Herbert Hamers & Ruud Hendrickx, 2001. "Operations research games: A survey," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 9(2), pages 139-199, December.
    2. Arantza Estévez-Fernández & Peter Borm & Herbert Hamers, 2007. "Project games," International Journal of Game Theory, Springer;Game Theory Society, vol. 36(2), pages 149-176, October.
      • Estevez Fernandez, M.A. & Borm, P.E.M. & Hamers, H.J.M., 2005. "Project Games," Other publications TiSEM 21fd9b62-93b6-4a8b-9bf4-4, Tilburg University, School of Economics and Management.
      • Estevez Fernandez, M.A. & Borm, P.E.M. & Hamers, H.J.M., 2007. "Project games," Other publications TiSEM 809ba203-2bd2-48ce-ae6d-b, Tilburg University, School of Economics and Management.
      • Estevez Fernandez, M.A. & Borm, P.E.M. & Hamers, H.J.M., 2005. "Project Games," Discussion Paper 2005-91, Tilburg University, Center for Economic Research.
    3. Granot, D. & Hamers, H.J.M. & Tijs, S.H., 1999. "On some balanced, totally balanced and submodular delivery games," Other publications TiSEM e0496604-0162-4a27-992c-a, Tilburg University, School of Economics and Management.
    4. Curiel, I. & Pederzoli, G. & Tijs, S.H., 1989. "Sequencing games," Other publications TiSEM cd695be5-0f54-4548-a952-2, Tilburg University, School of Economics and Management.
    5. 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.
    6. Curiel, Imma & Pederzoli, Giorgio & Tijs, Stef, 1989. "Sequencing games," European Journal of Operational Research, Elsevier, vol. 40(3), pages 344-351, June.
    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. Balázs Sziklai & Tamás Fleiner & Tamás Solymosi, 2014. "On the Core of Directed Acyclic Graph Games," CERS-IE WORKING PAPERS 1418, Institute of Economics, Centre for Economic and Regional Studies.
    2. Kuipers, Jeroen & Mosquera, Manuel A. & Zarzuelo, José M., 2013. "Sharing costs in highways: A game theoretic approach," European Journal of Operational Research, Elsevier, vol. 228(1), pages 158-168.
    3. Herbert Hamers & Nayat Horozoglu & Henk Norde & Trine Tornøe Platz, 2022. "On the properties of weighted minimum colouring games," Annals of Operations Research, Springer, vol. 318(2), pages 963-983, November.
    4. Sanjith Gopalakrishnan & Daniel Granot & Frieda Granot & Greys Sošić & Hailong Cui, 2021. "Incentives and Emission Responsibility Allocation in Supply Chains," Management Science, INFORMS, vol. 67(7), pages 4172-4190, July.
    5. Hamers, Herbert & Horozoglu, Nayat & Norde, Henk & Platz, Trine Tornoe, 2022. "On the properties of weighted minimum colouring games," Other publications TiSEM ee84d5e4-08d7-4154-9521-2, Tilburg University, School of Economics and Management.
    6. repec:has:discpr:1321 is not listed on IDEAS
    7. Sudhölter, Peter & Zarzuelo, José M., 2017. "Characterizations of highway toll pricing methods," European Journal of Operational Research, Elsevier, vol. 260(1), pages 161-170.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Hamers, H.J.M. & Miquel, S. & Norde, H.W., 2011. "Monotonic Stable Solutions for Minimum Coloring Games," Discussion Paper 2011-016, Tilburg University, Center for Economic Research.
    2. Peter Borm & Herbert Hamers & Ruud Hendrickx, 2001. "Operations research games: A survey," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 9(2), pages 139-199, December.
    3. Reijnierse, Hans & Borm, Peter & Quant, Marieke & Meertens, Marc, 2010. "Processing games with restricted capacities," European Journal of Operational Research, Elsevier, vol. 202(3), pages 773-780, May.
    4. Hamers, H.J.M. & Miquel, S. & Norde, H.W., 2011. "Monotonic Stable Solutions for Minimum Coloring Games," Other publications TiSEM efae8d09-83e6-4fe4-9623-e, Tilburg University, School of Economics and Management.
    5. Fragnelli, V. & Llorca, N. & Sánchez-Soriano, J. & Tijs, S.H., 2006. "Convex Games with Countable Number of Players and Sequencing Situations," Discussion Paper 2006-119, Tilburg University, Center for Economic Research.
    6. S. Alparslan-Gök & R. Branzei & V. Fragnelli & S. Tijs, 2013. "Sequencing interval situations and related games," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 21(1), pages 225-236, January.
    7. Yossi Bukchin & Eran Hanany, 2007. "Decentralization Cost in Scheduling: A Game-Theoretic Approach," Manufacturing & Service Operations Management, INFORMS, vol. 9(3), pages 263-275, October.
    8. Hamers, Herbert, 1997. "On the concavity of delivery games," European Journal of Operational Research, Elsevier, vol. 99(2), pages 445-458, June.
    9. Tijs, S.H. & Brânzei, R., 2004. "Cases in Cooperation and Cutting the Cake," Discussion Paper 2004-108, Tilburg University, Center for Economic Research.
    10. Hamers, Herbert & Borm, Peter & van de Leensel, Robert & Tijs, Stef, 1999. "Cost allocation in the Chinese postman problem," European Journal of Operational Research, Elsevier, vol. 118(1), pages 153-163, October.
    11. Ruud Hendrickx & Jacco Thijssen & Peter Borm, 2012. "Minimum cost spanning tree games and spillover stability," Theory and Decision, Springer, vol. 73(3), pages 441-451, September.
    12. Stef Tijs & Gert-Jan Otten, 1993. "Compromise values in cooperative game theory," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 1(1), pages 1-36, December.
    13. Estévez-Fernández, Arantza, 2012. "A game theoretical approach to sharing penalties and rewards in projects," European Journal of Operational Research, Elsevier, vol. 216(3), pages 647-657.
    14. Sylvain Béal & Amandine Ghintran & Eric Rémila & Philippe Solal, 2015. "The sequential equal surplus division for rooted forest games and an application to sharing a river with bifurcations," Theory and Decision, Springer, vol. 79(2), pages 251-283, September.
    15. Marieke Quant & Marc Meertens & Hans Reijnierse, 2008. "Processing games with shared interest," Annals of Operations Research, Springer, vol. 158(1), pages 219-228, February.
    16. Cristina Fernández & Peter Borm & Ruud Hendrickx & Stef Tijs, 2005. "Drop out monotonic rules for sequencing situations," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 61(3), pages 501-504, July.
    17. van Velzen, S. & Hamers, H.J.M., 2002. "On the Balancedness of Relaxed Sequencing Games," Discussion Paper 2002-49, Tilburg University, Center for Economic Research.
    18. Brânzei, R. & Dimitrov, D.A. & Tijs, S.H., 2002. "Convex Fuzzy Games and Participation Monotonic Allocation Schemes," Discussion Paper 2002-13, Tilburg University, Center for Economic Research.
    19. René Brink & Youngsub Chun, 2012. "Balanced consistency and balanced cost reduction for sequencing problems," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 38(3), pages 519-529, March.
    20. Borm, Peter & Fiestras-Janeiro, Gloria & Hamers, Herbert & Sanchez, Estela & Voorneveld, Mark, 2002. "On the convexity of games corresponding to sequencing situations with due dates," European Journal of Operational Research, Elsevier, vol. 136(3), pages 616-634, February.

    More about this item

    Keywords

    C71 Cooperative games Highway games Cost sharing;

    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:eee:ejores:v:204:y:2010:i:1:p:117-124. See general information about how to correct material in RePEc.

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

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.