1 paper · 1 filter
Andrzej Turko, Jarosław Byrka
We study an envy-free pricing problem, in which each buyer wishes to buy a shortest path connecting her individual pair of vertices in a network owned by a single vendor. The vendo…