A note on the core of 2-matching games

IF 0.8 4区管理学 Q4 OPERATIONS RESEARCH & MANAGEMENT SCIENCE

Operations Research Letters Pub Date : 2025-04-18 DOI:10.1016/j.orl.2025.107299

Laura Sanità , Lucy Verberk

引用次数: 0

Abstract

Cooperative 2-matching games are a generalization of cooperative matching games, where the value function is given by maximum-weight b-matchings, for a vertex capacity vector

b \leq 2

. We show how to separate over the core of 2-matching games in polynomial time, fixing a small flaw in the literature, and prove the existence of a compact extended formulation for it.

查看原文本刊更多论文

关于2配对游戏的核心

协作2匹配对策是对协作匹配对策的推广，其中对于顶点容量向量b≤2，其值函数由最大权值b匹配给出。我们展示了如何在多项式时间内分离2匹配博弈的核心，修正了文献中的一个小缺陷，并证明了它的一个紧凑的扩展公式的存在性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Operations Research Letters 管理科学-运筹学与管理科学

CiteScore

2.10

自引率

9.10%

发文量

111

审稿时长

83 days

期刊介绍： Operations Research Letters is committed to the rapid review and fast publication of short articles on all aspects of operations research and analytics. Apart from a limitation to eight journal pages, quality, originality, relevance and clarity are the only criteria for selecting the papers to be published. ORL covers the broad field of optimization, stochastic models and game theory. Specific areas of interest include networks, routing, location, queueing, scheduling, inventory, reliability, and financial engineering. We wish to explore interfaces with other fields such as life sciences and health care, artificial intelligence and machine learning, energy distribution, and computational social sciences and humanities. Our traditional strength is in methodology, including theory, modelling, algorithms and computational studies. We also welcome novel applications and concise literature reviews.