-
作者：Kelly, Frank; Key, Peter; Walton, Neil
作者单位：University of Cambridge; Microsoft; Microsoft United Kingdom; University of Manchester
摘要：We develop a framework for the analysis of large-scale ad auctions where adverts are assigned over a continuum of search types. For this pay-per-click market, we provide an efficient mechanism that maximizes social welfare. In particular, we show that the social welfare optimization can be solved in separate optimizations conducted on the time scales relevant to the search platform and advertisers. Here, on each search occurrence, the platform solves an assignment problem and, on a slower time...
-
作者：Correa, Jose; Montoya, Ricardo; Thraves, Charles
作者单位：Universidad de Chile; Massachusetts Institute of Technology (MIT)
摘要：Companies in diverse industries must decide the pricing policy of their inventories over time. This decision becomes particularly complex when customers are forward looking and may defer a purchase in the hope of future discounts and promotions. With such uncertainty, many customers may end up not buying or buying at a significantly lower price, reducing the firm's profitability. Recent studies show that a way to mitigate this negative effect caused by strategic consumers is to use a posted or...
-
作者：Saghafian, Soroush; Tomlin, Brian
作者单位：Harvard University; Dartmouth College
摘要：Operations managers do not typically have full information about the demand distribution. Recognizing this, data-driven approaches have been proposed in which the manager has no information beyond the evolving history of demand observations. In practice, managers often have some partial information about the demand distribution in addition to demand observations. We consider a repeated newsvendor setting, and propose a maximum-entropy based technique, termed Second Order Belief Maximum Entropy...
-
作者：Haugh, Martin; Iyengar, Garud; Wang, Chun
作者单位：Columbia University
摘要：We consider dynamic asset allocation problems where the agent is required to pay capital gains taxes on her investment gains. These are very challenging problems because the tax owed whenever a security is sold depends on the cost basis, and this results in high-dimensional problems, which cannot be solved exactly except in the case of very stylized problems with just one or two securities and relatively few time periods. In this paper, we focus on exact and average cost-basis problems, make t...
-
作者：Kim, Michael Jong
作者单位：University of Toronto
摘要：This paper is concerned with optimal maintenance decision making in the presence of model misspecification. Specifically, we are interested in the situation where the decision maker fears that a nominal Bayesian model may be miss-specified or unrealistic, and would like to find policies that work well even when the underlying model is flawed. To this end, we formulate a robust dynamic optimization model for condition-based maintenance in which the decision maker explicitly accounts for distrus...
-
作者：Anderson, Edward; Gamarnik, David; Kleywegt, Anton; Ozdaglar, Asuman
作者单位：University of Sydney; Massachusetts Institute of Technology (MIT); Massachusetts Institute of Technology (MIT); University System of Georgia; Georgia Institute of Technology; Massachusetts Institute of Technology (MIT)
-
作者：Cummings, Rachel; Echenique, Federico; Wierman, Adam
作者单位：California Institute of Technology; California Institute of Technology
摘要：This paper initiates the study of the testable implications of choice data in settings where agents have privacy preferences. We adapt the standard conceptualization of consumer choice theory to a situation where the consumer is aware of, and has preferences over, the information revealed by her choices. The main message of the paper is that little can be inferred about consumers' preferences once we introduce the possibility that the consumer has concerns about privacy. This holds even when c...
-
作者：Kunnumkal, Sumit; Talluri, Kalyan
作者单位：Indian School of Business (ISB); Imperial College London
摘要：In recent years, several approximation methods have been proposed for the choice network revenue management problem. These approximation methods are proposed because the dynamic programming formulation of the choice network revenue management problem is intractable even for moderately sized instances. In this paper, we consider three approximation methods that obtain upper bounds on the value function, namely, the choice deterministic linear program (CDLP), the affine approximation (AF), and t...
-
作者：Kocuk, Burak; Dey, Santanu S.; Sun, X. Andy
作者单位：University System of Georgia; Georgia Institute of Technology
摘要：This paper proposes three strong second order cone programming (SOCP) relaxations for the AC optimal power flow (OPF) problem. These three relaxations are incomparable to each other and two of them are incomparable to the standard SDP relaxation of OPF. Extensive computational experiments show that these relaxations have numerous advantages over existing convex relaxations in the literature: (i) their solution quality is extremely close to that of the standard SDP relaxation (the best one is w...
-
作者：Papadaki, Katerina; Alpern, Steve; Lidbetter, Thomas; Morton, Alec
作者单位：University of London; London School Economics & Political Science; University of Warwick; Rutgers University System; Rutgers University New Brunswick; Rutgers University Newark; University of Strathclyde
摘要：Patrolling games were recently introduced to model the problem of protecting the nodes of a network from an attack. Time is discrete and in each time unit the Patroller can stay at the same node or move to an adjacent node. The Attacker chooses when to attack and which node to attack and needs m consecutive time units to carry it out. The Attacker wins if the Patroller does not visit the chosen node while it is being attacked; otherwise, the Patroller wins. This paper studies the patrolling ga...
