-
作者：Bu, Jinzhi; Gong, Xiting; Yao, Dacheng
作者单位：Massachusetts Institute of Technology (MIT); Chinese University of Hong Kong; Chinese Academy of Sciences; Academy of Mathematics & System Sciences, CAS
摘要：We consider an infinite-horizon lost-sales inventory model where the supply takes positive lead times and is a random function of the order quantity (e.g., random yield/capacity). The optimal policy for this model is computationally intractable, and no heuristic has been proposed in the literature. In this paper, we focus on a simple class of constant-order policies (COPs) that place the same order in every period regardless of the system state. Under some assumptions on the random supply func...
-
作者：Wang, Jue; Levin, Yuri; Nediak, Mikhail
作者单位：Queens University - Canada
摘要：Passes are prepaid packages of multiple units of goods or services with flexible consumption times. They may take a variety of forms such as commuter passes in transportation, capped quotas in telecommunications, or memberships in health or beauty clubs. We consider a monopolist selling products or services to strategic customers by dynamically pricing passes in conjunction with individual items. The strategic behavior is captured by a dynamic choice model that endogenizes strategic purchase, ...
-
作者：Aflaki, Arian; Feldman, Pnina; Swinney, Robert
作者单位：Pennsylvania Commonwealth System of Higher Education (PCSHE); University of Pittsburgh; Boston University; Duke University
摘要：Pricing over multiple periods under forward-looking, strategic consumer purchasing behavior has received significant recent research attention; however, whether consumers actually benefit from this behavior and would voluntarily choose to be strategic has not been previously considered. We explore this question by developing a model of endogenous time preferences, consistent with microeconomic theories of boundedly rational intertemporal decision making, in which consumers choose to become str...
-
作者：Mansour, Yishay; Slivkins, Aleksandrs; Syrgkanis, Vasilis
作者单位：Tel Aviv University; Microsoft; Microsoft
摘要：As self-interested individuals (agents) make decisions over time, they utilize information revealed by other agents in the past and produce information that may help agents in the future. This phenomenon is common in a wide range of scenarios in the Internet economy, as well as in medical decisions. Each agent would like to exploit: select the best action given the current information, but would prefer the previous agents to explore: try out various alternatives to collect information. A socia...
-
作者：Hassin, Refael; Snitkovsky, Ran I.
作者单位：Tel Aviv University
摘要：Naor's celebrated paper studies customer decisions in an observable M/M/1 queue in which joining-customers utility is linearly decreasing with the joining position. Naor derives the optimal threshold strategies for the individuals, social planner, and monopolist and proves that the monopoly optimal threshold is (weakly) smaller than the socially optimal threshold, which is (weakly) smaller than the individually optimal one. Studies show, based on numerical observations and/or ad hoc proof tech...
-
作者：Romeijnders, Ward; van der Laan, Niels
作者单位：University of Groningen
摘要：We propose a novel way of applying cutting plane techniques to two-stage mixed-integer stochastic programs with uncertainty in the right-hand side. Instead of using cutting planes that are always valid, our idea is to apply pseudo-valid cutting planes to the second-stage feasible regions that may cut away feasible integer second-stage solutions for some scenarios and may be overly conservative for others. The advantage is that it allows us to use cutting planes that are affine in the first-sta...
-
作者：Long, Zhenghua; Shimkin, Nahum; Zhang, Hailun; Zhang, Jiheng
作者单位：Nanjing University; Technion Israel Institute of Technology; The Chinese University of Hong Kong, Shenzhen; Hong Kong University of Science & Technology
摘要：We study the fluid model of a many-server queue with multiple customer classes and obtain optimality results for this model. For the purpose of minimizing the long-run average queue-length costs and abandon penalties, we propose three scheduling policies to cope with any general cost functions and general patience-time distributions. First, we introduce the target-allocation policy, which assigns higher priority to customer classes with larger deviation from the desired allocation of the servi...
-
作者：Haviv, Avery
作者单位：University of Rochester
摘要：In this paper I develop a cyclic value function iteration, which is an adjustment to the standard value function iteration. When using this algorithm, the inclusion of cyclic variables of any size into the state space of an infinite horizon Markov decision process does not increase the computational complexity of solving for the value function. This result is proven theoretically and shown to closely hold in practice using Monte Carlo simulations.
-
作者：He, Shuangchi
作者单位：National University of Singapore
摘要：Motivated by call center practice, we propose a tractable approximate model for queues with general service and patience time assumptions in the efficiency-driven (ED) regime, when customers' patience times are relatively long compared with their service times. We use a one-dimensional diffusion process to approximate the virtual waiting time process that is scaled in both magnitude and time, with the number of servers and the mean patience time as the respective scaling factors. Using this di...
-
作者：Roughgarden, Tim; Talgam-Cohen, Inbal; Yan, Qiqi
作者单位：Columbia University; Technion Israel Institute of Technology
摘要：Most results in revenue-maximizing mechanism design hinge on getting the price right-selling goods to bidders at prices low enough to encourage a sale but high enough to garner nontrivial revenue. This approach is difficult to implement when the seller has little or no a priori information about bidder valuations or when the setting is sufficiently complex, such as matching markets with heterogeneous goods. In this paper, we apply a robust approach to designing auctions for revenue. Instead of...
