Algorithmic mechanism design deals with efficiently-computable algorithmic constructions in the presence of strategic players who hold the inputs to the problem and may misreport their input if doing so benefits them. Algorithmic mechanism design finds applications in a variety of internet settings such as resource allocation, facility location and e-commerce, such as sponsored search auctions....

To improve the application of the maximal covering location problem (MCLP), several capacitated MCLP models were proposed to consider the capacity limits of facilities. However, most of these models assume only one fixed capacity level for the facility at each potential site. This assumption may limit the application of the capacitated MCLP. In this article, a modular capacitated maximal coveri...

A fuzzy queuing coherent hierarchical location-allocation model is developed for congested systems. The parameters of the model are approximately evaluated and stated as fuzzy-numbers. The coverage of demand nodes is also considered in an approximate manner and is stated by the degree of membership. Using the queuing theory and fuzzy conditions, a coherent hierarchical model is developed for th...

In this study, we have classified different types of problems which are related to facility planning and layout design for different types of manufacturing processes. The main problems which are related to location of facilities which also affects the system performance such as distribution of man, material and machine in a plant or a factory and their optimization technique while using of math...

This paper presents a simple, efficient algorithm to compute the covering graph of the lattice generated by a family B of subsets of a set X. The implementation of this algorithm has O((|X| + |B|) · |B|) time complexity per lattice element. This improves previous algorithms of Bordat (1986), Ganter and Kuznetsov (1998) and Jard et al. (1994). This algorithm can be used to compute the Galois (co...

In this paper, we study the restriction of an irreducible unitary representation π of the universal covering S̃p2n(R) to a Heisenberg maximal parabolic group P̃ . We prove that if π|P̃ is irreducible, then π must be a highest weight module or a lowest weight module. This is in sharp constrast with the GLn(R) case. In addition, we show that for a unitary highest or lowest weight module, π|P̃ decompo...

Abstract Motivated by the random covering problem and study of Dirichlet uniform approximable numbers, we investigate problem. Precisely, consider an i.i.d. sequence $\omega =(\omega _n)_{n\geq 1}$ uniformly distributed on unit circle $\mathbb{T}$ a $(r_n)_{n\geq positive real numbers with limit $0$. We size set $$\begin{align*} & {\operatorname{{{\mathcal{U}}}}} (\omega):=\{y\in \mathbb{T}...

The goals of hub location problems are finding the location of hub facilities and determining the allocation of non-hub nodes to these located hubs. In this work, we discuss the multi-modal single allocation capacitated p-hub covering problem over fully interconnected hub networks. Therefore, we provide a formulation to this end. The purpose of our model is to find the location of hubs and the ...