In this paper we present two algorithms for a machine allocation problem occurring in manufacturing systems. For the two algorithms presented we prove worst-case performance ratios of 2 and 312, respectively. The machlne allocat~on problem we consider is a general convex resource allocation...

We consider a non-cooperative model of information networks where communication is costly and not fully reliable. We examine the nature of Nash networks and efficient networks.

In this paper we propose a Branch and Price algorithm for solving multi-period single-sourcing problems. In particular, we generalize a Branch and Price algorithm that was developed for the Generalized Assignment Problem (GAP) to a class of convex assignment problems. We then identify an...

We develop a dynamic model to study the formation of communication networks. In this model, individuals periodically make decisions concerning the continuation of existing information links and the formation of new information links, with their cohorts. These decisions trade off the costs of...

When there are competing technologies or products with unknown payoffs which are adopted over time within a society, an important question is whether conformism or diversity will prevail. We use a learning model with local interactions to study this question. We show that the structure of...

Many markets are characterized by a high level of inter-firm collaboration in R&D activity. This paper develops a simple model of strategic networks which captures two distinctive features of such collaboration activity: bilateral agreements and non-exclusive relationships. We study the effects...

In an oligopoly, prior to competing in the market, firms have an opportunity to form pair-wise collaborative links with other firms. These pair-wise links involve a commitment of resources and lead to lower costs of production of the collaborating firms. The collection of pair-wise links defines...