-
作者：Bai, Yicheng; Feldman, Jacob; Segev, Danny; Topaloglu, Huseyin; Wagner, Laura
作者单位：Washington University (WUSTL); Tel Aviv University; Universidade Catolica Portuguesa
摘要：In this paper, we introduce the Multi-Purchase Multinomial Logit choice model, which extends the random utility maximization framework of the classical Multinomial Logit model to a multiple-purchase setting. In this model, customers sample random utilities for each offered product as in the Multinomial Logit model. However, rather than focusing on a single product, they concurrently sample a budget parameter M , which indicates the maximum number of products that the customer is willing to pur...
-
作者：Pham, Manh; Simar, Leopold; Zelenyukc, Valentin
作者单位：University of Queensland; Universite Catholique Louvain; University of Queensland; University of Queensland
摘要：The Malmquist productivity index (MPI) has gained popularity among studies on the dynamic change of productivity of decision-making units (DMUs). In practice, this index is frequently reported at aggregate levels (e.g., public and private firms) in the form of simple, equally weighted arithmetic or geometric means of individual MPIs. A number of studies emphasize that it is necessary to account for the relative importance of individual DMUs in the aggregations of indices in general and of the ...
-
作者：Chen, Zhi; Kuhn, Daniel; Wiesemann, Wolfram
作者单位：City University of Hong Kong; Imperial College London
摘要：We provide an exact deterministic reformulation for data-driven, chanceconstrained programs over Wasserstein balls. For individual chance constraints as well as joint chance constraints with right-hand-side uncertainty, our reformulation amounts to a mixed-integer conic program. In the special case of a Wasserstein ball with the 1-norm or the ???-norm, the cone is the nonnegative orthant, and the chance-constrained program can be reformulated as a mixed-integer linear program. Our reformulatio...
-
作者：Wang, Shouqiang; de Vericourt, Francis; Sun, Peng
作者单位：University of Texas System; University of Texas Dallas; European School of Management & Technology; Duke University
摘要：In this paper, we explore how to uncover an adverse issue that may occur in organizations with the capability to evade detection. To that end, we formalize the problem of designing efficient auditing and remedial strategies as a dynamic mechanism design model. In this setup, a principal seeks to uncover and remedy an issue that occurs to an agent at a random point in time and that harms the principal if not addressed promptly. Only the agent observes the issue's occurrence, but the principal m...
-
作者：[Anonymous]
-
作者：Koulamas, Christos; Kyparisis, George; Pinedo, Michael; Wan, Guohua
作者单位：State University System of Florida; Florida International University; New York University; Shanghai Jiao Tong University
摘要：Leung et al. (2010) [Leung JY-T, Pinedo M, Wan G (2010) Competitive two-agent scheduling and its applications. Oper. Res. 58:458-469] considered a two-agent nonpreemp-tive single-machine scheduling problem. Agent A is responsible for n1 jobs with due dates d1,...,dn and has as the objective the minimization of the total tardiness of the n1 jobs. Agent B is responsible for n2 jobs and has as the objective the minimization of the total completion time of the n2 jobs. The problem is to find a sch...
-
作者：Kondratev, Aleksei Y.; Ianovski, Egor; Nesterov, Alexander S.
作者单位：HSE University (National Research University Higher School of Economics)
摘要：Scoring rules are widely used to rank athletes in sports and candidates in elections. Each position in each individual ranking is worth a certain number of points; the total sum of points determines the aggregate ranking. The question is how to choose a scoring rule for a specific application. First, we derive a one-parameter family with geometric scores that satisfies two principles of independence: once an extremely strong or weak candidate is removed, the aggregate ranking ought to remain i...
-
作者：Feng, Yiding; Niazadeh, Rad; Saberi, Amin
作者单位：Microsoft; University of Chicago; Stanford University
摘要：Matching and pricing are two critical levers in two-sided marketplaces to connect demand and supply. The platform can produce more efficient matching and pricing decisions by batching the demand requests. We initiate the study of the two-stage stochastic matching problem, with or without pricing, to enable the platform to make improved decisions in a batch with an eye toward the imminent future demand requests. This problem is motivated in part by applications in online marketplaces, such as r...
-
作者：Wu, Di; Wang, Yuhao; Zhou, Enlu
作者单位：Amazon.com; University System of Georgia; Georgia Institute of Technology
摘要：We consider a simulation-based ranking and selection (R&S) problem with input uncertainty, in which unknown input distributions can be estimated using input data arriving in batches of varying sizes over time. Each time a batch arrives, additional simulations can be run using updated input distribution estimates. The goal is to confi- dently identify the best design after collecting as few batches as possible. We first introduce a moving average estimator for aggregating simulation outputs gen...
-
作者：Kim, Taeho; Kim, Kyoung-Kuk; Song, Eunhye
作者单位：Hong Kong University of Science & Technology; Korea Advanced Institute of Science & Technology (KAIST); University System of Georgia; Georgia Institute of Technology
摘要：We consider an expected-value ranking and selection (R&S) problem where all k solutions' simulation outputs depend on a common parameter whose uncertainty can be modeled by a distribution. We define the most probable best (MPB) to be the solution that has the largest probability of being optimal with respect to the distribution and design an efficient sequential sampling algorithm to learn the MPB when the parameter has a finite support. We derive the large deviations rate of the probability o...
