Competitor identification with memory in a dynamic financial transaction network

IF 4.4 3区 管理学 Q1 OPERATIONS RESEARCH & MANAGEMENT SCIENCE Annals of Operations Research Pub Date : 2023-08-26 DOI:10.1007/s10479-023-05552-7
Jeongsub Choi, Byunghoon Kim, Ho-shin Lee
{"title":"Competitor identification with memory in a dynamic financial transaction network","authors":"Jeongsub Choi,&nbsp;Byunghoon Kim,&nbsp;Ho-shin Lee","doi":"10.1007/s10479-023-05552-7","DOIUrl":null,"url":null,"abstract":"<div><p>Competitor identification (CI) is an essential step in establishing an effective competitive business strategy. For complex business environments, network-based CI methods have been studied in the literature, aiming to shed light on the blind spots in managers’ radars. Typically, CI is based on networks without temporal information, despite the dynamic changes in business environments. Alternatively, the temporal information is considered in CI by simply accumulating the intensities of synchronous interfirm competition evaluated over time. As a result, competitors’ actions in the past are overlooked in evaluations of interfirm competition, although such actions remain in managers’ memories. In this study, we propose a new method for CI incorporating memories of the past transactions of competitors in a dynamic network. The proposed method measures the interfirm competition between firms based on their resource similarity and market commonality in a dynamic financial transaction network. The proposed method facilitates capturing the asynchronous competition from suppliers and demanders taken by competitors. We evaluate the proposed method on a toy network and on a case of interfirm transactions in Korea from 2011 to 2014. The results show that the temporal information in dynamic networks and memory about past transactions improves the predictive accuracy in CI with the proposed method.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"341 1","pages":"349 - 374"},"PeriodicalIF":4.4000,"publicationDate":"2023-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Annals of Operations Research","FirstCategoryId":"91","ListUrlMain":"https://link.springer.com/article/10.1007/s10479-023-05552-7","RegionNum":3,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Competitor identification (CI) is an essential step in establishing an effective competitive business strategy. For complex business environments, network-based CI methods have been studied in the literature, aiming to shed light on the blind spots in managers’ radars. Typically, CI is based on networks without temporal information, despite the dynamic changes in business environments. Alternatively, the temporal information is considered in CI by simply accumulating the intensities of synchronous interfirm competition evaluated over time. As a result, competitors’ actions in the past are overlooked in evaluations of interfirm competition, although such actions remain in managers’ memories. In this study, we propose a new method for CI incorporating memories of the past transactions of competitors in a dynamic network. The proposed method measures the interfirm competition between firms based on their resource similarity and market commonality in a dynamic financial transaction network. The proposed method facilitates capturing the asynchronous competition from suppliers and demanders taken by competitors. We evaluate the proposed method on a toy network and on a case of interfirm transactions in Korea from 2011 to 2014. The results show that the temporal information in dynamic networks and memory about past transactions improves the predictive accuracy in CI with the proposed method.

Abstract Image

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
动态金融交易网络中竞争者的记忆识别
竞争对手识别(CI)是建立有效商业竞争战略的重要步骤。针对复杂的商业环境,文献中研究了基于网络的 CI 方法,旨在揭示管理者雷达中的盲点。通常情况下,尽管商业环境在动态变化,但 CI 是基于没有时间信息的网络。另外,CI 还考虑了时间信息,方法是简单地累积随时间评估的企业间同步竞争强度。因此,在对企业间竞争进行评估时,竞争对手过去的行为会被忽略,尽管这些行为还留在管理者的记忆中。在本研究中,我们提出了一种将动态网络中竞争对手过去交易的记忆纳入 CI 的新方法。所提出的方法基于动态金融交易网络中企业间的资源相似性和市场共通性来衡量企业间竞争。所提出的方法有助于捕捉竞争者从供应商和需求者那里获得的异步竞争。我们在一个玩具网络和 2011 年至 2014 年韩国企业间交易案例中对所提出的方法进行了评估。结果表明,动态网络中的时间信息和对过去交易的记忆提高了拟议方法在 CI 中的预测准确性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Annals of Operations Research
Annals of Operations Research 管理科学-运筹学与管理科学
CiteScore
7.90
自引率
16.70%
发文量
596
审稿时长
8.4 months
期刊介绍: The Annals of Operations Research publishes peer-reviewed original articles dealing with key aspects of operations research, including theory, practice, and computation. The journal publishes full-length research articles, short notes, expositions and surveys, reports on computational studies, and case studies that present new and innovative practical applications. In addition to regular issues, the journal publishes periodic special volumes that focus on defined fields of operations research, ranging from the highly theoretical to the algorithmic and the applied. These volumes have one or more Guest Editors who are responsible for collecting the papers and overseeing the refereeing process.
期刊最新文献
Digital operations research models for intelligent machines (industry 4.0) and man-machine (industry 5.0) systems AI-based decision support systems for sustainable business management under circular economy Leveraging interpretable machine learning in intensive care Correction: Power utility maximization with expert opinions at fixed arrival times in a market with hidden gaussian drift Designing resilient supply chain networks: a systematic literature review of mitigation strategies
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1