发布求助
文献互助 智能选刊 最新文献

Oper. Res.最新文献

筛选
英文 中文
Pooling Agents for Customer-Intensive Services 集中代理客户密集型服务
Oper. Res. Pub Date : 2022-03-09 DOI: 10.1287/opre.2022.2259
Zhongbin Wang, Luyi Yang, Shiliang Cui, Sezer Ülkü, Yong-Pin Zhou
{"title":"Pooling Agents for Customer-Intensive Services","authors":"Zhongbin Wang, Luyi Yang, Shiliang Cui, Sezer Ülkü, Yong-Pin Zhou","doi":"10.1287/opre.2022.2259","DOIUrl":"https://doi.org/10.1287/opre.2022.2259","url":null,"abstract":"To Pool or Not to Pool? Analyzing Customer-Intensive Services with Strategic Agents In customer-intensive services where service quality increases with service time, service providers commonly pool their agents and give performance bonuses that reward agents for achieving greater customer satisfaction and serving more customers. Conventional wisdom suggests that pooling agents reduce customer wait time whereas performance bonuses motivate agents to produce high-quality services, both of which should boost customer satisfaction. However, in “Pooling Agents for Customer-Intensive Services,” Wang, Yang, Cui, Ülkü, and Zhou find that when agents act strategically, they may choose to speed up under pooling in an attempt to serve more customers, thus undermining service quality. If this happens, pooling can backfire and result in both lower customer satisfaction and agent payoff. Consequently, the researchers propose a simple practical solution to restore the efficiency of pooling. They propose pooling a portion of the performance bonuses (incentive pooling) in conjunction with pooling agents (operational pooling).","PeriodicalId":19546,"journal":{"name":"Oper. Res.","volume":"34 1","pages":"860-875"},"PeriodicalIF":0.0,"publicationDate":"2022-03-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82762299","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Order Now, Pickup in 30 Minutes: Managing Queues with Static Delivery Guarantees 现在订购，30分钟内取货:用静态交付保证管理队列
Oper. Res. Pub Date : 2022-03-02 DOI: 10.2139/ssrn.3557605
M. H. Farahani, Milind Dawande, G. Janakiraman
{"title":"Order Now, Pickup in 30 Minutes: Managing Queues with Static Delivery Guarantees","authors":"M. H. Farahani, Milind Dawande, G. Janakiraman","doi":"10.2139/ssrn.3557605","DOIUrl":"https://doi.org/10.2139/ssrn.3557605","url":null,"abstract":"The shift in the restaurant industry toward digital ordering argues for major changes in how orders are managed. The main difficulty in managing queues in online food-ordering services arises from the fact that, as opposed to dine-in customers, online customers are promised a pick-up time; customers are dissatisfied if the order is not completed by that time and are also dissatisfied if the order is completed much ahead of time because the food loses freshness. In “Order Now, Pickup in 30 Minutes: Managing Queues with Static Delivery Guarantees,” Farahani, Dawande, and Janakiraman propose and analyze strategies for managing queues in online food-ordering services with the goal of keeping customer satisfaction as high as possible.","PeriodicalId":19546,"journal":{"name":"Oper. Res.","volume":"75 1","pages":"2013-2031"},"PeriodicalIF":0.0,"publicationDate":"2022-03-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83143069","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
Nonasymptotic Analysis of Monte Carlo Tree Search 蒙特卡罗树搜索的非渐近分析
Oper. Res. Pub Date : 2022-03-01 DOI: 10.1287/opre.2021.2239
D. Shah, Qiaomin Xie, Zhi Xu
{"title":"Nonasymptotic Analysis of Monte Carlo Tree Search","authors":"D. Shah, Qiaomin Xie, Zhi Xu","doi":"10.1287/opre.2021.2239","DOIUrl":"https://doi.org/10.1287/opre.2021.2239","url":null,"abstract":"In “Nonasymptotic Analysis of Monte Carlo Tree Search,” D. Shah, Q. Xie, and Z. Xu consider the popular tree-based search strategy, the Monte Carlo Tree Search (MCTS), in the context of the infinite-horizon discounted Markov decision process. They show that MCTS with an appropriate polynomial rather than logarithmic bonus term indeed leads to the desired convergence property. The authors derive the results by establishing a polynomial concentration property of regret for a class of nonstationary multiarm bandits. Furthermore, using this as a building block, they demonstrate that MCTS, combined with nearest neighbor supervised learning, acts as a “policy improvement” operator that can iteratively improve value function approximation.","PeriodicalId":19546,"journal":{"name":"Oper. Res.","volume":"23 1","pages":"3234-3260"},"PeriodicalIF":0.0,"publicationDate":"2022-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77594692","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Conveying Demand Information in Serial Supply Chains with Capacity Limits 产能限制下串行供应链的需求信息传递
Oper. Res. Pub Date : 2022-02-23 DOI: 10.2139/ssrn.3984277
R. Kapuscinski, Rodney P. Parker
{"title":"Conveying Demand Information in Serial Supply Chains with Capacity Limits","authors":"R. Kapuscinski, Rodney P. Parker","doi":"10.2139/ssrn.3984277","DOIUrl":"https://doi.org/10.2139/ssrn.3984277","url":null,"abstract":"Supply chains are distributed across multiple locations, and to effectively manage inventory in these channels requires knowledge of inventory levels at many sites. Such information is changing dynamically, so it is unrealistic to expect such information to be readily available, especially in channels with production capacity limits. In “Conveying Demand Information in Serial Supply Chains with Capacity Limits,” Kapuscinski and Parker show that local information alone is sufficient to effectively manage inventory in capacity-limited supply chains. In supply chains with capacity limits, the retailer does not faithfully pass the demand information to her supplier but sends censored information in her order. Despite censoring, these orders contain sufficient information for the modified echelon base-stock policy, a full-information policy, to be mimicked. They provide evidence using numerical experiments and analytical bounds that the modified echelon base-stock policy performs superbly. Also, they describe information requirements used in supply chain literature and demonstrate that with an incentive-compatible mechanism, similar to Lee and Whang (2000), local managers will follow the centralized inventory policy.","PeriodicalId":19546,"journal":{"name":"Oper. Res.","volume":"05 1","pages":"1485-1505"},"PeriodicalIF":0.0,"publicationDate":"2022-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88178025","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Misinformation and Disinformation in Modern Warfare 现代战争中的错误信息和虚假信息
Oper. Res. Pub Date : 2022-02-18 DOI: 10.1287/opre.2021.2253
Yanling Chang, Matthew F. Keblis, Ran Li, E. Iakovou, Chelsea C. White
{"title":"Misinformation and Disinformation in Modern Warfare","authors":"Yanling Chang, Matthew F. Keblis, Ran Li, E. Iakovou, Chelsea C. White","doi":"10.1287/opre.2021.2253","DOIUrl":"https://doi.org/10.1287/opre.2021.2253","url":null,"abstract":"Assessing Distorted Information in Modern Warfare Distorted information (misinformation and disinformation) has long been a part of warfare (see the writings of Sun-Tzu). However, the study of the ever-increasing use of distorted information in modern warfare has been rather limited. In “Misinformation and Disinformation in Modern Warfare,” Chang, Keblis, Li, Iakovou, and White model instances of today’s battlespace as a partially observable game with three agents, a leader and two followers, and examine the benefit to the leader (e.g., a military command) of modulating the communication of information between (i) followers who are adversaries and (ii) followers who are allies. Counter to intuition, the study shows that only under certain conditions is it optimal for the leader to degrade (enhance) the quality of the information communicated between adversarial (allied) followers. The developed methodology is applied to warfare instances encountered in the Battle of Mosul.","PeriodicalId":19546,"journal":{"name":"Oper. Res.","volume":"54 1","pages":"1577-1597"},"PeriodicalIF":0.0,"publicationDate":"2022-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84991049","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Modeling the Risk in Mortality Projections 死亡率预测中的风险建模
Oper. Res. Pub Date : 2022-02-15 DOI: 10.1287/opre.2021.2255
Nan Zhu, Daniel Bauer
{"title":"Modeling the Risk in Mortality Projections","authors":"Nan Zhu, Daniel Bauer","doi":"10.1287/opre.2021.2255","DOIUrl":"https://doi.org/10.1287/opre.2021.2255","url":null,"abstract":"Capturing the Uncertainty in Long-Term Mortality Forecasts The uncertainty in future longevity presents a substantial risk factor for insurance companies, pension funds, and retirement systems. In “Modeling the Risk in Mortality Projections,” Zhu and Bauer present novel stochastic models for analyzing this longevity risk that focus on the uncertainty associated with long-term mortality projections and capture the evolution of mortality forecasts over the past decades. They arrive at their models by analyzing time series of mortality forecasts in a forward modeling framework, which contrasts with conventional stochastic mortality models that are built on age-specific realized mortality rates. The authors showcase their models in exemplifying financial applications in both traditional life insurance markets and the emerging longevity risk transfer market. A key takeaway is that uncertainty in positions that depend on the long-term evolution of mortality is substantially greater under their models than suggested by conventional models.","PeriodicalId":19546,"journal":{"name":"Oper. Res.","volume":"49 1","pages":"2069-2084"},"PeriodicalIF":0.0,"publicationDate":"2022-02-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82252017","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Risk-Based Robust Statistical Learning by Stochastic Difference-of-Convex Value-Function Optimization 基于风险的随机凸差值-函数优化鲁棒统计学习
Oper. Res. Pub Date : 2022-02-09 DOI: 10.1287/opre.2021.2248
Junyi Liu, J. Pang
{"title":"Risk-Based Robust Statistical Learning by Stochastic Difference-of-Convex Value-Function Optimization","authors":"Junyi Liu, J. Pang","doi":"10.1287/opre.2021.2248","DOIUrl":"https://doi.org/10.1287/opre.2021.2248","url":null,"abstract":"For the treatment of outliers, the paper “Risk-Based Robust Statistical Learning by Stochastic Difference-of-Convex Value-Function Optimization” by Junyi Liu and Jong-Shi Pang proposes a risk-based robust statistical learning model. Employing a variant of the conditional value-at-risk risk measure, called the interval conditional value-at-risk (In-CVaR), the model aims to exclude the risks associated with the left and right tails of the loss. The resulting nonsmooth and nonconvex model considers the population In-CVaR risk and distinguishes the upside and downside losses with asymmetric weights. For the solution of the model in both regression and classification, the authors show that the objective function is the difference of two convex functions each being the optimal objective value of a univariate convex stochastic program. A sampling and convex programming-based algorithm is developed with the appropriate control of incremental sample sizes, and its subsequential almost-sure convergence to a critical point is established. Numerical results illustrate the practical performance of the model and methodology.","PeriodicalId":19546,"journal":{"name":"Oper. Res.","volume":"7 1","pages":"397-414"},"PeriodicalIF":0.0,"publicationDate":"2022-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80207221","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Dynamic Learning and Decision Making via Basis Weight Vectors 基于基权向量的动态学习与决策
Oper. Res. Pub Date : 2022-02-09 DOI: 10.1287/opre.2021.2240
Hao Zhang
{"title":"Dynamic Learning and Decision Making via Basis Weight Vectors","authors":"Hao Zhang","doi":"10.1287/opre.2021.2240","DOIUrl":"https://doi.org/10.1287/opre.2021.2240","url":null,"abstract":"A New Method for Dynamic Learning and Doing For a large class of learning-and-doing problems, two processes are intertwined in the analysis: a forward process that updates the decision maker’s belief or estimate of the unknown parameter, and a backward process that computes the expected future values. The mainstream literature focuses on the former process. In contrast, in “Dynamic Learning and Decision Making via Basis Weight Vectors,” Hao Zhang proposes a new method based on pure backward induction on the continuation values created by feasible continuation policies. When the unknown parameter is a continuous variable, the method represents each continuation-value function by a vector of weights placed on a set of basis functions. The weight vectors that are potentially useful for the optimal solution can be found backward in time exactly (for very small problems) or approximately (for larger problems). A simulation study demonstrates that an approximation algorithm based on this method outperforms some popular algorithms in the linear contextual bandit literature when the learning horizon is short.","PeriodicalId":19546,"journal":{"name":"Oper. Res.","volume":"119 1","pages":"1835-1853"},"PeriodicalIF":0.0,"publicationDate":"2022-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77464156","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
A Risk Extended Version of Merton's Optimal Consumption and Portfolio Selection 默顿最优消费与投资组合选择的风险扩展版本
Oper. Res. Pub Date : 2022-02-09 DOI: 10.1287/opre.2021.2197
A. Bensoussan, S. Hoe, Joohyun Kim, Zhongfeng Yan
{"title":"A Risk Extended Version of Merton's Optimal Consumption and Portfolio Selection","authors":"A. Bensoussan, S. Hoe, Joohyun Kim, Zhongfeng Yan","doi":"10.1287/opre.2021.2197","DOIUrl":"https://doi.org/10.1287/opre.2021.2197","url":null,"abstract":"A risk management version of the classical investment-consumption problem known as Merton's problem in the finance literature is proposed. Risk is measured by variance, which introduces a nonlinear function of the expected value into the control problem. Standard stochastic theory cannot properly handle this type of nonlinear stochastic optimization problem. Therefore, we study this time-inconsistent problem within the mean field-type control framework. We derive the sufficient condition of optimality and solve the problem completely. Numerical results illustrating the effect of risk on optimal policies are also presented. Applications can be numerous, including all kinds of investment decisions or operations decisions.","PeriodicalId":19546,"journal":{"name":"Oper. Res.","volume":"32 1","pages":"815-829"},"PeriodicalIF":0.0,"publicationDate":"2022-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72700419","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Technical Note - On Matrix Exponential Differentiation with Application to Weighted Sum Distributions 技术笔记-矩阵指数微分及其在加权和分布中的应用
Oper. Res. Pub Date : 2022-02-08 DOI: 10.1287/opre.2021.2257
Milan Kumar Das, Henghsiu Tsai, I. Kyriakou, Gianluca Fusai
{"title":"Technical Note - On Matrix Exponential Differentiation with Application to Weighted Sum Distributions","authors":"Milan Kumar Das, Henghsiu Tsai, I. Kyriakou, Gianluca Fusai","doi":"10.1287/opre.2021.2257","DOIUrl":"https://doi.org/10.1287/opre.2021.2257","url":null,"abstract":"On Modeling the Probability Distribution of Stochastic Sums In the “Technical Note—On Matrix Exponential Differentiation with Application to Weighted Sum Distributions,” Das, Tsai, Kyriakou, and Fusai propose an efficient methodology for approximating the unknown probability distribution of a weighted stochastic sum or time integral. Resulting from earlier contributions based on continuous-time Markov chain approximations of one-dimensional Markov processes is the Laplace transform of the unknown distribution available in exponential matrix form. In this paper, the authors develop a bona fide Pearson curve-fitting approach to this distribution based on the moments, which they recover from the derivatives of the Laplace transform. Motivated by the computational hurdles toward this, they derive computationally efficient closed-form expressions for the derivatives of the matrix exponential. They then apply to pricing average-based options.","PeriodicalId":19546,"journal":{"name":"Oper. Res.","volume":"121 1","pages":"1984-1995"},"PeriodicalIF":0.0,"publicationDate":"2022-02-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77394035","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信