Stable lexicographic rules for shortest path games

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).

MoreLess

Year of publication:	2014
Authors:	Bahel, Eric ; Trudeau, Christian
Published in:	Economics Letters. - Elsevier, ISSN 0165-1765. - Vol. 125.2014, 2, p. 266-269
Publisher:	Elsevier
Subject:	Shortest path \| Core \| Algorithm \| Lexicographic minima

Online Resource

Check full text access |

More access options

Check Google Scholar

In libraries world-wide (WorldCat)

In German libraries (KVK)

subito order

I need help

More details

Type of publication:	Article
Classification:	C71 - Cooperative Games ; D85 - Network Formation
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10011076563