-
作者：Alaei, Saeed; Makhdoumi, Ali; Malekian, Azarakhsh
作者单位：Alphabet Inc.; Google Incorporated; Duke University; University of Toronto
摘要：We consider the problem of selling k units of an item to n unit-demand buyers to maximize revenue, where the buyers' values are independently distributed (not necessarily identical) according to publicly known distributions but unknown to the buyers themselves, with the option of allowing buyers to inspect the item at a cost. This problem can be interpreted as a revenue-maximizing variant of Weitzman's Pandora's problem with a nonobligatory inspection. We first fully characterize the optimal m...
-
作者：Jalota, Devansh; Ye, Yinyu
作者单位：Stanford University; Stanford University
摘要：Fisher markets are one of the most fundamental models for resource allocation. However, the problem of computing equilibrium prices in Fisher markets typically relies on complete knowledge of users' budgets and utility functions and requires transactions to happen in a static market where all users are present simultaneously. Motivated by these practical considerations, we study an online variant of Fisher markets, wherein users with privately known utility and budget parameters, drawn indepen...
-
作者：Bai, Hao; Bensoussan, Alain; Briest, Gordon; Chevalier-Roignant, Benoi
作者单位：University of Manchester; University of Texas System; University of Texas Dallas; Otto von Guericke University; emlyon business school
摘要：Many cities face challenges in financing their infrastructure. If a decision maker cannot capture all the benefits of its investment, there is a risk of underinvestment. Hong Kong's transit operator designed a scheme in which it not only receives fare revenues, but also participates in a property management business, exploiting the positive externalities of public transport on nearby property prices. We develop a stochastic Stackelberg game of timing to explore the rationale of this scheme. Th...
-
作者：Darivianakis, Georgios; Georghiou, Angelos; Shafiee, Soroosh; Lygeros, John
作者单位：University of Cyprus; Cornell University; Swiss Federal Institutes of Technology Domain; ETH Zurich
摘要：Designing policies for a network of agents is typically done by formulating an optimization problem where each agent has access to state measurements of all the other agents in the network. Such policy designs with centralized information exchange result in optimization problems that are typically hard to solve, require establishing substantial communication links, and do not promote privacy since all information is shared among the agents. Designing policies based on arbitrary communication s...
-
作者：Hu, Jie; Chen, Zhi; Wang, Shuming
作者单位：Beijing Jiaotong University; Chinese Academy of Sciences; University of Chinese Academy of Sciences, CAS; Chinese University of Hong Kong
摘要：We study the (un)capacitated multiperiod hub location problem with uncertain periodic demands. With a distributionally robust approach that considers time series, we build a model driven by budgets on periodic costs. In particular, we construct a nested ambiguity set that characterizes uncertain periodic demands via a general multivariate time-series model, and to ensure stable periodic costs, we propose to constrain each expected periodic cost within a budget whereas optimizing the robustness...
-
作者：Xie, Tong; Wang, Zizhuo
作者单位：University of Chicago; The Chinese University of Hong Kong, Shenzhen
摘要：In this paper, we introduce a consumer choice model where each consumer's utility is affected by their neighbors' purchase probabilities in a network. We first characterize the choice probabilities in this model and then consider the associated personalized assortment optimization problem. Although this problem is NP-hard, we show that for star networks, the optimal assortment to the central consumer and peripheral consumers cannot be strictly larger than that without network effects, and the ...
-
作者：Besbes, Omar; Kanoria, Yash; Kumar, Akshit
作者单位：Columbia University
摘要：Dynamic resource allocation problems are ubiquitous, arising in inventory management, order fulfillment, online advertising, and other applications. We initially focus on one of the simplest models of online resource allocation: the multisecretary problem. In the multisecretary problem, a decision maker sequentially hires up to B out of T candidates, and candidate ability values are independently and identically distributed from a distribution F on [ 0, 1 ] . First, we investigate fundamental ...
-
作者：Li, Sung Ko; Tsang, Chun Kei; Lee, Shu Kam; He, Xinju
作者单位：Hong Kong Shue Yan University; Hefei University of Technology; Hong Kong Baptist University; Guangxi University; Guangxi University
摘要：The most frequently used empirical production frontier in data envelopment analysis, the variable returns to scale frontier, has a convex technology set and displays a special structure in economics, called the regular variable returns to scale in this paper; the production technology exhibits increasing returns to scale at the beginning of the production process followed by constant returns to scale and decreasing returns to scale. When the assumption of convexity is relaxed, modeling regular...
-
作者：Zhang, Jingwei; Ma, Will; Topaloglu, Huseyin
作者单位：The Chinese University of Hong Kong, Shenzhen; Columbia University; Columbia University
摘要：We study the joint assortment and inventory planning problem with stockoutbased substitution. In this problem, we pick the number of units to stock for the products at the beginning of the selling horizon. Each arriving customer makes a choice among the set of products with remaining on-hand inventories. Our goal is to pick the stocking quantities to maximize the total expected revenue from the sales net of the stocking cost. We develop a rounding scheme that uses the solution to a fluid appro...
-
作者：Feng, Qing; Zhu, Ruihao; Jasin, Stefanus
作者单位：Cornell University; Cornell University; University of Michigan System; University of Michigan
摘要：Motivated by the prevalence of price protection guarantee which helps to promote temporal fairness in dynamic pricing, we study the impact of such policy on the design of online learning algorithms for data-driven dynamic pricing with initially unknown customer demand. Under the price protection guarantee, a customer who purchased a product in the past can receive a refund from the seller during the so-called price protection period (typically defined as a certain time window after the purchas...
