Pub Date : 2025-11-01Epub Date: 2025-09-09DOI: 10.1016/j.orl.2025.107367
Wenhao Du , Qizhi He , Tengteng Cao , Junjun Wu
We develop a supply chain model with endogenous interest rate to analyze the collaboration between digital business platforms and technology enterprises in emerging markets, focusing on how platform digital empowerment (PDE) and intellectual property protection (IPP) influence open innovation. We analyze static and dynamic equilibria under bank and platform financing strategies, explore the threshold effect of PDE and the nonlinear influence of IPP, and analyze profit variations among supply chain members under different channel power structures.
{"title":"Intellectual property protection and platform digitalization empowering technology entrepreneurship in emerging markets","authors":"Wenhao Du , Qizhi He , Tengteng Cao , Junjun Wu","doi":"10.1016/j.orl.2025.107367","DOIUrl":"10.1016/j.orl.2025.107367","url":null,"abstract":"<div><div>We develop a supply chain model with endogenous interest rate to analyze the collaboration between digital business platforms and technology enterprises in emerging markets, focusing on how platform digital empowerment (PDE) and intellectual property protection (IPP) influence open innovation. We analyze static and dynamic equilibria under bank and platform financing strategies, explore the threshold effect of PDE and the nonlinear influence of IPP, and analyze profit variations among supply chain members under different channel power structures.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"63 ","pages":"Article 107367"},"PeriodicalIF":0.9,"publicationDate":"2025-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145048430","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-11-01Epub Date: 2025-07-30DOI: 10.1016/j.orl.2025.107349
Jiayi Guo , Hao Qiu , Zhen Wang , Zizhuo Wang , Xinxin Zhang
We study the moment problem with nonnegative Chebyshev ambiguity set (MPNC), which is foundational to distributionally robust optimization (DRO) and has applications in inventory, pricing, and portfolio selection problems. While univariate MPNC is well-studied, bivariate/multivariate MPNC lacks analytical solutions. We characterize bivariate MPNC's optimal support for piecewise-linear objectives, propose an exact numerical method, and derive closed-form solutions for two instances. We apply our result to a DRO newsvendor problem and derive interesting managerial insights.
{"title":"Exact solving approach to moment problems with nonnegative Chebyshev ambiguity sets","authors":"Jiayi Guo , Hao Qiu , Zhen Wang , Zizhuo Wang , Xinxin Zhang","doi":"10.1016/j.orl.2025.107349","DOIUrl":"10.1016/j.orl.2025.107349","url":null,"abstract":"<div><div>We study the moment problem with nonnegative Chebyshev ambiguity set (MPNC), which is foundational to distributionally robust optimization (DRO) and has applications in inventory, pricing, and portfolio selection problems. While univariate MPNC is well-studied, bivariate/multivariate MPNC lacks analytical solutions. We characterize bivariate MPNC's optimal support for piecewise-linear objectives, propose an exact numerical method, and derive closed-form solutions for two instances. We apply our result to a DRO newsvendor problem and derive interesting managerial insights.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"63 ","pages":"Article 107349"},"PeriodicalIF":0.9,"publicationDate":"2025-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144749731","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-11-01Epub Date: 2025-08-27DOI: 10.1016/j.orl.2025.107359
Yasuhiko Nakamura
This study revisits the differentiated goods duopoly game over an infinite time horizon, where production requires exploiting renewable mobile resources. In this study, we assume that (i) the two firms exhibit additive Kantian behavior and (ii) they produce differentiated goods. We find that the degree of resource mobility does not influence the stable feedback equilibrium outcome from either a short- or long-term perspective if the firm's initial resource stocks are the same.
{"title":"Resource mobility and market performance: Kantian optimization","authors":"Yasuhiko Nakamura","doi":"10.1016/j.orl.2025.107359","DOIUrl":"10.1016/j.orl.2025.107359","url":null,"abstract":"<div><div>This study revisits the differentiated goods duopoly game over an infinite time horizon, where production requires exploiting renewable mobile resources. In this study, we assume that (i) the two firms exhibit additive Kantian behavior and (ii) they produce differentiated goods. We find that the degree of resource mobility does not influence the stable feedback equilibrium outcome from either a short- or long-term perspective if the firm's initial resource stocks are the same.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"63 ","pages":"Article 107359"},"PeriodicalIF":0.9,"publicationDate":"2025-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144907503","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-11-01Epub Date: 2025-08-27DOI: 10.1016/j.orl.2025.107358
Yunbing Li, Wensheng Jia, Shuwen Xiang
This paper investigates hybrid solutions in set payoff games with finite and infinite sets of players, respectively. For finite-player games, we introduce hybrid solutions, establish their existence in finite-dimensional Euclidean spaces using Scarf's theorem (Scarf, 1967 [29]) and the Kakutani fixed point theorem, and extend these results to Hausdorff topological vector spaces. For infinite-player games, we develop the concept of finite-coalition hybrid solutions and prove their existence. Our results generalize the existence of hybrid solutions in n-person games (Zhao, 1992 [12]).
{"title":"On the hybrid solutions of set payoff games","authors":"Yunbing Li, Wensheng Jia, Shuwen Xiang","doi":"10.1016/j.orl.2025.107358","DOIUrl":"10.1016/j.orl.2025.107358","url":null,"abstract":"<div><div>This paper investigates hybrid solutions in set payoff games with finite and infinite sets of players, respectively. For finite-player games, we introduce hybrid solutions, establish their existence in finite-dimensional Euclidean spaces using Scarf's theorem (Scarf, 1967 <span><span>[29]</span></span>) and the Kakutani fixed point theorem, and extend these results to Hausdorff topological vector spaces. For infinite-player games, we develop the concept of finite-coalition hybrid solutions and prove their existence. Our results generalize the existence of hybrid solutions in n-person games (Zhao, 1992 <span><span>[12]</span></span>).</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"63 ","pages":"Article 107358"},"PeriodicalIF":0.9,"publicationDate":"2025-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144913196","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-11-01Epub Date: 2025-09-11DOI: 10.1016/j.orl.2025.107365
Vincent Leclère , Andy Philpott
We present a model of a commodity auction in which sellers and buyers (agents) represent risk using coherent risk measures. These are communicated to the auctioneer who computes socially optimal transactions assuming complete risk trading. The model is applied to economic dispatch and system marginal prices in a single-settlement wholesale electricity pool under uncertainty. If agents' risk measures are known by the system operator then prices form a socially optimal dispatch which is revenue adequate and recovers agents' costs in risk-adjusted expectation. We construct a non-cooperative game to show that agents have incentives to misrepresent their risk measures to improve their risk-adjusted profit.
{"title":"Strategic behavior of risk-averse agents under stochastic market clearing","authors":"Vincent Leclère , Andy Philpott","doi":"10.1016/j.orl.2025.107365","DOIUrl":"10.1016/j.orl.2025.107365","url":null,"abstract":"<div><div>We present a model of a commodity auction in which sellers and buyers (agents) represent risk using coherent risk measures. These are communicated to the auctioneer who computes socially optimal transactions assuming complete risk trading. The model is applied to economic dispatch and system marginal prices in a single-settlement wholesale electricity pool under uncertainty. If agents' risk measures are known by the system operator then prices form a socially optimal dispatch which is revenue adequate and recovers agents' costs in risk-adjusted expectation. We construct a non-cooperative game to show that agents have incentives to misrepresent their risk measures to improve their risk-adjusted profit.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"63 ","pages":"Article 107365"},"PeriodicalIF":0.9,"publicationDate":"2025-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145104306","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-11-01Epub Date: 2025-08-19DOI: 10.1016/j.orl.2025.107354
Yuval Cornfeld , Ehud Lehrer , Eilon Solan
We study dynamic decision-making scenarios where the decision maker has several consultants at her disposal, and at every period, chooses between taking an action or getting information on the underlying state through one of the consultants. We explore the optimal strategy, and find that if one of the consultants discloses the state with a positive probability, this consultant will be used in all optimal strategies, provided the consultation cost is sufficiently small.
{"title":"Choosing a consultant in a dynamic investment problem","authors":"Yuval Cornfeld , Ehud Lehrer , Eilon Solan","doi":"10.1016/j.orl.2025.107354","DOIUrl":"10.1016/j.orl.2025.107354","url":null,"abstract":"<div><div>We study dynamic decision-making scenarios where the decision maker has several consultants at her disposal, and at every period, chooses between taking an action or getting information on the underlying state through one of the consultants. We explore the optimal strategy, and find that if one of the consultants discloses the state with a positive probability, this consultant will be used in all optimal strategies, provided the consultation cost is sufficiently small.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"63 ","pages":"Article 107354"},"PeriodicalIF":0.9,"publicationDate":"2025-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144867055","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-11-01Epub Date: 2025-08-06DOI: 10.1016/j.orl.2025.107353
Zhichao Geng, Yuan Gao
This paper addresses the robust single-machine makespan scheduling problems, in which the processing times of jobs and a set of discrete scenarios are given, and the release dates of jobs are scenario-dependent. For three common criteria (absolute robustness, maximum regret and relative maximum regret) relevant to robust optimization approaches, we show that the corresponding problems are all polynomially solvable.
{"title":"Single-machine makespan scheduling with scenario-dependent release dates","authors":"Zhichao Geng, Yuan Gao","doi":"10.1016/j.orl.2025.107353","DOIUrl":"10.1016/j.orl.2025.107353","url":null,"abstract":"<div><div>This paper addresses the robust single-machine makespan scheduling problems, in which the processing times of jobs and a set of discrete scenarios are given, and the release dates of jobs are scenario-dependent. For three common criteria (absolute robustness, maximum regret and relative maximum regret) relevant to robust optimization approaches, we show that the corresponding problems are all polynomially solvable.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"63 ","pages":"Article 107353"},"PeriodicalIF":0.9,"publicationDate":"2025-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144829644","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-11-01Epub Date: 2025-07-29DOI: 10.1016/j.orl.2025.107350
Ilan Adler , Richard M. Karp , Sheldon M. Ross
Let be events in a sample space. Given the probability of the intersection of each collection of up to of these events, what can we say about the probability that at least r of the events occur? This question dates back to Boole in the 19th century, and it is well known that the odd partial sums of the Inclusion-Exclusion formula provide upper bounds, while the even partial sums provide lower bounds. We give a combinatorial characterization of the error in these bounds and use it to derive a very simple proof of the strongest possible bounds of a certain form, as well as a couple of improved bounds. The new bounds use more information than the classical Bonferroni-type inequalities, and are often sharper.
{"title":"Improved bounds on the probability of a union and on the number of events that occur","authors":"Ilan Adler , Richard M. Karp , Sheldon M. Ross","doi":"10.1016/j.orl.2025.107350","DOIUrl":"10.1016/j.orl.2025.107350","url":null,"abstract":"<div><div>Let <span><math><msub><mrow><mi>A</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><msub><mrow><mi>A</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>,</mo><mo>…</mo><mo>,</mo><msub><mrow><mi>A</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span> be events in a sample space. Given the probability of the intersection of each collection of up to <span><math><mi>k</mi><mo>+</mo><mn>1</mn></math></span> of these events, what can we say about the probability that at least <em>r</em> of the events occur? This question dates back to Boole in the 19th century, and it is well known that the odd partial sums of the Inclusion-Exclusion formula provide upper bounds, while the even partial sums provide lower bounds. We give a combinatorial characterization of the error in these bounds and use it to derive a very simple proof of the strongest possible bounds of a certain form, as well as a couple of improved bounds. The new bounds use more information than the classical Bonferroni-type inequalities, and are often sharper.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"63 ","pages":"Article 107350"},"PeriodicalIF":0.9,"publicationDate":"2025-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144749730","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-11-01Epub Date: 2025-07-30DOI: 10.1016/j.orl.2025.107351
Maria Kyropoulou, Alexandros A. Voudouris
We consider a resource allocation problem with agents that have additive ternary valuations for a set of indivisible items, and bound the price of envy-free up to one item (EF1) allocations. For a large number n of agents, we show a lower bound of , implying that the price of EF1 is no better than when the agents have general subadditive valuations. We then focus on instances with few agents and show that the price of EF1 is 12/11 for , and between 1.2 and 1.256 for .
{"title":"The price of EF1 for few agents with additive ternary valuations","authors":"Maria Kyropoulou, Alexandros A. Voudouris","doi":"10.1016/j.orl.2025.107351","DOIUrl":"10.1016/j.orl.2025.107351","url":null,"abstract":"<div><div>We consider a resource allocation problem with agents that have additive ternary valuations for a set of indivisible items, and bound the price of envy-free up to one item (EF1) allocations. For a large number <em>n</em> of agents, we show a lower bound of <span><math><mi>Ω</mi><mo>(</mo><msqrt><mrow><mi>n</mi></mrow></msqrt><mo>)</mo></math></span>, implying that the price of EF1 is no better than when the agents have general subadditive valuations. We then focus on instances with few agents and show that the price of EF1 is 12/11 for <span><math><mi>n</mi><mo>=</mo><mn>2</mn></math></span>, and between 1.2 and 1.256 for <span><math><mi>n</mi><mo>=</mo><mn>3</mn></math></span>.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"63 ","pages":"Article 107351"},"PeriodicalIF":0.9,"publicationDate":"2025-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144725040","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-11-01Epub Date: 2025-08-18DOI: 10.1016/j.orl.2025.107356
Dan Garber
Oja's algorithm is a well known online algorithm studied mainly in the context of stochastic principal component analysis. We make a simple observation, yet to the best of our knowledge a novel one: when applied to any (not necessarily stochastic) sequence of real symmetric matrices which share common eigenvectors, the regret of Oja's algorithm could be directly analyzed using the celebrated multiplicative weights update method for the problem of prediction with expert advice. This leads to several applications: I. Novel analysis of a projected gradient ascent method for the symmetric eigenvalue problem, which differs from classical power method-style analyzes. II. Extension of the latter to a more general class of problems which consider minimizing a convex nonsmooth objective composed with a quadratic mapping over the unit sphere, under a common eigenvectors assumption. III. New insights to the open problem of online learning of eigenvectors using only linear runtime and memory.
{"title":"Eigenvalue problems via the multiplicative weights update method","authors":"Dan Garber","doi":"10.1016/j.orl.2025.107356","DOIUrl":"10.1016/j.orl.2025.107356","url":null,"abstract":"<div><div>Oja's algorithm is a well known online algorithm studied mainly in the context of stochastic principal component analysis. We make a simple observation, yet to the best of our knowledge a novel one: when applied to any (not necessarily stochastic) sequence of real symmetric matrices which share common eigenvectors, the regret of Oja's algorithm could be directly analyzed using the celebrated multiplicative weights update method for the problem of prediction with expert advice. This leads to several applications: I. Novel analysis of a projected gradient ascent method for the symmetric eigenvalue problem, which differs from classical power method-style analyzes. II. Extension of the latter to a more general class of problems which consider minimizing a convex nonsmooth objective composed with a quadratic mapping over the unit sphere, under a common eigenvectors assumption. III. New insights to the open problem of online learning of eigenvectors using only linear runtime and memory.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"63 ","pages":"Article 107356"},"PeriodicalIF":0.9,"publicationDate":"2025-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144896687","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
扫码关注我们
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号