in dea to obtain an efficient representation in ccr andbcc models for each dmu only one linear plan would be solved; however,it is possible in centralized resource allocation (cra) to solve allthe dmus by one linear planning. in this paper, models of centralizedresource allocation in input-oriented and in dynamic case will be offeredand by using dynamic sbm, the representation of dmus in each t...

data envelopment analysis (dea) is a technique based on mathematical programming for evaluating the efficiency of homogeneous decision making units (dmus). in this technique, inefficient dmus are projected onto the frontier, which was constructed by the best performers. centralized resource allocation (cra) is a method in which all dmus are projected onto the efficient frontier through solving ...

In this paper, we propose a game-theoretic solution to the problem of distributed resource allocation in emerging horizontal dynamic cloud federation (HDCF) platform. It differs from the existing vertical supply chain federation (VSCF) models in terms of establishing federation and dynamic pricing. We study two resource allocation games non cooperative and cooperative games to analyze interacti...

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. In equilibrium, the defender sometimes optimally leaves a location undefended and sometimes prefers a higher vulnerability at a particular location even if a lower risk could be achieved at zero cost. The defender prefers to allocate res...

In this paper, we present an analysis on optimization and risk management in Communication Networks (CNs). The model is proposed for offline traffic engineering optimization, which takes a centralized view of bandwidth allocation, performance control, and risk control of network profit shortfall. First, we introduce a linear penalty cost in the CN optimization model and derive the optimal bandw...

Consider a set N of n(> 1) stores with single-item and single-period nondeterministic demands like in a classic newsvendor setting with holding and penalty costs only. Assume a risk-pooling single-warehouse centralized inventory ordering option. Allocation of costs in the centralized inventory ordering corresponds to modelling it as a cooperative cost game whose players are the stores. It has b...

Dynamic Spectrum Allocation (DSA) has been viewed as a promising approach to improving spectrum efficiency. With DSA, Wireless Service Providers (WSPs) that operate in fixed spectrum bands allocated through static allocation can solve their short-term spectrum shortage problems resulting from the bursty nature of wireless traffic. Such DSA mechanisms should be coupled with dynamic pricing schem...

In this paper, we consider a general distributed system with multiple agents who select and then implement actions in the system. The system has an operator with a centralized objective. The agents, on the other hand, are selfinterested and strategic in the sense that each agent optimizes its own individual objective. The operator aims to mitigate this misalignment by designing an incentive sch...