EEMCS

This is the latest version of this eprint.

Full text available as:

PDF - Univ. of Twente only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader 135 Kb

Official URL: http://dx.doi.org/10.1002/net.20260

Abstract

We address the algorithmic complexity of a profit maximization problem in capacitated, undirected networks. We are asked to price a set of capacitated network links to serve a set of potential customers. Each customer is interested in purchasing a network connection that is specified by a simple path in the network and has a maximum budget that we assume to be known to the seller. The goal is to decide which customers to serve, and to determine prices for all network links in order to maximize the total profit. We address this pricing problem in different network topologies. More specifically, we derive several results on the algorithmic complexity of this profit maximization problem, given that the network is either a path, a cycle, a tree, or a grid. Our results include approximation algorithms as well as inapproximability results.

Available Versions of this Item

• How to sell a graph: guidelines for graph retailers (deposited 25 July 2008)
  • Optimal pricing of capacitated networks (deposited 10 February 2009)
    [Currently Displayed]

Export this item as:

• BibTeX
• XML

To request a copy of the PDF please email us request copy

To correct this item please ask your editor

Repository Staff Only: edit this item