دانلود ترجمه مقاله مقایسه ای از سیاست های قیمت گذاری ثابت و دینامیک

In this paper,we investigate the use of fixed and dynamic pricing policies for selling a fixed amount of inventory over a finite horizon. We propose two simple and computationally feasible dynamic pricing heuristics that can be used to update prices as uncertainty is resolved through out the horizon.The first heuristic, there venue approximation heuristic, is based on approximating the value function that arise in the dynamic programming formulation to determine optimal prices. The sec- ond heuristic, the dynamic run-outrate heuristic, is based on continuously resolving the deterministic version of the problem. Through a detailed numerical study,we demonstrate that fixed- price heuristic slead to serious short coming sin revenue with general demand functions for moderate and small values of starting inventory when the demand potential is large. We show that these are precisely the setting sin which the dynamic pricing heuristics that we propose can be effectively used to obtain near- optimal performance. In particular ,there venue approximation heuristic has a consistently remark able performance, leading to a maximum 0.2% optimality gapin all problems we consider. We also study the impact of changing prices periodically rather than continuously using these heuristics. We show that the revenue approximation heuristic’s performance is monotone in then um- ber of periods used and one can quickly get close to the full revenue potential of continuous price changes. Our main conclu- sion is that dynamic pricing heuristics lead to near-optimal performance and can provide important gains over fixed-price heuristics even when the reisonly normal statistical variation in demand and that their use should begiven more consideration in theory and practice.