Revenue maximization with access and information pricing schemes in a partially-observable queueing game

Tesnim Naceur, Y. Hayel
{"title":"Revenue maximization with access and information pricing schemes in a partially-observable queueing game","authors":"Tesnim Naceur, Y. Hayel","doi":"10.1145/3306309.3306331","DOIUrl":null,"url":null,"abstract":"Today's queueing network systems are more rapidly evolving and more complex than those of even a few years ago. The goal of this paper is to study customers' behavior in an unobservable Markovian M/M/1 queue where consumers have to choose between two strategic decisions about information acquisition before joining or not the queue. According to their decision, customers decide to give up the service (balk the system) or to join the queue. We study the Nash equilibrium strategies and we consider the problem of revenue maximization where the provider has to choose between two charging mechanisms: to charge the access to the system or to charge the queue length information to new incoming customers and we show that, depending on the sensitivity of customers to their waiting time, the provider will change the pricing policy used.","PeriodicalId":113198,"journal":{"name":"Proceedings of the 12th EAI International Conference on Performance Evaluation Methodologies and Tools","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-01-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 12th EAI International Conference on Performance Evaluation Methodologies and Tools","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3306309.3306331","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Today's queueing network systems are more rapidly evolving and more complex than those of even a few years ago. The goal of this paper is to study customers' behavior in an unobservable Markovian M/M/1 queue where consumers have to choose between two strategic decisions about information acquisition before joining or not the queue. According to their decision, customers decide to give up the service (balk the system) or to join the queue. We study the Nash equilibrium strategies and we consider the problem of revenue maximization where the provider has to choose between two charging mechanisms: to charge the access to the system or to charge the queue length information to new incoming customers and we show that, depending on the sensitivity of customers to their waiting time, the provider will change the pricing policy used.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
部分可观察排队博弈中具有访问和信息定价方案的收益最大化
今天的排队网络系统比几年前发展得更快,也更复杂。本文的目标是研究在不可观察的马尔可夫M/M/1队列中消费者的行为,其中消费者在加入或不加入队列之前必须在两种策略决策中选择信息获取。根据他们的决定,顾客决定放弃服务(拒绝系统)或加入排队。我们研究了纳什均衡策略,并考虑了收入最大化问题,其中供应商必须在两种收费机制之间进行选择:对系统访问收费或对新进入的客户收取队列长度信息,我们表明,根据客户对其等待时间的敏感性,供应商将改变所使用的定价策略。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Revenue-Driven Scheduling in Drone Delivery Networks with Time-sensitive Service Level Agreements A proof of the conjecture in "Pricing surplus server capacity for mean waiting time sensitive customers" Tandem stochastic systems: Jackson networks, asymmetric exclusion processes, asymmetric inclusion processes and Catalan numbers Ultimately Stationary Policies to Approximate Risk-Sensitive Discounted MDPs A bottleneck with randomly distorted arrival times
×
引用
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