-
作者：Ding, Yichuan; Gupta, Diwakar; Tang, Xiaoxu
作者单位：McGill University; University of Texas System; University of Texas Austin; Wells Fargo Company
摘要：We study an appointment-based slotted-service queue with the goal of maximizing service volume. Returning customers prefer to be served by the same service agent as in their previous visit. This model captures aspects of a whole host of settings, including medical clinics, law firms, and tutoring services. We consider a simple strategy that a service provider may use to reduce balking among returning customers-designate some returning customers as high-priority customers. These customers are p...
-
作者：Loehndorf, Nils; Wozabalb, David
作者单位：University of Luxembourg; Technical University of Munich
摘要：We consider the problem of a storage owner who trades in a multisettlement electricity market comprising an auction-based day-ahead market and a continuous intraday market. We show in a stylized model that a coordinated policy that reserves capacity for the intraday market is optimal and that the gap to a sequential policy increases with intraday price volatility and market liquidity. To assess the value of coordination in a realistic setting, we develop amultistage stochastic programfor day-a...
-
作者：Yoo, Onesun Steve; Zhan, Dongyuan
作者单位：University of London; University College London
摘要：A critical issue in operating massive open online courses (MOOCs) is the scalability of providing feedback. Because it is not feasible for instructors to grade a large number of students' assignments, MOOCs use peer grading systems. This study investigates the efficacy of that practice when student graders are rational economic agents. We characterize grading as a process of (a) acquiring information to assess an assignment's quality and (b) reporting a score. This process entails a tradeoff b...
-
作者：Huchette, Joey; Vielma, Juan Pablo
作者单位：Rice University; Massachusetts Institute of Technology (MIT)
摘要：We present novel mixed-integer programming (MIP) formulations for optimization over nonconvex piecewise linear functions. We exploit recent advances in the systematic construction of MIP formulations to derive new formulations for univariate functions using a geometric approach and for bivariate functions using a combinatorial approach. All formulations are strong, small (so-called logarithmic formulations), and have other desirable computational properties. We present extensive experiments in...
-
作者：Liguori, Pedro Henrique; Mahjoub, A. Ridha; Marques, Guillaume; Sadykov, Ruslan; Uchoa, Eduardo
作者单位：Kuwait University; Universite de Bordeaux; Universidade Federal Fluminense
摘要：The capacitated location-routing problem consists in, given a set of locations and a set of customers, determining in which locations one should install depots with limited capacity, and for each depot, design a number of routes to supply customer demands. We provide a formulation that includes depot variables, edge variables, assignment variables, and an exponential number of route variables, together with some new families of valid inequalities, leading to a branch-cut-and-price algorithm. T...
-
作者：Feizi, Arshya; Carson, Anita; Jaeker, Jillian Berry; Baker, William Evan
作者单位：Harvard University; Boston University; University of Vermont; University of Vermont Medical Center
摘要：We study the behavior of batching by discretionary workers in the first stage of a two-stage queuing system and explore the trade-off it causes between their productivity and second stage wait times. Specifically, we focus on the behavior of batching admissions by emergency department (ED) physicians. Using data from a large hospital, we show that the probability of batching admissions is increasing in the hour of an ED physician's shift, and that batched patients experience a 4.7% longer dela...
-
作者：Liang, Yong; Sun, Peng; Tang, Runyu; Zhang, Chong
作者单位：Tsinghua University; Duke University; Xi'an Jiaotong University; Tilburg University
摘要：Motivated by the allocation of online visits to product, service, and content suppliers in the platform economy, we consider a dynamic contract design problem in which a principal constantly determines the allocation of a resource (online visits) to multiple agents. Although agents are capable of running the business, they introduce adverse events, the frequency of which depends on each agent???s effort level. We study continuous-time dynamic contracts that utilize resource allocation and mone...
-
作者：Bai, Xingyu; Chen, Xin; Li, Menglong; Stolyar, Alexander
作者单位：University of Illinois System; University of Illinois Urbana-Champaign; University System of Georgia; Georgia Institute of Technology; City University of Hong Kong; University of Illinois System; University of Illinois Urbana-Champaign
摘要：We consider a generic Markov decision process (MDP) with two controls: one control taking effect immediately and the other control whose effect is delayed by a positive lead time. As the lead time grows, one naturally expects that the effect of the delayed action only weakly depends on the current state, and decoupling the delayed action from the current state could provide good controls. The purpose of this paper is to substantiate this decoupling intuition by establishing asymptotic optimali...
-
作者：Maglaras, Costis; Scarsini, Marco; Shin, Dongwook; Vaccarid, Stefano
作者单位：Columbia University; Luiss Guido Carli University; Hong Kong University of Science & Technology
摘要：This paper studies product ranking mechanisms of a monopolistic online platform in the presence of social learning. The products' quality is initially unknown, but consumers can sequentially learn it as online reviews accumulate. A salient aspect of our problem is that consumers, who want to purchase a product from a list of items displayed by the platform, incur a search cost while scrolling down the list. In this setting, the social learning dynamics, and hence the demand, is affected by the...
-
作者：Goyal, Vineet; Udwani, Rajan
作者单位：Columbia University; University of California System; University of California Berkeley
摘要：The problem of online matching with stochastic rewards is a generalization of the online bipartitematching problemwhere each edge has a probability of success. When a match is made it succeeds with the probability of the corresponding edge. We consider the more general vertex-weighted version of the problem and give two new results. First, we show that a natural generalization of the perturbed-greedy algorithm is (1 - 1/e) competitive when probabilities decompose as a product of two factors, o...
