Current processor allocation techniques for multicomputers are based on centralized front-end based algorithms. As a result, the applied strategies are usually restricted to static, contiguous, structure preserving allocation, and suffer from low parallelism and weak fault tolerance. To lift these restrictions we are investigating a distributed approach to the processor allocation problem for m...

Optimization of query in distributed database system is one of the dominant subjects in the field of database theory. Depending upon the placement of data a query can be described as centralized or distributed query. The processing of distributed query is entirely different from the centralized query as in the former case the data is distributed over number of sites. Decision Support System Que...

We consider a network model where the nodes are grouped into a number of clusters and propose a distributed dynamic frequency allocation algorithm that achieves performance close to that of a centralized optimal algorithm. Each cluster chooses its transmission frequency band based on its knowledge of the interference that it experiences. The convergence of the proposed distributed algorithm to ...

We study the impact of multilateral private information about inventory levels in twoechelon supply chain environments. We find that greater bargaining power of the downstream chain member promotes the efficiency of supply chain in terms of operational cost. More specifically, we focus on two polar cases: i) multiple suppliers with limited inventories supplying to a single retailer; and ii) a s...

We consider dynamic capacity booking problems faced by multiple manufacturers each outsourcing certain operations to a common third-party firm. Each manufacturer, upon observing the current state of the third-party schedule, books capacity with the objective to jointly minimize holding costs that result from early deliveries, tardiness penalties due to late deliveries, and third-party capacity ...

Many systems consist of a set of agents which must acquire exclusive access to resources from a shared pool. Coordination of agents in such systems is often implemented in the form of a centralized mechanism. The intervention of this type of mechanism, however, typically introduces significant computational overhead and reduces the amount of concurrent activity. Alternatives to centralized mech...

The standard DEA model allows different DMU units to set their own priorities for the inputs and outputs that form part of the efficiency assessment. In the case of a centralized organization with many outlets, such as an education authority that is responsible for many schools, it may be more sensible to operate in the most efficient way, but under a common set of priorities for all DMUs. The ...

We study a strategic model in which a defender must allocate defensive resources to a collection of locations, and an attacker must choose a location to attack. The defender does not know the attacker's preferences, while the attacker observes the defender's resource allocation. The defender's problem gives rise to negative externalities, in the sense that increasing the resources allocated to ...

In multi-agent systems, centralized optimal solutions are often impractical due to scalability and resource limitation issues which makes simpler distributed algorithms preferable. Unfortunately, there has been little work that formally studies different distributed systems to predict their performance or explain their behavior. In this work, we study three different distributed resource alloca...