-
作者：DeValve, Levi; Pekec, Sasa; Wei, Yehua
作者单位：University of Chicago; Duke University
摘要：Network design problems, such as flexibility design, are ubiquitous in modern marketplaces where firms constantly innovate new ways to match supply and demand. We develop a primal-dual based approach to analyze the flexibility design problem, and establish that the problem possesses a novel structural property. The property, which we call cover modularity, can be interpreted as an approximate form of submodularity in the sense that local changes in the objective function can be used to bound g...
-
作者：Vojnovic, Milan; Yun, Se-Young; Zhou, Kaifang
作者单位：University of London; London School Economics & Political Science; Korea Advanced Institute of Science & Technology (KAIST)
摘要：The problem of assigning ranking scores to items based on observed comparison data (e.g., paired comparisons, choice, and full ranking outcomes) has been of continued interest in a wide range of applications, including information search, aggregation of social opinions, electronic commerce, online gaming platforms, and, more recently, evaluation of machine learning algorithms. The key problem is to compute ranking scores, which are of interest for quantifying the strength of skills, relevancie...
-
作者：Flamand, Tulay; Ghoniem, Ahmed; Maddah, Bacel
作者单位：Colorado School of Mines; University of Massachusetts System; University of Massachusetts Amherst; American University of Beirut
摘要：Given a store layout, product categories grouped into shelves, and historical sales data, we investigate how the allocation of product categories can be optimized in a fashion that guides in-store traffic and stimulates impulse buying. The latter constitutes an important shopping behavior that amounts to over 50% of the revenue in some retail settings. Considering a small-scale grocery store in Beirut, we analyze 40,000 customer receipts in order to relate in-store customer traffic to product ...
-
作者：Chen, Xi; Wang, Yining
作者单位：New York University; University of Texas System; University of Texas Dallas
摘要：This paper studies a dynamic pricing problem undermodel misspecification. To characterize model misspecification, we adopt the epsilon-contamination model-the most fundamental model in robust statistics and machine learning. In particular, for a selling horizon of length T, the online epsilon-contamination model assumes that demands are realized according to a typical unknown demand function only for (1 - epsilon)T periods. For the rest of epsilon T periods, an outlier purchase can happen with...
-
作者：Lighta, Bar
作者单位：Microsoft
摘要：We study a pure-exchange incomplete-market economy with heterogeneous agents. In each period, the agents choose how much to save (i.e., invest in a risk-free bond), how much to consume, and which bundle of goods to consume while their endowments are fluctuating. We focus on a competitive stationary equilibrium (CSE) in which the wealth distribution is invariant, the agents maximize their expected discounted utility, and both the prices of consumption goods and the interest rate are market-clea...
-
作者：Zychlinski, Noa; Chan, Carri W.; Dong, Jing
作者单位：Technion Israel Institute of Technology; Columbia University
摘要：Queueing models that are used to capture various service settings typically assume that customers require a single unit of resource (server) to be processed. However, there are many service settings where such an assumption may fail to capture the heterogeneity in resource requirements of different customers. We propose a multiserver queueing model with multiple customer classes in which customers from different classes may require different amounts of resources to be served. We study the opti...
-
作者：Asadpour, Arash; Niazadeh, Rad; Saberi, Amin; Shameli, Ali
作者单位：City University of New York (CUNY) System; Baruch College (CUNY); University of Chicago; Stanford University
摘要：We study a submodular maximization problem motivated by applications in online retail. A platform displays a list of products to a user in response to a search query. The user inspects the first k items in the list for a k chosen at random from a given distribution and decides whether to purchase an item from that set based on a choice model. The goal of the platform is to maximize the engagement of the shopper defined as the probability of purchase. This problem gives rise to a less-studied v...
-
作者：Aouad, Ali; Segev, Danny
作者单位：University of London; London Business School; Tel Aviv University
摘要：We study the incremental knapsack problem, where one wishes to sequentially pack items into a knapsack whose capacity expands over a finite planning horizon, with the objective of maximizing time-averaged profits. Although various approximation algorithms were developed under mitigating structural assumptions, obtaining nontrivial performance guarantees for this problem in its utmost generality has remained an open question thus far. In this paper, we devise a polynomial-time approximation sch...
-
作者：Talluri, Kalyan; Tsoukalasb, Angelos
作者单位：Imperial College London; Erasmus University Rotterdam; Erasmus University Rotterdam - Excl Erasmus MC
摘要：Professional service firms (PSFs) such as management consulting, law, accounting, investment banking, architecture, advertising, and home-repair companies provide services for complicated turnkey projects. A firm bids for a project and, if successful in the bid, assigns employees to work on the project. We formulate this as a revenue management problem under two assumptions: a quality-revelation setup, where the employees that would be assigned to the project are committed ex ante, as part of ...
-
作者：Hamidi, Nima; Bayati, Mohsen
作者单位：Stanford University; Stanford University
摘要：In this note, we introduce a general version of the well-known elliptical potential lemma that is a widely used technique in the analysis of algorithms in sequential learning and decision-making problems. We consider a stochastic linear bandit setting where decision makers sequentially choose among a set of given actions, observe their noisy rewards, and aim to maximize their cumulative expected reward over a decision-making horizon. The elliptical potential lemma is a key tool for quantifying...
