We study the design of price mechanisms for communication network problems in which a user's utility depends on the amount of flow she sends through the network, and the congestion on each link depends on the total traffic flows over it. The price mechanisms are characterized by a set of axioms...

We consider a class of online resource allocation problems in which there are n types of resources with limited initial inventory and n demand classes. The resources are flexible in that each type of resources can serve more than one demand class. In this paper, we focus on a special class of...