-
作者：Grabisch, M; Marichal, JL; Roubens, M
作者单位：Sorbonne Universite; University of Liege; University of Liege
摘要：This paper introduces four alternative representations of a set function: the Mobius transformation, the co-Mobius transformation, and the interactions between elements of any subset of a given set as extensions of Shapley and Banzhaf values. The links between the five equivalent representations of a set function are emphasized in this presentation.
-
作者：Xu, SH; Li, HJ
作者单位：Pennsylvania Commonwealth System of Higher Education (PCSHE); Pennsylvania State University; Pennsylvania State University - University Park; Washington State University
摘要：Stochastic models with simultaneous arrivals arise naturally in the areas such as synchronized communication networks, flexible manufacturing systems, production/inventory systems, reliability modeling in random environment, etc., with a wide variety of interpretations. Simultaneous arrivals introduce dependence among various components of the system and make the explicit solutions of joint system performance measures either computationally intensive or intractable. This calls for structural a...
-
作者：Altman, E; Gaujal, B; Hordijk, A
作者单位：Inria; Universite de Lorraine; Leiden University - Excl LUMC; Leiden University
摘要：In this paper we investigate the properties of multimodular functions. In doing so we give elementary proofs for properties already established by Hajek and we generalize some of his results. In particular, we extend the relation between convexity and multimodularity to some convex subsets of Z(m). We also obtain general optimization results for average costs related to a sequence of multimodular functions rather than to a single function. Under this general context, we show that the expected ...
-
作者：Baveja, A; Srinivasan, A
作者单位：Rutgers University System; Rutgers University Camden; Rutgers University New Brunswick; Alcatel-Lucent; Lucent Technologies; AT&T
摘要：Given a network and a set of connection requests on it, we consider the maximum edge-disjoint paths and related generalizations and routing problems that arise in assigning paths for these requests. We present improved approximation algorithms and/or integrality gaps for all problems considered; the central theme of this work is the underlying multicommodity flow relaxation. Applications of these techniques to approximating families of packing integer programs are also presented.
-
作者：Solodov, MV; Svaiter, BF
摘要：We present a new Bregman-function-based algorithm which is a modification of the generalized proximal point method for solving the variational inequality problem with a maximal monotone operator. The principal advantage of the presented algorithm is that it allows a more constructive error tolerance criterion in solving the proximal point subproblems. Furthermore, we eliminate the assumption of pseudomonotonicity which was, until now, standard in proving convergence for paramonotone operators....
