Abstract
This paper introduces a new class of games, highway games, which arise from situations where there is a common resource that agents will jointly use. That resource is an ordered set of several indivisible sections, where each section has an associated fixed cost and each agent requires some consecutive sections. We present an easy formula to calculate the Shapley value, and we present an efficient procedure to calculate the nucleolus for this class of games.
Original language | English |
---|---|
Pages (from-to) | 158-168 |
Number of pages | 11 |
Journal | European Journal of Operational Research |
Volume | 228 |
Issue number | 1 |
DOIs | |
Publication status | Published - 2013 |