-
作者：Allon, Gad; Drakopoulos, Kimon; Manshadi, Vahideh
作者单位：University of Pennsylvania; University of Southern California; Yale University
摘要：In this paper, we study a model of information consumption in which consumers sequentially interact with a platform that offers a menu of signals (posts) about an underlying state of the world (fact). At each time, incapable of consuming all posts, consumers screen the posts and only select (and consume) one from the offered menu. We show that, in the presence of uncertainty about the accuracy of these posts and as the number of posts increases, adverse effects, such as slow learning and polar...
-
作者：Baggio, Andrea; Carvalho, Margarida; Lodi, Andrea; Tramontani, Andrea
作者单位：Universite de Montreal; Universite de Montreal; Universite de Montreal; Polytechnique Montreal
摘要：In recent years, a lot of effort has been dedicated to develop strategies to defend networks against possible cascade failures or malicious viral attacks. On the one hand, network safety is investigated from a preventive perspective. On the other hand, blocking models have been proposed for scenarios in which the attack has already taken place causing a harmful spreading throughout the network. In this work, we combine these two perspectives. More precisely, following the framework defender-at...
-
作者：Chen, Yiwei; Trichakis, Nikolaos
作者单位：Pennsylvania Commonwealth System of Higher Education (PCSHE); Temple University; Massachusetts Institute of Technology (MIT); Massachusetts Institute of Technology (MIT)
摘要：Consider a network revenue management model in which a seller offers multiple products, which consume capacitated resources. The seller uses an anonymous posted-price policy, and arriving customers strategize on (a) when and (b) which product to purchase to maximize their utility, based on heterogeneous product valuations. Such models, whereby customers are both forward looking and choose what to buy, have not yet been amenable to analysis, mainly because their associated dynamic mechanism des...
-
作者：Kovacova, Gabriela; Rudloff, Birgit
作者单位：Vienna University of Economics & Business
摘要：Choosing a portfolio of risky assets over time that maximizes the expected return at the same time as it minimizes portfolio risk is a classical problem in mathematical finance and is referred to as the dynamicMarkowitz problem (when the risk is measured by variance) or, more generally, the dynamic mean-risk problem. In most of the literature, the mean-risk problem is scalarized, and it is well known that this scalarized problem does not satisfy the (scalar) Bellman's principle. Thus, the clas...
-
作者：Chen, Ningyuan; Gallego, Guillermo
作者单位：University of Toronto; Hong Kong University of Science & Technology
摘要：Personalized pricing analytics is becoming an essential tool in retailing. Upon observing the personalized information of each arriving customer, the firm needs to set a price accordingly based on the covariates, such as income, education background, and past purchasing history, to extract more revenue. For new entrants of the business, the lack of historical data may severely limit the power and profitability of personalized pricing. We propose a nonparametric pricing policy to simultaneously...
-
作者：Dyson, Robert G.; O'Brien, Frances A.; Shah, Devan B.
作者单位：University of Warwick
摘要：This paper explores the work of some 43 founders of operations research. In particular, it considers the links between soft operations research (OR) and these founders. Several of the founders were direct influencers of the soft OR proponents, whereas others related to the context, process, and content of soft OR. Coupled with the deductive and inductive reasoning approaches of soft OR, it is argued that soft OR is a legitimate branch of OR. The paper also focuses on the embeddedness of the fo...
-
作者：Russ, Matthias; Gust, Gunther; Neumann, Dirk
作者单位：University of Freiburg
摘要：The constrained reliable shortest path problem in stochastic time-dependent networks (CRSP-STD) extends the reliable, the time-dependent, and the constrained shortest path problem. In the CRSP-STD, shortest paths need to ensure on-time arrival with a given probability and additionally satisfy constraints on time-dependent weights. Examples of such time-dependent weights in transport networks include time-varying congestion charges or dynamic fees for shared vehicles. If weights decrease over t...
-
作者：Tian, Feng; Sun, Peng; Duenyas, Izak
作者单位：University of Michigan System; University of Michigan; Duke University
摘要：A principal hires an agent to repair a machine when it is down and maintain it when it is up and earns a revenue flow when the machine is up. Both the up- and downtimes follow exponential distributions. If the agent exerts effort, the downtime is shortened, and uptime is prolonged. Effort, however, is costly to the agent and unobservable to the principal. We study optimal dynamic contracts that always induce the agent to exert effort while maximizing the principal's profits. We formulate the c...
-
作者：Zenios, Stavros A.; Consiglio, Andrea; Athanasopoulou, Marialena; Moshammer, Edmund; Gavilan, Angel; Erce, Aitor
作者单位：University of Cyprus; University of Pennsylvania; University of Palermo; Banco de Espana; Universidad Publica de Navarra
摘要：We model sovereign debt sustainability with optimal financing decisions under macroeconomic, financial, and fiscal uncertainty, with endogenous risk and term premia. Using a coherent risk measure we trade off debt stock and flow risks subject to sustainability constraints. We optimize static and dynamic financing strategies and demonstrate economically significant savings from optimal financing compared with simple rules and consols, and find that optimizing the trade-offs can be critical for ...
-
作者：Araman, Victor F.; Fayad, Bassam
作者单位：American University of Beirut; Sorbonne Universite; Universite Paris Cite
摘要：A firm that sells a nonperishable product considers intertemporal price discrimination in the objective of maximizing its long-run average revenue. We consider a general model of patient customers with changing valuations. Arriving customers wait for a random but bounded length of time and purchase the product when its price falls below their valuation, which varies following a stochastic process. We show the optimality of a class of cyclic strategies and obtain an algorithm that yields them. ...
