-
作者：Banciu, Mihai; Mirchandani, Prakash
作者单位：Bucknell University; Pennsylvania Commonwealth System of Higher Education (PCSHE); University of Pittsburgh
摘要：The generalized failure rate of a continuous random variable has demonstrable importance in operations management. If the valuation distribution of a product has an increasing generalized failure rate (that is, the distribution is IGFR), then the associated revenue function is unimodal, and when the generalized failure rate is strictly increasing, the global maximum is uniquely specified. The assumption that the distribution is IGFR is thus useful and frequently held in recent pricing, revenue...
-
作者：Noyan, Nilay; Rudolf, Gabor
作者单位：Sabanci University
摘要：For many decision-making problems under uncertainty, it is crucial to develop risk-averse models and specify the decision makers' risk preferences based on multiple stochastic performance measures (or criteria). Incorporating such multivariate preference rules into optimization models is a fairly recent research area. Existing studies focus on extending univariate stochastic dominance rules to the multivariate case. However, enforcing multivariate stochastic dominance constraints can often be ...
-
作者：Buchbinder, Niv; Kimbrel, Tracy; Levi, Retsef; Makarychev, Konstantin; Sviridenko, Maxim
作者单位：Tel Aviv University; National Science Foundation (NSF); Massachusetts Institute of Technology (MIT); Microsoft; University of Warwick
摘要：In this paper, we study an online make-to-order variant of the classical joint replenishment problem (JRP) that has been studied extensively over the years and plays a fundamental role in broader planning issues, such as the management of supply chains. In contrast to the traditional approaches of the stochastic inventory theory, we study the problem using competitive analysis against a worst-case adversary. Our main result is a 3-competitive deterministic algorithm for the online version of t...
-
作者：Kim, Song-Hee; Whitt, Ward
作者单位：Columbia University
摘要：The theory supporting Little's Law (L = lambda W) is now well developed, applying to both limits of averages and expected values of stationary distributions, but applications of Little's Law with actual system data involve measurements over a finite-time interval, which are neither of these. We advocate taking a statistical approach with such measurements. We investigate how estimates of L and lambda can be used to estimate W when the waiting times are not observed. We advocate estimating conf...
-
作者：Carvajal, Rodolfo; Constantino, Miguel; Goycoolea, Marcos; Vielma, Juan Pablo; Weintraub, Andres
作者单位：University System of Georgia; Georgia Institute of Technology; Universidad Adolfo Ibanez; Universidade de Lisboa; Massachusetts Institute of Technology (MIT); Pennsylvania Commonwealth System of Higher Education (PCSHE); University of Pittsburgh; Universidad de Chile
摘要：Connectivity requirements are a common component of forest planning models, with important examples arising in wildlife habitat protection. In harvest scheduling models, one way of addressing preservation concerns consists of requiring that large contiguous patches of mature forest are maintained. In the context of nature reserve design, it is common practice to select a connected region of forest, as a reserve, in such a way as to maximize the number of species and habitats protected. Althoug...
-
作者：Kakade, Sham M.; Lobel, Ilan; Nazerzadeh, Hamid
作者单位：Microsoft; New York University; University of Southern California
摘要：We consider the problem of designing optimal mechanisms for settings where agents have dynamic private information. We present the virtual-pivot mechanism, which is optimal in a large class of environments that satisfy a separability condition. The mechanism satisfies a rather strong equilibrium notion (it is periodic ex post incentive compatible and individually rational). We provide both necessary and sufficient conditions for immediate incentive compatibility for mechanisms that satisfy per...
-
作者：Blavatskyy, Pavlo
摘要：Subjective expected utility is the most widely used model to represent preferences under uncertainty (when objective probabilities of events may not be known). This paper presents a new behavioral characterization (preference axiomatization) of subjective expected utility. The latter is derived from a behavioral assumption of cardinal independence, also known as standard sequence invariance. This axiom requires that a standard sequence of outcomes (equally spaced in terms of utility) is indepe...
-
作者：Iancu, Dan A.; Sharma, Mayank; Sviridenko, Maxim
作者单位：Stanford University; International Business Machines (IBM); IBM USA; University of Warwick
摘要：This paper considers a particular class of dynamic robust optimization problems, where a large number of decisions must be made in the first stage, which consequently fix the constraints and cost structure underlying a one-dimensional, linear dynamical system. We seek to bridge two classical paradigms for solving such problems, namely, (1) dynamic programming (DP), and (2) policies parameterized in model uncertainties (also known as decision rules), obtained by solving tractable convex optimiz...
-
作者：Philpott, Andy; de Matos, Vitor; Finardi, Erlon
作者单位：University of Auckland; Universidade Federal de Santa Catarina (UFSC)
摘要：We consider a class of multistage stochastic linear programs in which at each stage a coherent risk measure of future costs is to be minimized. A general computational approach based on dynamic programming is derived that can be shown to converge to an optimal policy. By computing an inner approximation to future cost functions, we can evaluate an upper bound on the cost of an optimal policy, and an outer approximation delivers a lower bound. The approach we describe is particularly useful in ...
-
作者：Adlakha, Sachin; Johari, Ramesh
作者单位：California Institute of Technology; Stanford University
摘要：We study a class of stochastic dynamic games that exhibit strategic complementarities between players; formally, in the games we consider, the payoff of a player has increasing differences between her own state and the empirical distribution of the states of other players. Such games can be used to model a diverse set of applications, including network security models, recommender systems, and dynamic search in markets. Stochastic games are generally difficult to analyze, and these difficultie...
