Summary: Pricing Network Edges to Cross a River
Alexander Grigoriev1
, Stan van Hoesel1
, Anton F. van der Kraaij1
,
Marc Uetz1
, and Mustapha Bouhtou2
1
Maastricht University, Quantitative Economics, P.O.Box 616,
NL­6200 MD Maastricht, The Netherlands
{a.grigoriev, s.vanhoesel, a.vanderkraaij, m.uetz}@ke.unimaas.nl
2
France T´el´ecom R&D, 39-40 rue du G´en´eral Leclerc,
F­92131 Issy-Les-Moulineaux, France
mustapha.bouhtou@francetelecom.com
Abstract. We consider a Stackelberg pricing problem in directed net-
works. Tariffs have to be defined by an operator, the leader, for a subset
of the arcs, the tariff arcs. Clients, the followers, choose paths to route
their demand through the network selfishly and independently of each
other, on the basis of minimal cost. Assuming there exist bounds on the

Source: Al Hanbali, Ahmad - Department of Applied Mathematics, Universiteit Twente

Collections: Engineering