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

Operations Research Letters最新文献

筛选
英文 中文
Individual versus social optimization in statistical estimation 统计估计中的个人与社会优化
IF 0.8 4区 管理学
Operations Research Letters Pub Date : 2025-04-11 DOI: 10.1016/j.orl.2025.107284
Moshe Haviv
{"title":"Individual versus social optimization in statistical estimation","authors":"Moshe Haviv","doi":"10.1016/j.orl.2025.107284","DOIUrl":"10.1016/j.orl.2025.107284","url":null,"abstract":"<div><div>A number of estimators participate in a non-cooperative game where the data they collect are reported to a central planner who takes decisions. She in her turn decides on the estimates to be imposed on the participants. Because they are aware of this, they may behave strategically and misreport. We exemplify this decision making process where the James-Stein's estimator is used by the central planner. In particular, we consider the resulting optimization or Nash equilibria reporting strategies in a number of variations of this game.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"61 ","pages":"Article 107284"},"PeriodicalIF":0.8,"publicationDate":"2025-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143842793","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}
引用次数: 0
Piecewise affine decision rules for contextual chance-constrained stochastic programming 上下文机会约束随机规划的分段仿射决策规则
IF 0.8 4区 管理学
Operations Research Letters Pub Date : 2025-04-09 DOI: 10.1016/j.orl.2025.107296
Junhao Qin , Ziyi Zou , Liu Liu , Yongchao Liu
{"title":"Piecewise affine decision rules for contextual chance-constrained stochastic programming","authors":"Junhao Qin ,&nbsp;Ziyi Zou ,&nbsp;Liu Liu ,&nbsp;Yongchao Liu","doi":"10.1016/j.orl.2025.107296","DOIUrl":"10.1016/j.orl.2025.107296","url":null,"abstract":"<div><div>This paper proposes a contextual chance-constrained programming model (CCCP), where a measurable function from the feature space to the decision space is to be optimized under the chance constraint. We present a tractable approximation of CCCP by the piecewise affine decision rule (PADR) method. We quantify the approximation results from two aspects: the gap of optimal values and the feasibility of the approximate solutions. Finally, numerical tests are conducted to verify the effectiveness of the proposed methods.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"61 ","pages":"Article 107296"},"PeriodicalIF":0.8,"publicationDate":"2025-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143816649","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}
引用次数: 0
Prophet upper bounds for online matching and auctions 在线匹配和拍卖的先知上限
IF 0.8 4区 管理学
Operations Research Letters Pub Date : 2025-04-07 DOI: 10.1016/j.orl.2025.107294
José A. Soto , Victor Verdugo
{"title":"Prophet upper bounds for online matching and auctions","authors":"José A. Soto ,&nbsp;Victor Verdugo","doi":"10.1016/j.orl.2025.107294","DOIUrl":"10.1016/j.orl.2025.107294","url":null,"abstract":"<div><div>In the online 2-bounded auction problem, we have a collection of items represented as nodes in a graph and bundles of size two represented by edges. Agents are presented sequentially, each with a random weight function over the bundles. The goal of the decision-maker is to find an allocation of bundles to agents of maximum weight so that every item is assigned at most once, i.e., the solution is a matching in the graph. When the agents are single-minded (i.e., put all the weight in a single bundle), we recover the maximum weight prophet matching problem under edge arrivals (a.k.a. prophet matching).</div><div>In this work, we provide new and improved upper bounds on the competitiveness achievable by an algorithm for the general online 2-bounded auction and the (single-minded) prophet matching problems. For the adversarial arrival order of the agents, we show that no algorithm for the online 2-bounded auction problem achieves a competitiveness larger than 4/11, while no algorithm for prophet matching achieves a competitiveness larger than ≈0.4189. Using a continuous-time analysis, we also improve the known bounds for online 2-bounded auctions for random order arrivals to ≈0.5968 in the general case, a bound of ≈0.6867 in the IID model, and ≈0.6714 in prophet-secretary model.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"61 ","pages":"Article 107294"},"PeriodicalIF":0.8,"publicationDate":"2025-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143800498","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}
引用次数: 0
Proportional-with-Leader-Bonus rules for group-buying with invitation behavior 带邀请行为的团购的比例与领导奖金规则
IF 0.8 4区 管理学
Operations Research Letters Pub Date : 2025-04-04 DOI: 10.1016/j.orl.2025.107285
Hang Chen , Genjiu Xu , Li Zhang
{"title":"Proportional-with-Leader-Bonus rules for group-buying with invitation behavior","authors":"Hang Chen ,&nbsp;Genjiu Xu ,&nbsp;Li Zhang","doi":"10.1016/j.orl.2025.107285","DOIUrl":"10.1016/j.orl.2025.107285","url":null,"abstract":"<div><div>Group-buying leverages collective purchasing power, with invitations boosting volume and profit. This paper proposes Proportional-with-Leader-Bonus (PLB) rules, allocating profit by purchasing volume and rewarding leaders for invitations. To prevent fake invitations and collusion, False-Name-Proof (FNP) and Consolidation-Proof (CP) are analyzed. Leader Income Consistency (LIC) and Bilateral Ratio Consistency (BRC) ensure fair leader rewards and balance purchasing volume and invitations. The PLB rules are axiomatically characterized by Single-person efficiency, FNP, CP, LIC, and BRC, providing a robust framework for fair profit allocation.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"61 ","pages":"Article 107285"},"PeriodicalIF":0.8,"publicationDate":"2025-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143792625","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}
引用次数: 0
A note on fast deterministic algorithms for non-monotone submodular maximization under a knapsack constraint 背包约束下非单调次模最大化的快速确定性算法
IF 0.8 4区 管理学
Operations Research Letters Pub Date : 2025-04-04 DOI: 10.1016/j.orl.2025.107295
Cheng Lu
{"title":"A note on fast deterministic algorithms for non-monotone submodular maximization under a knapsack constraint","authors":"Cheng Lu","doi":"10.1016/j.orl.2025.107295","DOIUrl":"10.1016/j.orl.2025.107295","url":null,"abstract":"<div><div>We present a refined analysis of a variant of the algorithm in the literature for solving the knapsack-constrained submodular maximization problem. By deriving a strong approximation bound for this variant, we reduce the size of the sets requiring enumeration, from two to one, to ensure the final algorithm achieves 1/4-approximation. As a result, we obtain the fastest deterministic algorithm so far which achieves an approximation ratio of 1/4 for the problem.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"61 ","pages":"Article 107295"},"PeriodicalIF":0.8,"publicationDate":"2025-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143842792","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}
引用次数: 0
A linear programming-based hyper local search for tuning hyperparameters 基于线性规划的超局部寻优超参数
IF 0.8 4区 管理学
Operations Research Letters Pub Date : 2025-04-02 DOI: 10.1016/j.orl.2025.107287
Ankur Sinha , Satender Gunwal
{"title":"A linear programming-based hyper local search for tuning hyperparameters","authors":"Ankur Sinha ,&nbsp;Satender Gunwal","doi":"10.1016/j.orl.2025.107287","DOIUrl":"10.1016/j.orl.2025.107287","url":null,"abstract":"<div><div>We introduce a linear programming-based approach for hyperparameter tuning of machine learning models. The approach finetunes continuous hyperparameters and model parameters through a linear program, enhancing model generalization in the vicinity of an initial model. The proposed method converts hyperparameter optimization into a bilevel program and identifies a descent direction to improve validation loss. The results demonstrate improvements in most cases across regression, machine learning, and deep learning tasks, with test performance enhancements ranging from 0.3% to 28.1%.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"61 ","pages":"Article 107287"},"PeriodicalIF":0.8,"publicationDate":"2025-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143768457","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}
引用次数: 0
Optimal procurement under backwardation and the benefits of the manifestation of demand aggregators 现货溢价条件下的最优采购及需求聚合效应的体现
IF 0.8 4区 管理学
Operations Research Letters Pub Date : 2025-04-01 DOI: 10.1016/j.orl.2025.107286
Ioannis Avramopoulos, Prodromos Makris, Emmanouel Varvarigos
{"title":"Optimal procurement under backwardation and the benefits of the manifestation of demand aggregators","authors":"Ioannis Avramopoulos,&nbsp;Prodromos Makris,&nbsp;Emmanouel Varvarigos","doi":"10.1016/j.orl.2025.107286","DOIUrl":"10.1016/j.orl.2025.107286","url":null,"abstract":"<div><div>Normal backwardation manifests when the futures price of a commodity is below the expected future spot price. In this paper, we show how businesses can optimally leverage backwardation in their supply chain optimization. To that end, we derive the optimal amount a business ought to purchase in the futures market to take advantage of the favorable futures price in order to minimize the overall expected procurement cost. We further use Hoeffding's inequality to predict the manifestation of demand aggregators.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"61 ","pages":"Article 107286"},"PeriodicalIF":0.8,"publicationDate":"2025-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143747590","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Finding a good normal population 找到一个良好的正常人口
IF 0.8 4区 管理学
Operations Research Letters Pub Date : 2025-03-31 DOI: 10.1016/j.orl.2025.107281
Sheldon M. Ross, Tianchi Zhao
{"title":"Finding a good normal population","authors":"Sheldon M. Ross,&nbsp;Tianchi Zhao","doi":"10.1016/j.orl.2025.107281","DOIUrl":"10.1016/j.orl.2025.107281","url":null,"abstract":"<div><div>We study the problem of finding a normal population whose mean is at least as large as some specified value <em>m</em>. Assuming a sampling cost, the objective is to minimize the expected total discounted cost until there is a population whose mean is at least <em>m</em> with probability at least <em>α</em>. We propose several heuristic policies as well as a linear programming approach.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"61 ","pages":"Article 107281"},"PeriodicalIF":0.8,"publicationDate":"2025-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143737992","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}
引用次数: 0
On queens and tours 关于女王和旅行团
IF 0.8 4区 管理学
Operations Research Letters Pub Date : 2025-03-28 DOI: 10.1016/j.orl.2025.107283
Pieter Jacobs, Andrés López Martínez, Frits Spieksma
{"title":"On queens and tours","authors":"Pieter Jacobs,&nbsp;Andrés López Martínez,&nbsp;Frits Spieksma","doi":"10.1016/j.orl.2025.107283","DOIUrl":"10.1016/j.orl.2025.107283","url":null,"abstract":"<div><div>Given the complete graph on <em>n</em> vertices, where <span><math><mi>n</mi><mo>≥</mo><mn>3</mn></math></span>, we define two Hamiltonian cycles as <em>cyclic disjoint</em> if, for each pair of vertices, the distance between them in one Hamiltonian cycle differs from the distance between them in the other Hamiltonian cycle. We investigate the number of pairwise cyclic disjoint tours that exist in <span><math><msub><mrow><mi>K</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span>. Specifically, we identify when pairs of cyclic disjoint tours can occur and provide a procedure to generate <span><math><mfrac><mrow><mi>m</mi><mo>−</mo><mn>1</mn></mrow><mrow><mn>2</mn></mrow></mfrac></math></span> pairwise cyclic disjoint tours, where <em>m</em> is the smallest prime factor of <em>n</em>. Finally, we demonstrate that the number <span><math><mfrac><mrow><mi>m</mi><mo>−</mo><mn>1</mn></mrow><mrow><mn>2</mn></mrow></mfrac></math></span> of pairwise cyclic disjoint tours is maximized when <em>n</em> is prime.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"61 ","pages":"Article 107283"},"PeriodicalIF":0.8,"publicationDate":"2025-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143737991","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
q-fixed majority efficiency of committee scoring rules q-固定多数效率的委员会评分规则
IF 0.8 4区 管理学
Operations Research Letters Pub Date : 2025-03-28 DOI: 10.1016/j.orl.2025.107282
Clinton Gubong Gassi , Eric Kamwa
{"title":"q-fixed majority efficiency of committee scoring rules","authors":"Clinton Gubong Gassi ,&nbsp;Eric Kamwa","doi":"10.1016/j.orl.2025.107282","DOIUrl":"10.1016/j.orl.2025.107282","url":null,"abstract":"<div><div>This paper introduces the <em>q</em>-fixed majority property for committee selection rules, which extends the traditional fixed majority principle to a flexible framework. We examine conditions under which the committee scoring rules satisfy the <em>q</em>-fixed majority property. Focusing on (weakly) separable rules, we find that the Bloc rule is the only which satisfies it for all <span><math><mi>q</mi><mo>&gt;</mo><mn>1</mn><mo>/</mo><mn>2</mn></math></span>. In addition, the <em>q</em>-bottom majority property is introduced, highlighting conditions under which committees can be excluded based on voter consensus.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"61 ","pages":"Article 107282"},"PeriodicalIF":0.8,"publicationDate":"2025-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143737990","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","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学术文献互助群
群 号：604180095
Book学术官方微信