-
作者:Wang, Wenyu; Wan, Hong; Chen, Xi
作者单位:North Carolina State University; Virginia Polytechnic Institute & State University
摘要:This paper proposes two fully sequential procedures for selecting the best system with a guaranteed probability of correct selection (PCS). The main features of the proposed procedures include the following: (1) adopting a Bonferroni-free model that overcomes the conservativeness of the Bonferroni correction and delivers the exact probabilistic guarantee without overshooting; (2) conducting always valid and fully sequential hypothesis tests that enable continuous monitoring of each candidate s...
-
作者: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 ...
-
作者:Jia, Huiwen; Shi, Cong; Shen, Siqian
作者单位:University of Michigan System; University of Michigan
摘要:We consider a price-based revenue management problem with finite reusable resources over a finite time horizon T. Customers arrive following a price-dependent Poisson process, and each customer requests one unit of c homogeneous reusable resources. If there is an available unit, the customer gets served within a price-dependent exponentially distributed service time; otherwise, the customer waits in a queue until the next available unit. In this paper, we assume that the firm does not know how...
-
作者:Balseiro, Santiago R.; Besbes, Omar; Castro, Francisco
作者单位:Columbia University; University of California System; University of California Los Angeles
摘要:A fundamental assumption in classical mechanism design is that buyers are perfect optimizers. However, in practice, buyers may be limited by their computational capabilities or a lack of information and may not be able to perfectly optimize their response to a mechanism. This has motivated the introduction of approximate incentive compatibility (IC) as an appealing solution concept for practical mechanism design. Although most of the literature has focused on the analysis of particular approxi...
-
作者:Blaettchen, Philippe; Taneri, Niyazi; Hasija, Sameer
作者单位:City St Georges, University of London; University of Cambridge; INSEAD Business School
摘要:Technological advances enable new business models for heavy equipment manufacturers wherein customers access equipment without ownership. We seek to understand the profitability and environmental performance of different emerging business models in light of salient economic and operational factors. We develop a game-theoretic model to identify the optimal choice between a traditional ownership-based business model and two access-based models: servicization and peer-to-peer sharing. After-sales...
-
作者:Alon, Tal; Talgam-Cohen, Inbal; Lavi, Ron; Shamash, Elisheva
作者单位:Technion Israel Institute of Technology; University of Bath; Keele University
摘要:We study contract design for welfare maximization in the well-known common agency model introduced in 1986 by Bernheim and Whinston. This model combines the challenges of coordinating multiple principals with the fundamental challenge of contract design: that principals have incomplete information of the agent's choice of action. Our goal is to design contracts that satisfy truthfulness of the principals, welfare maximization by the agent, and two fundamental properties of individual rationali...
-
作者:He, Shengyi; Jiang, Guangxin; Lam, Henry; Fu, Michael C.
作者单位:Columbia University; Harbin Institute of Technology; University System of Maryland; University of Maryland College Park; University System of Maryland; University of Maryland College Park
摘要:In solving simulation-based stochastic root-finding or optimization problems that involve rare events, such as in extreme quantile estimation, running crude Monte Carlo can be prohibitively inefficient. To address this issue, importance sampling can be employed to drive down the sampling error to a desirable level. However, selecting a good importance sampler requires knowledge of the solution to the problem at hand, which is the goal to begin with and thus forms a circular challenge. We inves...
-
作者:den Boer, Arnoud V.; Chen, Boxiao; Wang, Yining
作者单位:University of Amsterdam; University of Illinois System; University of Illinois Chicago; University of Illinois Chicago Hospital; University of Texas System; University of Texas Dallas
摘要:We consider the problem of determining the optimal prices and product configurations of horizontally differentiated products when customers purchase according to a locational (Hotelling) choice model and where the problem parameters are initially unknown to the decision maker. Both for the single-product and multiple-product setting, we propose a data-driven algorithm that learns the optimal prices and product configurations from accumulating sales data, and we show that their regret-the expec...
-
作者:Bandi, Chaithanya; Han, Eojin; Proskynitopoulos, Alexej
作者单位:National University of Singapore; Southern Methodist University; Northwestern University
摘要:Observational data from queueing systems are of great practical interest in many application areas because they can be leveraged for better statistical inference of service processes. However, these observations often only provide partial information of the system for various reasons in real-world settings. Moreover, their complex temporal dependence on the queueing dynamics and the absence of distributional information on the model primitives render estimation of queueing systems remarkably c...
-
作者:den Hertog, Dick; Pauphilet, Jean; Soali, Mohamed Yahya
作者单位:University of Amsterdam; University of London; Columbia University
摘要:Centers of convex sets are geometric objects that have received extensive attention in the mathematical and optimization literature, both from a theoretical and practical standpoint. For instance, they serve as initialization points for many algorithms such as interior-point, hit-and-run, or cutting-planes methods. First, we observe that computing a Minkowski center of a convex set can be formulated as the solution of a robust optimization problem. As such, we can derive tractable formulations...