國立虎尾科技大學 |

Dynamic Pricing under Operational Frictions.

紀錄類型:	書目-語言資料,手稿 : Monograph/item
正題名/作者:	Dynamic Pricing under Operational Frictions./
作者:	Chen, Qi.
面頁冊數:	1 online resource (194 pages)
附註:	Source: Dissertation Abstracts International, Volume: 79-04(E), Section: A.
Contained By:	Dissertation Abstracts International79-04A(E).
標題:	Business administration. -
電子資源:	click for full text (PQDT)
ISBN:	9780355365009

Dynamic Pricing under Operational Frictions.
Chen, Qi.

Dynamic Pricing under Operational Frictions. - 1 online resource (194 pages)

Source: Dissertation Abstracts International, Volume: 79-04(E), Section: A.

Thesis (Ph.D.)

Includes bibliographical references

This dissertation investigates the tactical dynamic pricing decisions in industries where sellers sell multiple types of capacity-constrained products/services to their customers. Motivated by operational frictions posed by business considerations, I develop dynamic pricing heuristics that have both provably good revenue performance and nice features which can address these operational frictions. The first essay studies how to do effective dynamic pricing without too many price changes. In practice, many sellers have concerns about dynamic pricing due to the computational complexity of frequent re-optimizations, the negative perception of excessive price adjustments, and the lack of flexibility caused by existing business constraints. To address these concerns, I develop a pricing heuristic which is computationally easy to implement and only needs to adjust a small number of prices and do so infrequently to guarantee a strong revenue performance. In addition, when not all products are equally admissible to price adjustment, my heuristic can replace the price adjustment of some products by their similar products and maintain an equivalent revenue performance. These features allow the sellers to achieve most of the benefit of dynamic pricing with much fewer price changes and provide extra flexibility to manage prices. While the first essay assumes that the sellers know the underlying demand function, this information is sometimes unavailable to the sellers in practice. The second and the third essays study how to jointly learn the demand and dynamically price the products to minimize revenue loss compared to a standard revenue upper bound in the literature. The second essay addresses the parametric case where the seller knows the functional form of the demand but not the parameters; the third essay addresses the nonparametric case where the seller does not even know the functional form of the demand. There is a considerable gap between the revenue loss lower bound under any pricing policy and the performance bound of the best known heuristic in the literature. To close the gap, in my second essay, I propose a heuristic that exactly match the lower bound for the parametric case, and show that under a demand separation condition, a much sharper revenue loss bound can be obtained; in my third essay, I propose a heuristic whose performance is arbitrarily close to the lower bound for the nonparametric case. All the proposed heuristics are computationally very efficient and can be used as a baseline for developing more sophisticated heuristics for large-scale problems.

Electronic reproduction.
Ann Arbor, Mich. :
ProQuest,
2018

Mode of access: World Wide Web

ISBN: 9780355365009Subjects--Topical Terms:

1148568
Business administration.
Index Terms--Genre/Form:

554714
Electronic books.

Dynamic Pricing under Operational Frictions.
LDR:03859ntm a2200337Ki 4500 001 910066
005 20180511093034.5
006 m o u
007 cr mn||||a|a||
008 190606s2017 xx obm 000 0 eng d
020 $a 9780355365009
035 $a (MiAaPQ)AAI10670246
035 $a (MiAaPQ)umichrackham:000750
035 $a AAI10670246
040 $a MiAaPQ $b eng $c MiAaPQ
099 $a TUL $f hyy $c available through World Wide Web
100 1 $a Chen, Qi. $3 1158463
245 1 0 $a Dynamic Pricing under Operational Frictions.
264 0 $c 2017
300 $a 1 online resource (194 pages)
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
500 $a Source: Dissertation Abstracts International, Volume: 79-04(E), Section: A.
500 $a Advisers: Izak Duenyas; Stefanus Jasin.
502 $a Thesis (Ph.D.) $c University of Michigan $d 2017.
504 $a Includes bibliographical references
520 $a This dissertation investigates the tactical dynamic pricing decisions in industries where sellers sell multiple types of capacity-constrained products/services to their customers. Motivated by operational frictions posed by business considerations, I develop dynamic pricing heuristics that have both provably good revenue performance and nice features which can address these operational frictions. The first essay studies how to do effective dynamic pricing without too many price changes. In practice, many sellers have concerns about dynamic pricing due to the computational complexity of frequent re-optimizations, the negative perception of excessive price adjustments, and the lack of flexibility caused by existing business constraints. To address these concerns, I develop a pricing heuristic which is computationally easy to implement and only needs to adjust a small number of prices and do so infrequently to guarantee a strong revenue performance. In addition, when not all products are equally admissible to price adjustment, my heuristic can replace the price adjustment of some products by their similar products and maintain an equivalent revenue performance. These features allow the sellers to achieve most of the benefit of dynamic pricing with much fewer price changes and provide extra flexibility to manage prices. While the first essay assumes that the sellers know the underlying demand function, this information is sometimes unavailable to the sellers in practice. The second and the third essays study how to jointly learn the demand and dynamically price the products to minimize revenue loss compared to a standard revenue upper bound in the literature. The second essay addresses the parametric case where the seller knows the functional form of the demand but not the parameters; the third essay addresses the nonparametric case where the seller does not even know the functional form of the demand. There is a considerable gap between the revenue loss lower bound under any pricing policy and the performance bound of the best known heuristic in the literature. To close the gap, in my second essay, I propose a heuristic that exactly match the lower bound for the parametric case, and show that under a demand separation condition, a much sharper revenue loss bound can be obtained; in my third essay, I propose a heuristic whose performance is arbitrarily close to the lower bound for the nonparametric case. All the proposed heuristics are computationally very efficient and can be used as a baseline for developing more sophisticated heuristics for large-scale problems.
533 $a Electronic reproduction. $b Ann Arbor, Mich. : $c ProQuest, $d 2018
538 $a Mode of access: World Wide Web
650 4 $a Business administration. $3 1148568
655 7 $a Electronic books. $2 local $3 554714
690 $a 0310
710 2 $a ProQuest Information and Learning Co. $3 1178819
710 2 $a University of Michigan. $b Business Administration. $3 1181140
773 0 $t Dissertation Abstracts International $g 79-04A(E).
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10670246 $z click for full text (PQDT)