Does Congestion Always Hurt? Managing Discount Under
\nCongestion in a Game-Theoretic Setting

小贩 云计算 业务 盈利能力指数 微观经济学 计算机科学 营销 经济 财务 操作系统
作者
Rajib L. Saha,Sumanta Singha,Subodha Kumar
标识
DOI:10.1287/isre.2021.1040
摘要

We study a scenario in which a buyer (e.g., Uber) buys cloud capacity from a seller (e.g., Amazon Web services) to run its business. One of the key factors that affects the \nquality of cloud services is congestion, and it has drawn considerable attention in recent years. Congestion leads to a potential loss of end users (e.g., riders and drivers of Uber), \nthereby adversely affecting the demand for cloud services. Discount has been a useful mean to stimulate demand and reward customer loyalty. However, in the presence of congestion, the effect of discount on demand is ambiguous. On the one hand, a higher discount leads to higher demand; on the other hand, higher demand can lead to higher congestion, thereby lowering the demand. Given that end users are both price and congestion sensitive, the choice of optimal discount under congestion is, therefore, not straightforward. Using a game-theoretic model, we study the dynamics between congestion and discount and explore how congestion moderates both the buyer’s and seller’s optimal decisions. Our results show that the buyer is not necessarily worse off even when the end users are more intolerant to congestion. In fact, we find that when end users are more congestion sensitive, the demand of cloud services can actually sometimes increase, and the discount offered by the seller can decrease. These findings have important managerial implications \non the seller’s pricing and capacity decisions. We also observe that a lower cost of technology can sometimes hurt the buyer, and the buyer can pass on lower benefits to end users. \nMoreover, given that the cloud services are prone to disruptions, a buyer sources from multiple cloud vendors, which further complicates the matter. We draw useful insights about the buyer’s procurement decisions under congestion in a multicloud setup.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
ZYY发布了新的文献求助10
刚刚
sunwei完成签到,获得积分10
1秒前
10完成签到,获得积分10
1秒前
LuciusHe完成签到,获得积分10
1秒前
沐金秋完成签到,获得积分10
2秒前
唠嗑在呐完成签到,获得积分10
4秒前
专一的定帮完成签到,获得积分10
4秒前
dong完成签到 ,获得积分10
5秒前
科研老兵完成签到,获得积分10
6秒前
科研通AI6.2应助迟山采纳,获得10
7秒前
HCLonely完成签到,获得积分0
7秒前
LNdOjk完成签到,获得积分10
8秒前
Lv完成签到,获得积分10
8秒前
8秒前
Alex完成签到,获得积分10
9秒前
10秒前
10秒前
每每反完成签到,获得积分10
11秒前
深情安青应助meiyulu0204采纳,获得10
12秒前
曲奇完成签到 ,获得积分10
12秒前
zyy完成签到,获得积分10
12秒前
yamoon发布了新的文献求助10
12秒前
destiny完成签到 ,获得积分10
13秒前
Yonckham完成签到,获得积分10
13秒前
13秒前
超级的梦山完成签到,获得积分10
13秒前
WXyue完成签到 ,获得积分10
13秒前
rongrong12完成签到,获得积分10
14秒前
Dain发布了新的文献求助10
14秒前
夜白完成签到,获得积分0
14秒前
土豆发布了新的文献求助10
15秒前
青青完成签到,获得积分10
15秒前
斯文败类应助草珊瑚采纳,获得10
17秒前
actor2006完成签到,获得积分10
18秒前
六六发布了新的文献求助10
18秒前
周俊瑞完成签到,获得积分10
19秒前
小圈发布了新的文献求助20
19秒前
熊熊完成签到,获得积分10
20秒前
liuyepiao完成签到,获得积分10
20秒前
轻松的易巧完成签到,获得积分10
21秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Essentials of Carbohydrate Chemistry and Biochemistry, 4th Edition 800
Organizational Behavior 510
Management and the Arts 510
Matrix Methods in Data Mining and Pattern Recognition Second Edition 510
CLSI VET01S-2024 Performance Standards for Antimicrobial Disk and Dilution Susceptibility Tests for Bacteria Isolated From Animals (7th Ed) 500
DIPPR Project 801 - Full Version 380
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 计算机科学 化学工程 工程类 有机化学 物理 复合材料 生物化学 内科学 细胞生物学 基因 遗传学 免疫学 冶金 光电子学 癌症研究
热门帖子
关注 科研通微信公众号,转发送积分 7765974
求助须知:如何正确求助?哪些是违规求助? 9309963
关于积分的说明 20313419
捐赠科研通 7350773
什么是DOI,文献DOI怎么找? 3315010
关于科研通互助平台的介绍 2464543
邀请新用户注册赠送积分活动 2329592