-
作者:Bai, Yicheng; Feldman, Jacob; Topaloglu, Huseyin; Wagner, Laura
作者单位:Washington University (WUSTL); University of Navarra; IESE Business School
摘要:We study assortment optimization problems under a natural variant of the multinomial logit model where the customers are willing to focus only on a certain number of products that provide the largest utilities. In particular, each customer has a rank cutoff, characterizing the number of products that she will focus on during the course of her choice process. Given that we offer a certain assortment of products, the choice process of a customer with rank cutoff k proceeds as follows. The custom...
-
作者:Chen, Zhi; Hu, Zhenyu; Wang, Ruiqin
作者单位:Chinese University of Hong Kong; National University of Singapore; National University of Singapore
摘要:Consider a seller seeking a selling mechanism to maximize the worst-case revenue obtained from a buyer whose valuation distribution lies in a certain ambiguity set. Such a mechanism design problem with one product and one buyer is known as the screening problem. For a generic convex ambiguity set, we show via the minimax theorem that strong duality holds between the problem of finding the optimal robust mechanism and a minimax pricing problem where the adversary first chooses a worst-case dist...
-
作者:Mildebrath, David; Lee, Taewoo; Sinha, Saumya; J., Andrew; Gaber, A. Osama
作者单位:Rice University; Pennsylvania Commonwealth System of Higher Education (PCSHE); University of Pittsburgh; University of Minnesota System; University of Minnesota Twin Cities; Houston Methodist
摘要:Organ transplantation is an increasingly common therapy for many types of end-stage organ failure, including lungs, hearts, kidneys, and livers. The last 20 years have seen increased scrutiny of posttransplant outcomes in the United States to ensure the efficient utilization of the scarce organ supply. Under regulations by the Organ Procurement Transplantation Network (OPTN) and Centers for Medicare and Medicaid Services (CMS), the United States has seen a rise in risk-averse patient selection...
-
作者:Shi, Yunting; Liu, Nan; Wan, Guohua
作者单位:Shanghai Jiao Tong University; Boston College
摘要:The current emergency response guidelines suggest giving priority of treatment to those victims whose initial health conditions are more critical. Although this makes intuitive sense, it does not consider potential deterioration of less critical victims. Deterioration may lead to longer treatment time and irrecoverable health damage, but could be avoided if these victims were to receive care in time. Informed by a unique timestamps data set of surgeries carried out in a field hospital set up i...
-
作者:Poursoltani, Mehran; Delage, Erick; Georghiou, Angelos
作者单位:Universite de Montreal; HEC Montreal; Universite de Montreal; HEC Montreal; University of Cyprus
摘要:Within the context of optimization under uncertainty, a well-known alternative to minimizing expected value or the worst-case scenario consists in minimizing regret. In a multistage stochastic programming setting with a discrete probability distribution, we explore the idea of risk-averse regret minimization, where the benchmark policy can only benefit from foreseeing increment steps into the future. The increment -regret model naturally interpolates between the popular ex ante and ex post reg...
-
作者:Gao, Xuefeng; Huang, Junfei; Zhang, Jiheng
作者单位:Chinese University of Hong Kong; Chinese University of Hong Kong; Hong Kong University of Science & Technology
摘要:Motivated by the recent popularity of omnichannel service systems, we analyze the joint admission and scheduling control of a queueing system with two classes of customers: online and walk-in. Unlike walk-in customers, online customers are given a target time for pick up upon placing an order. Thus, in addition to minimizing the waiting costs of walk-in customers and the rejection cost of both classes, we need to minimize the earliness and tardiness costs of online customers. Such a distinctiv...
-
作者:Kennedy, Adrian P.; Sethi, Suresh P.; Siu, Chi Chung; Yam, Sheung Chi Phillip
作者单位:Chinese University of Hong Kong; University of Texas System; University of Texas Dallas; Hang Seng University of Hong Kong
摘要:We propose a flexible yet tractable dynamic advertising model called the generalized Sethi model to capture different market penetration rates across various media and markets via advertising. Specifically, the generalized Sethi model employs a Cobb-Douglas production function of advertising expenditure and the untapped market share with constant returns to scale. It encompasses some standard dynamic advertising models as particular cases. Moreover, the model's flexibility does not compromise ...
-
作者:Zhu, Yi; Dong, Jing; Lam, Henry
作者单位:Northwestern University; Columbia University; Columbia University
摘要:We investigate statistical uncertainty quantification for reinforcement learning (RL) and its implications in exploration policy. Despite ever-growing literature on RL applications, fundamental questions about inference and error quantification, such as large-sample behaviors, appear to remain quite open. In this paper, we fill in the literature gap by studying the central limit theorem behaviors of estimated Q-values and value functions under various RL settings. In particular, we explicitly ...
-
作者:Romeijnders, Ward; Van Foreest, Nicky D.; Wijngaard, Jacob
作者单位:University of Groningen
摘要:When Dutch parents divorce, Dutch law dictates that the parental contributions to cover the financial needs of the children have to be proportionally consistent. This rule is clear when parents only have common children. However, cases can be considerably more complicated, for example, when parents have financial responsibilities to children from previous marriages. We show that, mathematically, this settlement problem can be modeled as a bipartite rationing problem for which a unique global p...
-
作者:Benade, Gerdus; Kazachkov, Aleksandr M.; Procaccia, Ariel D.; Psomas, Alexandros; Zeng, David
作者单位:Boston University; State University System of Florida; University of Florida; Harvard University; Purdue University System; Purdue University
摘要:We study trade-offs between fairness and efficiency when allocating indivisible items online. We attempt to minimize envy, the extent to which any agent prefers another's allocation to their own, while being Pareto efficient. We provide matching lower and upper bounds against a sequence of progressively weaker adversaries. Against worst-case adversaries, we find a sharp trade-off; no allocation algorithm can simultaneously provide both nontrivial fairness and nontrivial efficiency guarantees. ...