-
作者：Golrezaei, Negin; Manshadi, Vahideh; Schneider, Jon; Sekard, Shreyas
作者单位：Massachusetts Institute of Technology (MIT); Yale University; Alphabet Inc.; Google Incorporated; University of Toronto; University Toronto Scarborough; University of Toronto
摘要：In many online platforms, customers' decisions are substantially influenced by product rankings as most customers only examine a few top-ranked products. This induces a race for visibility among sellers, who may be incentivized to artificially inflate their position by employing fake users as exemplified by the emergence of click farms. Motivated by such fraudulent behavior, we study the problem of learning product rankings when a platform faces a mixture of real and fake users who are indisti...
-
作者：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...
-
作者：Lorentziadis, Panos L.
作者单位：Athens University of Economics & Business
摘要：In multidimensional auctions, bidders compete in both quality and price, which are combined by a score rule. A well-known problem in procurement management is that nonprice attributes are often poorly measured and unreliably estimated. Adjustments of the reported quality based on the qualities of rival bids can enhance the reliability of the measurement process. We develop a general model of score function that is dependent on the qualities offered by all bidders who differ in terms of their p...
-
作者：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 ...
-
作者：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...
-
作者：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...
-
作者：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...
-
作者：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...
-
作者：Lamas-Fernandez, Carlos; Bennell, Julia A.; Martinez-Sykora, Antonio
作者单位：University of Southampton; Solent University; University of Leeds
摘要：Research on the three-dimensional (3D) packing problem has largely focused on packing boxes for the transportation of goods. As a result, there has been little focus on packing irregular shapes in the operational research literature. New technologies have raised the practical importance of 3D irregular packing problems and the need for efficient solutions. In this work, we address the variant of the problem where the aim is to place a set of 3D irregular items in a container, while minimizing ...
-
作者：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...
