IDEAS home Printed from https://ideas.repec.org/p/pra/mprapa/98504.html
   My bibliography  Save this paper

Stability in shortest path problems

Author

Listed:
  • Bahel, Eric
  • Gómez-Rúa, María
  • Vidal-Puga, Juan

Abstract

We study three remarkable cost sharing rules in the context of shortest path problems, where agents have demands that can only be supplied by a source in a network. The demander rule requires each demander to pay the cost of their cheapest connection to the source. The supplier rule charges to each demander the cost of the second-cheapest connection and splits the excess payment equally between her access suppliers. The alexia rule averages out the lexicographic allocations, each of which allows suppliers to extract rent in some pre-specified order. We show that all three rules are anonymous and demand-additive core selections. Moreover, with three or more agents, the demander rule is characterized by core selection and a specific version of cost additivity. Finally, convex combinations of the demander rule and the supplier rule are axiomatized using core selection, a second version of cost additivity and two additional axioms that ensure the fair compensation of intermediaries.

Suggested Citation

  • 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.
  • Handle: RePEc:pra:mprapa:98504
    as

    Download full text from publisher

    File URL: https://mpra.ub.uni-muenchen.de/98504/1/MPRA_paper_98504.pdf
    File Function: original version
    Download Restriction: no

    More about this item

    Keywords

    Shortest path; cost sharing; core selection; additivity.;

    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:pra:mprapa:98504. 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: (Joachim Winter). General contact details of provider: http://edirc.repec.org/data/vfmunde.html .

    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.

    We have no references for this item. You can help adding them by using 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.