Stable lexicographic rules for shortest path games
Eric Bahel () and
Christian Trudeau ()
Authors registered in the RePEc Author Service: Richard Startz () and
Kwok Ping Tsang ()
Working Papers from Virginia Polytechnic Institute and State University, Department of Economics
For the class of shortest path games, we propose a family of new cost sharing rules satisfying core selection. These rules allocate cost shares to the players according to some lexicographic preference relation. The average of all such lexicographic rules is shown to satisfy many desirable properties (core selection, symmetry, demand additivity,...). Our method relates to what Tijs et. al (2011) refer to as the Alexia value. We propose a procedure allowing to compute these lexicographic allocations for any shortest path game.
Keywords: shortest path; core; algorithm; lexicographic minima (search for similar items in EconPapers)
New Economics Papers: this item is included in nep-ger
References: View references in EconPapers View complete reference list from CitEc
Citations View citations in EconPapers (5) Track citations by RSS feed
Downloads: (external link)
ftp://repec.econ.vt.edu/Papers/Bahel/shortestpathgames.pdf First version, 2014 (application/pdf)
Journal Article: Stable lexicographic rules for shortest path games (2014)
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: http://EconPapers.repec.org/RePEc:vpi:wpaper:e07-46
Access Statistics for this paper
More papers in Working Papers from Virginia Polytechnic Institute and State University, Department of Economics Contact information at EDIRC.
Series data maintained by Djavad Salehi-Isfahani ().