2期

最新文章

• Maximizing a Class of Utility Functions Over the Vertices of a Polytope AI翻译
  作者：Atamturk, Alper; Gomez, Andres
  作者单位：University of California System; University of California Berkeley
  摘要：Given a polytope X, a monotone concave univariate function g, and two vectors c and d, we study the discrete optimization problem of finding a vertex of X that maximizes the utility function c'x + g(d'x). This problem has numerous applications in combinatorial optimization with a probabilistic objective, including estimation of project duration with stochastic times, in reliability models, in multinomial logit models and in robust optimization. We show that the problem is NP-hard for any stric...
• Proportional Switching in First-in, First-out Networks AI翻译
  作者：Bramson, Maury; D'Auria, Bernardo; Walton, Neil
  作者单位：University of Minnesota System; University of Minnesota Twin Cities; Universidad Carlos III de Madrid; University of Manchester
  摘要：We consider a family of discrete time multihop switched queueing networks where each packet moves along a fixed route. In this setting, BackPressure is the canonical choice of scheduling policy; this policy has the virtues of possessing a maximal stability region and not requiring explicit knowledge of traffic arrival rates. BackPressure has certain structural weaknesses because implementation requires information about each route, and queueing delays can grow super-linearly with route length....
• Course Match: A Large-Scale Implementation of Approximate Competitive Equilibrium from Equal Incomes for Combinatorial Allocation AI翻译
  作者：Budish, Eric; Cachon, Gerard P.; Kessler, Judd B.; Othman, Abraham
  作者单位：University of Chicago; University of Chicago; University of Pennsylvania; University of Pennsylvania; University of Pennsylvania; University of Pennsylvania
  摘要：Combinatorial allocation involves assigning bundles of items to agents when the money is not allowed. Course allocation is one common application of combinatorial allocation, in which the bundles are schedules of courses and the assignees are students. Existing mechanisms used in practice have been shown to have serious flaws, which lead to allocations that are inefficient, unfair, or both. A recently developed mechanism is attractive in theory but has several features that limit its feasibili...
• A Two-Time-Scale Approach to Time-Varying Queues in Hospital Inpatient Flow Management AI翻译
  作者：Dai, J. G.; Shi, Pengyi
  作者单位：Cornell University; Purdue University System; Purdue University
  摘要：We analyze a time-varying M-peri/Geo(2timeScale)/N queueing system. The arrival process is periodic Poisson. The service time of a customer has components in different time scales: length of stay (LOS) in days and departure time (h(dis)) in hours. This queueing system has been used to study patient flows from the emergency department (ED) to hospital inpatient wards. In that setting, the LOS of a patient is simply the number of days she spends in a ward, and her departure time h(dis) is the di...