IDEAS home Printed from https://ideas.repec.org/p/hhs/uunewp/2001_003.html
   My bibliography  Save this paper

Core and Bargaining Set of Shortest Path Games

Author

Listed:
  • Grahn, Sofia

    (Department of Economics)

Abstract

In this paper it is shown that the core and the bargaining sets of Davis-Maschler and Zhou coincide in a class of shortest path games.

Suggested Citation

  • Grahn, Sofia, 2001. "Core and Bargaining Set of Shortest Path Games," Working Paper Series 2001:3, Uppsala University, Department of Economics.
    • Handle: RePEc:hhs:uunewp:2001_003
    as

    Download full text from publisher

    File URL: http://www.nek.uu.se/pdf/2001wp3.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. TamÂs Solymosi, 1999. "On the bargaining set, kernel and core of superadditive games," International Journal of Game Theory, Springer;Game Theory Society, vol. 28(2), pages 229-240.
    2. Vito Fragnelli & Ignacio García-Jurado & Luciano Méndez-Naya, 2000. "On shortest path games," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 52(2), pages 251-264, November.
    3. Zhou Lin, 1994. "A New Bargaining Set of an N-Person Game and Endogenous Coalition Formation," Games and Economic Behavior, Elsevier, vol. 6(3), pages 512-526, May.
    4. Sprumont, Yves, 1990. "Population monotonic allocation schemes for cooperative games with transferable utility," Games and Economic Behavior, Elsevier, vol. 2(4), pages 378-394, December.
    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. 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. Rosenthal, Edward C., 2013. "Shortest path games," European Journal of Operational Research, Elsevier, vol. 224(1), pages 132-140.
    3. Andreas Darmann & Christian Klamler & Ulrich Pferschy, 2015. "Sharing the Cost of a Path," Studies in Microeconomics, , vol. 3(1), pages 1-12, June.
    4. Rosenthal, Edward C., 2017. "A cooperative game approach to cost allocation in a rapid-transit network," Transportation Research Part B: Methodological, Elsevier, vol. 97(C), pages 64-77.

    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. Izquierdo, Josep M. & Rafels, Carles, 2001. "Average Monotonic Cooperative Games," Games and Economic Behavior, Elsevier, vol. 36(2), pages 174-192, August.
    2. Josep M. Izquierdo & Carles Rafels, 2010. "On the coincidence between the Shimomuras bargaining sets and the core," Working Papers in Economics 241, Universitat de Barcelona. Espai de Recerca en Economia.
    3. 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.
    4. Hendrickx, R.L.P., 2004. "Cooperation and allocation," Other publications TiSEM ab33e762-204c-46e2-86b1-0, Tilburg University, School of Economics and Management.
    5. Marina Nunez Oliva & Carlos Rafels Pallarola, 2001. "The extreme core allocations of the assignment game," Working Papers in Economics 65, Universitat de Barcelona. Espai de Recerca en Economia.
    6. Rosenthal, Edward C., 2013. "Shortest path games," European Journal of Operational Research, Elsevier, vol. 224(1), pages 132-140.
    7. Michel Le Breton & Karine Van Der Straeten, 2017. "Alliances Électorales et Gouvernementales : La Contribution de la Théorie des Jeux Coopératifs à la Science Politique," Revue d'économie politique, Dalloz, vol. 127(4), pages 637-736.
    8. Rosenthal, Edward C., 2017. "A cooperative game approach to cost allocation in a rapid-transit network," Transportation Research Part B: Methodological, Elsevier, vol. 97(C), pages 64-77.
    9. Sylvain Béal & Marc Deschamps & Catherine Refait-Alexandre & Guillaume Sekli, 2022. "Early contributors, cooperation and fair rewards in crowdfunding," Working Papers hal-04222321, HAL.
    10. Antonio Magaña & Francesc Carreras, 2018. "Coalition Formation and Stability," Group Decision and Negotiation, Springer, vol. 27(3), pages 467-502, June.
    11. Dall'Aglio, M. & Brânzei, R. & Tijs, S.H., 2008. "Cooperation in Dividing the Cake," Discussion Paper 2008-101, Tilburg University, Center for Economic Research.
    12. Jiang, Zhishan & Tian, Guoqiang, 2013. "Matching with Couples: Stability and Algorithm," MPRA Paper 57936, University Library of Munich, Germany, revised Jul 2014.
    13. Sylvain Béal & Eric Rémila & Philippe Solal, 2017. "Axiomatization and implementation of a class of solidarity values for TU-games," Theory and Decision, Springer, vol. 83(1), pages 61-94, June.
    14. Damiano, Ettore & Lam, Ricky, 2005. "Stability in dynamic matching markets," Games and Economic Behavior, Elsevier, vol. 52(1), pages 34-53, July.
    15. Sun, Ning & Trockel, Walter & Yang, Zaifu, 2008. "Competitive outcomes and endogenous coalition formation in an n-person game," Journal of Mathematical Economics, Elsevier, vol. 44(7-8), pages 853-860, July.
    16. Alexandre Skoda & Xavier Venel, 2022. "Weighted Average-convexity and Cooperative Games," Documents de travail du Centre d'Economie de la Sorbonne 22016, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
    17. , & , J. & ,, 2011. "Von Neumann-Morgenstern farsightedly stable sets in two-sided matching," Theoretical Economics, Econometric Society, vol. 6(3), September.
    18. 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.
    19. Juarez, Ruben, 2013. "Group strategyproof cost sharing: The role of indifferences," Games and Economic Behavior, Elsevier, vol. 82(C), pages 218-239.
    20. Ata Atay & Eric Bahel & Tamás Solymosi, 2023. "Matching markets with middlemen under transferable utility," Annals of Operations Research, Springer, vol. 322(2), pages 539-563, March.

    More about this item

    Keywords

    Shortest path games; core; bargaining set;
    All these keywords.

    JEL classification:

    • C70 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - General

    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:hhs:uunewp:2001_003. 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: Ulrika Öjdeby (email available below). General contact details of provider: https://edirc.repec.org/data/nekuuse.html .

    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.