Stable source connection and assignment problems as multi-period shortest path problems

Leanne Streekstra () and Christian Trudeau
Additional contact information
Leanne Streekstra: Research Centre of Quantitative Social and Management Sciences, Budapest University of Technology and Economics

No 2201, Discussion Papers from Budapest University of Technology and Economics, Quantitative Social and Management Sciences

Abstract: We extend the familiar shortest path problem by supposing that agent shave demands over multiple periods. This potentially allows agents to combine their paths if their demands are complementary; for instance if one agent only needs a connection to the source in the summer while the other requires it only in the winter. We not only show that the resulting cost sharing problem always generates a totally balanced game, regardless of the number of agents and periods, the cost structure or the demand profile, but that all totally balanced games are representable as MSP problems. We then exploit the fact that the model encompasses many well-studied problems to obtain or reobtain balancedness and total-balancedness results for source-connection problems, market problems and minimum coloring problems.

Keywords: Shortest path; Demand over multiple periods; Cooperative game; Core; Total-balancedness; Source-conenction; Assignment (search for similar items in EconPapers)
JEL-codes: C71 D63 (search for similar items in EconPapers)
Pages: 39 pages
Date: 2022-09
New Economics Papers: this item is included in nep-des and nep-gth
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://qsms.bme.hu/wp-content/uploads/2022/09/QSMS ... reekstra_Trudeau.pdf First version, 2022 (application/pdf)

Related works:
Journal Article: Stable source connection and assignment problems as multi-period shortest path problems (2024)
Working Paper: Stable source connection and assignment problems as multi-period shortest path problems (2022)
Working Paper: Stable source connection and assignment problems as multi-period shortest path problems (2022)
Working Paper: Stable source connection and assignment problems as multi-period shortest path problems (2020)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:azp:qsmswp:2201

Access Statistics for this paper

More papers in Discussion Papers from Budapest University of Technology and Economics, Quantitative Social and Management Sciences Contact information at EDIRC.
Bibliographic data for series maintained by Luca Sandrini ().