今天是:

学术讲座

您现在的位置: 首页 >> 信息 >> 学术讲座

“商学大讲堂”系列学术讲座(第261讲)---学术名家讲坛(80)

发布日期:2024-12-27  来源:商学院   韩晓东
2024 12
30 主题 Duopoly Assortment Competition under the MNL Model: Simultaneous vs. Sequential
主讲 王长军 时间 2024年12月30日(星期一)上午10:00--12:00
地点 商学院116东方厅 短标题 “商学大讲堂”系列学术讲座(第261讲)---学术名家讲坛(80)

讲座题目:Duopoly Assortment Competition under the MNL Model: Simultaneous vs. Sequential

主讲嘉宾:王长军

时间:2024年12月30日(星期一)上午10:00--12:00

地点:商学院116东方厅



欢迎感兴趣的师生参加聆听!


江南大学商学院

2024年12月26日


主讲嘉宾简介

王长军,现任中国科学院数学与系统betway必威官方网站app院副研究员。主要从事算法博弈与机制设计、组合优化等方向的理论研究。目前已在包括OR、MOR、POM、EC、WINE等的相关领域重要国际期刊及会议发表多篇论文。曾主持国家自然科学基金面上项目、中国科协青年人才托举工程项目及获中国运筹学会青年科技奖等。


讲座主要内容

In this study, we investigate two different types of duopolistic competitive assortment problems under the multinomial logit model. We first extend prior work by introducing a more general competitive model incorporating common products under the multinomial logit model. For simultaneous assortment competition, we study the existence of pure-strategy Nash equilibria and fully characterize the structures of equilibrium outcomes. Specifically, we demonstrate the existence of an equilibrium that always Pareto-dominates others in the settings with both common and exclusive products. This equilibrium is efficiently computed using a carefully crafted iterative best response process.

For sequential assortment competition, we find that the subgame perfect Nash equilibrium leads to higher profitability for both the leader and the follower compared to the Pareto-dominant equilibrium in simultaneous assortment competition. Despite its profitability advantages, computing the subgame perfect Nash equilibrium for duopoly sequential assortment competition is NP-hard, even with only exclusive products. To address this hardness result, we propose a fully polynomial-time approximation scheme for problems involving both common and exclusive products. (Joint work with Kameng Nip)



阅读( (编辑:商学院)

    点击排行| 精华推荐

技术支持:信息化建设管理处

校内备案号:JW备170083

地址:江苏省无锡市蠡湖大道1800号

邮编:214122

联系电话:0510-85326517

服务邮箱:xck@jiangnan.edu.cn

Baidu
map