We consider the distributed allocation problem of assigning rates to a set of network flows from a new game-theoretic standpoint. Our setting is a fixed capacitated network in which a set of long-lived flows is given and the routes these flows use are pre-ordained and fixed through the duration of the algorithm. Each flow is then given a set of tokens which it may place on the links that it int...

We address several aspects related to managing re-entrant lines in an uniied manner { capacity allocation, inventory management and production control { in a set of three papers. Our approach to study these systems is through simulation based optimization. Simulation ooers the exibility to model the complexities adequately while the gradient computation (via Innnitesimal Perturbation Analysis) ...

Capacitated network design is a crucial problem to telecommunications network planners. In this paper we consider the Multi-Level Capacitated Minimum Spanning Tree Problem (MLCMST), a generalization of the well-known Capacitated Minimum Spanning Tree Problem. We present a genetic algorithm, based on the notion of grouping, that is quite effective in solving large-scale problems to within 10% of...

In this article a capacitated transportation problem is considered which is formulated as a multi objective capacitated transportation problem with mixed constraints. To determine the optimum compromise solution of multi objective capacitated transportation problem (MOCTP) with mixed constraints a Fuzzy multi objective programming approach has been applied in which we use three different forms ...

BACKGROUND Earlier studies demonstrated that macrophages phagocytize spermatozoa in the female genital tract of mammals. In spite of this phagocytosis, fecundity is not affected, raising questions of how the resulting decrease in the number of spermatozoa does not reduce the fertilization rate and of the role of this phagocytosis. We hypothesized that its role is to rid the female genital tract...

A stochastic-flow network consists of a set of nodes, including source nodes which supply various resources and sink nodes at which resource demands take place, and a collection of arcs whose capacities have multiple operational states. The network reliability of such a stochastic-flow network is the probability that resources can be successfully transmitted from source nodes through multi-capa...

Given a graph G together with a capacity function c : V (G) → N, we call S ⊆ V (G) a capacitated dominating set if there exists a mapping f : (V (G) \ S) → S which maps every vertex in (V (G) \S) to one of its neighbors such that the total number of vertices mapped by f to any vertex v ∈ S does not exceed c(v). In the Planar Capacitated Dominating Set problem we are given a planar graph G, a ca...

We consider in this paper a simple model for human interactions as service providers of different resources over social networks, and study the dynamics of selfish behavior of such social entities using a game-theoretic model known as binary-preference capacitated selfish replication (CSR) game. It is known that such games have an associated ordinal potential function, and hence always admit a ...