Competitive and Cooperative Assortment Games under Markov Chain Choice Model

K. Nip, Changjun Wang, Zizhuo Wang
{"title":"Competitive and Cooperative Assortment Games under Markov Chain Choice Model","authors":"K. Nip, Changjun Wang, Zizhuo Wang","doi":"10.2139/ssrn.3607722","DOIUrl":null,"url":null,"abstract":"In this work, we study the assortment planning games in which multiple retailers interact in the market. Each retailer owns some of the products and their goal is to select a subset of products, i.e., an assortment to o er to the customers so as to maximize their expected revenue. The purchase behavior of the customer is assumed to follow the Markov chain choice model. We consider two types of assortment games under the Markov chain choice model - a competitive game and a cooperative game. \n \nIn the assortment competition game, we show that there always exists a pure-strategy Nash equilibrium and such equilibrium can be found in polynomial time. We also identify an easy-to-check condition for the uniqueness of the Nash equilibrium. Then we analyze the equilibrium outcome on the assortments and the payoffs of this competition game, and compare the outcome with that in a monopolistic setting and a central planner setting. We show that under the assortment competition game, each retailer will o er a broader assortment in the equilibrium, which could include products that are not pro table in the monopolistic or the central planner setting, and it will eventually lead to a decrease of revenue for each player. Furthermore, we show that the price-of-anarchy and the price-of-stability of the game can be arbitrarily large. Motivated by these results, we further consider the assortment cooperation game under the Markov chain choice model, in which retailers are allowed to form coalitions. We consider two settings of cooperative games distinguished by how players presume other players' behavior. Interestingly, we find that when the players take a pessimistic view regarding the behavior of other players, there is incentive for all the players to form a grand coalition and there exists an allocation of the total revenue that makes the coalition stable (exists a core to the game). However, when the players take an optimistic view regarding the behavior of other players, a stable coalition may not exist.","PeriodicalId":393761,"journal":{"name":"ERN: Other Game Theory & Bargaining Theory (Topic)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2020-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ERN: Other Game Theory & Bargaining Theory (Topic)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2139/ssrn.3607722","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

In this work, we study the assortment planning games in which multiple retailers interact in the market. Each retailer owns some of the products and their goal is to select a subset of products, i.e., an assortment to o er to the customers so as to maximize their expected revenue. The purchase behavior of the customer is assumed to follow the Markov chain choice model. We consider two types of assortment games under the Markov chain choice model - a competitive game and a cooperative game. In the assortment competition game, we show that there always exists a pure-strategy Nash equilibrium and such equilibrium can be found in polynomial time. We also identify an easy-to-check condition for the uniqueness of the Nash equilibrium. Then we analyze the equilibrium outcome on the assortments and the payoffs of this competition game, and compare the outcome with that in a monopolistic setting and a central planner setting. We show that under the assortment competition game, each retailer will o er a broader assortment in the equilibrium, which could include products that are not pro table in the monopolistic or the central planner setting, and it will eventually lead to a decrease of revenue for each player. Furthermore, we show that the price-of-anarchy and the price-of-stability of the game can be arbitrarily large. Motivated by these results, we further consider the assortment cooperation game under the Markov chain choice model, in which retailers are allowed to form coalitions. We consider two settings of cooperative games distinguished by how players presume other players' behavior. Interestingly, we find that when the players take a pessimistic view regarding the behavior of other players, there is incentive for all the players to form a grand coalition and there exists an allocation of the total revenue that makes the coalition stable (exists a core to the game). However, when the players take an optimistic view regarding the behavior of other players, a stable coalition may not exist.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
马尔可夫链选择模型下的竞争与合作分类博弈
在本研究中,我们研究了多个零售商在市场中相互作用的分类规划博弈。每个零售商都拥有一些产品,他们的目标是选择产品的一个子集,即一个分类,以最大限度地提高客户的预期收入。假设顾客的购买行为遵循马尔可夫链选择模型。本文研究了马尔可夫链选择模型下的两种分类博弈——竞争博弈和合作博弈。在分类竞争博弈中,我们证明了总存在一个纯策略纳什均衡,并且该均衡可以在多项式时间内找到。我们还确定了纳什均衡唯一性的一个易于检验的条件。在此基础上,分析了该竞争博弈的分类和收益均衡结果,并将其与垄断和中央计划的均衡结果进行了比较。结果表明,在商品分类竞争博弈中,每个零售商在均衡中会选择更广泛的商品分类,其中可能包括在垄断或中央计划环境下不盈利的产品,这最终会导致每个参与者的收入减少。此外,我们还证明了该博弈的无政府价格和稳定价格可以任意大。在这些结果的激励下,我们进一步考虑了马尔可夫链选择模型下允许零售商组成联盟的分类合作博弈。我们考虑了合作游戏的两种设定,即玩家如何假设其他玩家的行为。有趣的是,我们发现当参与者对其他参与者的行为持悲观态度时,所有参与者都有形成大联盟的动机,并且存在使联盟稳定的总收益分配(存在游戏的核心)。然而,当参与者对其他参与者的行为持乐观态度时,稳定的联盟可能不存在。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Stability and Substitutability in Dynamic Matching Markets Evidence Games: Lying Aversion and Commitment On a Competitive Selection Problem The Implications of Strategic Inventory for Short-Term vs. Long-Term Supply Contracts in Non-Exclusive Reselling Environments Avoiding the Cost of your Conscience: Belief Dependent Preferences and Information Acquisition
×
引用
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