Loading jsMath...
Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > COMMUNICATION NETWORKS:
Reports tagged with Communication Networks:
TR09-112 | 3rd November 2009
Davide Bilò, Luciano Gualà, Guido Proietti

Hardness of an Asymmetric 2-player Stackelberg Network Pricing Game

Consider a communication network represented by a directed graph G=(V,E) of n nodes and m edges. Assume that edges in E are
partitioned into two sets: a set C of edges with a fixed
non-negative real cost, and a set P of edges whose \emph{price} should instead be set by ... more >>>




ISSN 1433-8092 | Imprint