Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

WAOA

2004

Springer

2004

Springer

Abstract. We consider a Stackelberg pricing problem in directed networks. Tariﬀs have to be deﬁned by an operator, the leader, for a subset of the arcs, the tariﬀ arcs. Clients, the followers, choose paths to route their demand through the network selﬁshly and independently of each other, on the basis of minimal cost. Assuming there exist bounds on the costs clients are willing to bear, the problem is to ﬁnd tariﬀs such as to maximize the operator’s revenue. Except for the case of a single client, no approximation algorithm is known to date for that problem. We derive the ﬁrst approximation algorithms for the case of multiple clients. Our results hold for a restricted version of the problem where each client takes at most one tariﬀ arc to route the demand. We prove that this problem is still strongly NP-hard. Moreover, we show that uniform pricing yields both an m–approximation, and a (1 + ln D)–approximation. Here, m is the number of tariﬀ arcs, and D is upper ...

Added |
02 Jul 2010 |

Updated |
02 Jul 2010 |

Type |
Conference |

Year |
2004 |

Where |
WAOA |

Authors |
Alexander Grigoriev, Stan P. M. van Hoesel, Anton F. van der Kraaij, Marc Uetz, Mustapha Bouhtou |

Comments (0)