Power of Second Opportunity: Dynamic Pricing with Second Chance

IF 6.6 1区 计算机科学 Q1 Multidisciplinary
Chensheng Ma;Shaojie Tang;Zhao Zhang
{"title":"Power of Second Opportunity: Dynamic Pricing with Second Chance","authors":"Chensheng Ma;Shaojie Tang;Zhao Zhang","doi":"10.26599/TST.2023.9010108","DOIUrl":null,"url":null,"abstract":"In this paper, we consider the following dynamic pricing problem. Suppose the market price \n<tex>$v_{t}$</tex>\n of an item arriving at time \n<tex>$t$</tex>\n is determined by \n<tex>$v_{t}=\\pmb{\\theta}^{\\mathrm{T}}\\pmb{x}_{t}$</tex>\n, where \n<tex>$\\pmb{x}_{t}$</tex>\n is the feature vector of that item and \n<tex>$\\pmb{\\theta}$</tex>\n is an unknown vector parameter. The seller has to post prices without knowing \n<tex>$\\pmb{\\theta}$</tex>\n such that the total regret in time span \n<tex>$T$</tex>\n is minimized. Considering real-world scenarios in which people may negotiate prices, we propose a model called Second Chance Pricing, in which a seller has a second opportunity to post a price after the first offer is declined. Theoretical analysis shows that a second chance of pricing results in a total regret between \n<tex>$o(\\frac{\\ln T}{n\\ln n}+\\frac{1}{n})$</tex>\n and \n<tex>$O(n^{2}\\ln T)$</tex>\n, where \n<tex>$n$</tex>\n is the dimension of the feature space. Experiments on both synthetic data and real data demonstrate significant benefits brought about by the second chance where the regret is only 13% of that of one chance.","PeriodicalId":48690,"journal":{"name":"Tsinghua Science and Technology","volume":"30 2","pages":"543-560"},"PeriodicalIF":6.6000,"publicationDate":"2024-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10786952","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Tsinghua Science and Technology","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10786952/","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"Multidisciplinary","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper, we consider the following dynamic pricing problem. Suppose the market price $v_{t}$ of an item arriving at time $t$ is determined by $v_{t}=\pmb{\theta}^{\mathrm{T}}\pmb{x}_{t}$ , where $\pmb{x}_{t}$ is the feature vector of that item and $\pmb{\theta}$ is an unknown vector parameter. The seller has to post prices without knowing $\pmb{\theta}$ such that the total regret in time span $T$ is minimized. Considering real-world scenarios in which people may negotiate prices, we propose a model called Second Chance Pricing, in which a seller has a second opportunity to post a price after the first offer is declined. Theoretical analysis shows that a second chance of pricing results in a total regret between $o(\frac{\ln T}{n\ln n}+\frac{1}{n})$ and $O(n^{2}\ln T)$ , where $n$ is the dimension of the feature space. Experiments on both synthetic data and real data demonstrate significant benefits brought about by the second chance where the regret is only 13% of that of one chance.
第二次机会的力量:第二次机会的动态定价
在本文中,我们将考虑以下动态定价问题。假设在时间 $t$ 到达的物品的市场价格 $v_{t}$ 由 $v_{t}=\pmb{\theta}^{\mathrm{T}}\pmb{x}_{t}$ 决定,其中 $\pmb{x}_{t}$ 是该物品的特征向量,$/pmb{theta}$ 是一个未知的向量参数。卖方必须在不知道 $\pmb{\theta}$ 的情况下发布价格,使时间跨度 $T$ 内的总遗憾最小。考虑到现实世界中人们可能会协商价格,我们提出了一个名为 "第二次机会定价"(Second Chance Pricing)的模型,即卖方在第一次报价被拒绝后有第二次机会公布价格。理论分析表明,第二次定价机会导致的总遗憾在 $o(\frac{ln T}{n\ln n}+\frac{1}{n})$ 和 $O(n^{2}\ln T)$ 之间,其中 $n$ 是特征空间的维度。在合成数据和真实数据上进行的实验表明,第二次机会带来了显著的优势,其遗憾值仅为一次机会的 13%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Tsinghua Science and Technology
Tsinghua Science and Technology COMPUTER SCIENCE, INFORMATION SYSTEMSCOMPU-COMPUTER SCIENCE, SOFTWARE ENGINEERING
CiteScore
10.20
自引率
10.60%
发文量
2340
期刊介绍: Tsinghua Science and Technology (Tsinghua Sci Technol) started publication in 1996. It is an international academic journal sponsored by Tsinghua University and is published bimonthly. This journal aims at presenting the up-to-date scientific achievements in computer science, electronic engineering, and other IT fields. Contributions all over the world are welcome.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信