Bipartite-matching markets pair agents on one side of a market with agents, items, or contracts the opposing side. Prior work addresses online bipartite-matching markets, where arrive over time and are dynamically matched to known set disposable resources. In this article, we propose new model, Online Matching (offline) Reusable Resources under Known Adversarial Distributions ( OM-RR-KAD ) , in...

Orthogonal Frequency Division Multiple Access (OFDMA) transmission technique is gaining popularity as a preferred technique in the emerging broadband wireless access standards. Motivated by the OFDMA transmission technique we define the following problem: Let M be a matrix (over R) of size a × b. Given a vector of non-negative integers ~ C = 〈c1, c2, . . . , cb〉 such that ∑ cj = a, we would lik...

In this paper, we consider an online resource allocation problem, where buyers with limited budgets are interested in purchasing items that consume a limited amount of resources. In general, there is no nontrivial performance guarantee for the worst cases. However, after imposing two reasonable restrictions, we can propose two online algorithms, a greedy algorithm and a primal dual algorithm, w...

In this research, a hierarchical location-allocation problem is modeled in a queue framework. The queue model is considered as M/M/1/k, in which system capacity is finite, equals to k. This is the main contribution of the current research. Customer's enters to the system in order to find the service according to a Poisson. In this problem, the hierarchical location-allocation model is considere...

The Object Allocation Problem (OAP) is a well studied problem which is about to allocate a set X of n objects to a set N of n agents. This paper deals with a generalization called Constrained Object Allocation Problem (COAP) where the set of objects allocated to the agents must satisfy a given feasibility constraint. The input is a set X of at least n elements and a collection S of subsets of X...

The Single Allocation Ordered Median Hub Location problem is a recent hub model introduced in [36] that provides a unifying analysis of a wide class of hub location models. In this paper, we deal with the capacitated version of this problem, presenting two formulations as well as some preprocessing phases for fixing variables. In addition, a strengthening of one of these formulations is also st...