-
作者：Walteros, Jose L.; Buchanan, Austin
作者单位：State University of New York (SUNY) System; University at Buffalo, SUNY; Oklahoma State University System; Oklahoma State University - Stillwater
摘要：To this day, the maximum clique problem remains a computationally challenging problem. Indeed, despite researchers' best efforts, there exist unsolved benchmark instances with 1,000 vertices. However, relatively simple algorithms solve real-life instances with millions of vertices in a few seconds. Why is this the case? Why is the problem apparently so easy in many naturally occurring networks? In this paper, we provide an explanation. First, we observe that the graph's clique number. is very ...
-
作者：Russo, Daniel
作者单位：Columbia University
摘要：This paper considers the optimal adaptive allocation of measurement effort for identifying the best among a finite set of options or designs. An experimenter sequentially chooses designs to measure and observes noisy signals of their quality with the goal of confidently identifying the best design after a small number of measurements. This paper proposes three simple and intuitive Bayesian algorithms for adaptively allocating measurement effort and formalizes a sense in which these seemingly n...
-
作者：Wang, Jinting; Wang, Zhongbin; Liu, Yunan
作者单位：Central University of Finance & Economics; Nankai University; Beijing Jiaotong University; North Carolina State University
摘要：In this article, we introduce a service grade differentiation policy for queueing models with customer retrials. We show that the average waiting time can be reduced through strategically allocating the rates of service and retrial times without needing additional service capacity. Countering to the intuition that higher service variability usually yields a larger delay, we show that the benefits of our simultaneous service-and-retrial differentiation policy outweigh the impact of the increase...
-
作者：Lozano, Leonardo; Bergman, David; Smith, J. Cole
作者单位：University System of Ohio; University of Cincinnati; University of Connecticut; Syracuse University
摘要：The application of decision diagrams in combinatorial optimization has proliferated in the last decade. In recent years, authors have begun to investigate how to use not one, but a set of diagrams, to model constraints and objective function terms. Optimizing over a collection of decision diagrams, the problem we refer to as the consistent path problem (CPP) can be addressed by associating a network-flow model with each decision diagram, jointly linked through channeling constraints. A direct ...
-
作者：Peng, Yijie; Fu, Michael C.; Heidergott, Bernd; Lam, Henry
作者单位：Peking University; University System of Maryland; University of Maryland College Park; University System of Maryland; University of Maryland College Park; Vrije Universiteit Amsterdam; Columbia University
摘要：We propose a gradient-based simulated maximum likelihood estimation to estimate unknown parameters in a stochastic model without assuming that the likelihood function of the observations is available in closed form. A key element is to develop Monte Carlo-based estimators for the density and its derivatives for the output process, using only knowledge about the dynamics of the model. We present the theory of these estimators and demonstrate how our approach can handle various types of model st...
-
作者：Briec, Walter; Cavaignac, Laurent; Kerstens, Kristiaan
作者单位：Universite Perpignan Via Domitia; Universite Perpignan Via Domitia; Centre National de la Recherche Scientifique (CNRS); CNRS - Institute for Humanities & Social Sciences (INSHS); IESEG School of Management; Universite de Lille
摘要：This contribution defines a new generalized input efficiency measure which encompasses and thus links four well-known input efficiency measures: the Debreu-Farrell measure, the Fare-Lovell measure, the asymmetric Fare measure, and the multiplicative Fare-Lovell measure. The axiomatic properties of this new measure are studied. The generalized input efficiency measure naturally leads to the definition of new measures as special cases. It also provides a general framework for testing the choice ...
-
作者：Lei, Jinlong; Shanbhag, Uday, V
作者单位：Pennsylvania Commonwealth System of Higher Education (PCSHE); Pennsylvania State University; Pennsylvania State University - University Park
摘要：The distributed computation of equilibria and optima has seen growing interest in a broad collection of networked problems. We consider the computation of Nash equilibria of convex stochastic noncooperative games characterized by a possibly non-convex potential function. Since any stationary point of the potential function is a Nash equilibrium, there is an equivalence between asynchronous best-response (BR) schemes applied on a noncooperative game and block-coordinate descent (BCD) schemes im...
