IDEAS home Printed from https://ideas.repec.org/a/eee/ecolet/v125y2014i2p266-269.html
   My bibliography  Save this article

Stable lexicographic rules for shortest path games

Author

Listed:
  • Bahel, Eric
  • Trudeau, Christian

Abstract

For the class of shortest path games, we propose a family of new cost sharing rules satisfying core selection. These rules allocate shares according to some lexicographic preference relation. A computational procedure is provided. Our results relate to those of Tijs et al. (2011).

Suggested Citation

  • Bahel, Eric & Trudeau, Christian, 2014. "Stable lexicographic rules for shortest path games," Economics Letters, Elsevier, vol. 125(2), pages 266-269.
    • Handle: RePEc:eee:ecolet:v:125:y:2014:i:2:p:266-269
    DOI: 10.1016/j.econlet.2014.08.033
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0165176514003310
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.econlet.2014.08.033?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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. Tijs, Stef & Borm, Peter & Lohmann, Edwin & Quant, Marieke, 2011. "An average lexicographic value for cooperative games," European Journal of Operational Research, Elsevier, vol. 213(1), pages 210-220, August.
    2. Eric Bahel & Christian Trudeau, 2013. "A discrete cost sharing model with technological cooperation," International Journal of Game Theory, Springer;Game Theory Society, vol. 42(2), pages 439-460, May.
    3. Rosenthal, Edward C., 2013. "Shortest path games," European Journal of Operational Research, Elsevier, vol. 224(1), pages 132-140.
    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. Eric Bahel & Christian Trudeau, 2017. "Minimum incoming cost rules for arborescences," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 49(2), pages 287-314, August.
    2. Bahel, Eric & Gómez-Rúa, María & Vidal-Puga, Juan, 2020. "Stability in shortest path problems," MPRA Paper 98504, University Library of Munich, Germany.
    3. Eric Bahel & Christian Trudeau, 2018. "Stable cost sharing in production allocation games," Review of Economic Design, Springer;Society for Economic Design, vol. 22(1), pages 25-53, June.
    4. Streekstra, Leanne & Trudeau, Christian, 2020. "Stable source connection and assignment problems as multi-period shortest path problems," Discussion Papers on Economics 7/2020, University of Southern Denmark, Department of Economics.
    5. Trudeau, Christian & Vidal-Puga, Juan, 2017. "On the set of extreme core allocations for minimal cost spanning tree problems," Journal of Economic Theory, Elsevier, vol. 169(C), pages 425-452.
    6. Eric Bahel, 2019. "On the properties of the nucleolus of a veto game," Economic Theory Bulletin, Springer;Society for the Advancement of Economic Theory (SAET), vol. 7(2), pages 221-234, December.
    7. Bahel, Eric & Trudeau, Christian, 2019. "A cost sharing example in which subsidies are necessary for stability," Economics Letters, Elsevier, vol. 185(C).
    8. Bahel, Eric, 2021. "Hyperadditive games and applications to networks or matching problems," Journal of Economic Theory, Elsevier, vol. 191(C).
    9. Eric Bahel & Christian Trudeau, 2016. "From spanning trees to arborescences: new and extended cost sharing solutions," Working Papers 1601, University of Windsor, Department of Economics.
    10. Pantelidis, Theodoros P. & Chow, Joseph Y.J. & Rasulkhani, Saeid, 2020. "A many-to-many assignment game and stable outcome algorithm to evaluate collaborative mobility-as-a-service platforms," Transportation Research Part B: Methodological, Elsevier, vol. 140(C), pages 79-100.

    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. Eric Bahel & Christian Trudeau, 2018. "Consistency requirements and pattern methods in cost sharing problems with technological cooperation," International Journal of Game Theory, Springer;Game Theory Society, vol. 47(3), pages 737-765, September.
    2. Eric Bahel, 2014. "On the core and bargaining set of a veto game," Working Papers e07-48, Virginia Polytechnic Institute and State University, Department of Economics.
    3. Eric Bahel & Christian Trudeau, 2018. "Stable cost sharing in production allocation games," Review of Economic Design, Springer;Society for Economic Design, vol. 22(1), pages 25-53, June.
    4. Richard Startz & Kwok Ping Tsang, 2014. "On the Present Value Model in a Cross Section of Stocks," Working Papers e07-47, Virginia Polytechnic Institute and State University, Department of Economics.
    5. Trudeau, Christian, 2014. "Minimum cost spanning tree problems with indifferent agents," Games and Economic Behavior, Elsevier, vol. 84(C), pages 137-151.
    6. Xiaojin Sun & Kwok Ping Tsang, 2013. "Housing Markets, Regulations and Monetary Policy," Working Papers e07-45, Virginia Polytechnic Institute and State University, Department of Economics.
    7. Bahel, Eric, 2021. "Hyperadditive games and applications to networks or matching problems," Journal of Economic Theory, Elsevier, vol. 191(C).
    8. Bahel, Eric & Gómez-Rúa, María & Vidal-Puga, Juan, 2020. "Stability in shortest path problems," MPRA Paper 98504, University Library of Munich, Germany.
    9. Bahel, Eric & Trudeau, Christian, 2019. "A cost sharing example in which subsidies are necessary for stability," Economics Letters, Elsevier, vol. 185(C).
    10. Grabisch, Michel & Sudhölter, Peter, 2018. "On a class of vertices of the core," Games and Economic Behavior, Elsevier, vol. 108(C), pages 541-557.
    11. Streekstra, Leanne & Trudeau, Christian, 2020. "Stable source connection and assignment problems as multi-period shortest path problems," Discussion Papers on Economics 7/2020, University of Southern Denmark, Department of Economics.
    12. Béal, Sylvain & Rémila, Eric & Solal, Philippe, 2012. "Weighted component fairness for forest games," Mathematical Social Sciences, Elsevier, vol. 64(2), pages 144-151.
    13. David Lowing & Kevin Techer, 2022. "Marginalism, egalitarianism and efficiency in multi-choice games," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 59(4), pages 815-861, November.
    14. Uhan, Nelson A., 2015. "Stochastic linear programming games with concave preferences," European Journal of Operational Research, Elsevier, vol. 243(2), pages 637-646.
    15. Kamijo, Yoshio & Kongo, Takumi, 2012. "Whose deletion does not affect your payoff? The difference between the Shapley value, the egalitarian value, the solidarity value, and the Banzhaf value," European Journal of Operational Research, Elsevier, vol. 216(3), pages 638-646.
    16. David Lowing & Kevin Techer, 2021. "Marginalism, Egalitarianism and E ciency in Multi-Choice Games," Working Papers halshs-03334056, HAL.
    17. An, Qingxian & Wen, Yao & Ding, Tao & Li, Yongli, 2019. "Resource sharing and payoff allocation in a three-stage system: Integrating network DEA with the Shapley value method," Omega, Elsevier, vol. 85(C), pages 16-25.
    18. 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.
    19. repec:has:discpr:1321 is not listed on IDEAS
    20. Marina Núñez & Tamás Solymosi, 2017. "Lexicographic allocations and extreme core payoffs: the case of assignment games," Annals of Operations Research, Springer, vol. 254(1), pages 211-234, July.
    21. Jian Li & Jian-qiang Wang & Jun-hua Hu, 2019. "Interval-valued n-person cooperative games with satisfactory degree constraints," 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. 27(4), pages 1177-1194, December.

    More about this item

    Keywords

    Shortest path; Core; Algorithm; Lexicographic minima;
    All these keywords.

    JEL classification:

    • C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games
    • D85 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Network Formation

    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:ecolet:v:125:y:2014:i:2:p:266-269. 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/ecolet .

    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.