Dynamic pricing, competition and uncertainty
by Kwon, Changhyun, Ph.D., THE PENNSYLVANIA STATE UNIVERSITY, 2008, 156 pages; 3346332

Abstract:

In this thesis, we study various dynamic pricing problems in the form of infinite-dimensional mathematical programming, i.e., optimal control problems and differential variational inequalities (DVIs), in support of accurate and efficient algorithms. In addition, we describe a method for handling uncertainty in optimal control problems via a robust optimization approach. We provide a formal method for handling uncertainty in the objective function, which may be nonlinear in states, controls, and uncertain parameters.

To develop an algorithm for DVIs, we consider a gap function for DVIs and study an equivalent optimal control problem. In particular, we employ a differential gap function and its gradient to form a descent method for DVIs. To show the descent method is effective, we investigate an application of DVIs to differential Nash games. In particular, we solve an abstract linear-quadratic differential Nash game using our proposed descent method.

We study dynamic pricing problems of three different classes: (1) infrastructure pricing, (2) service pricing, and (3) manufactured good pricing. First, we present a theory of dynamic congestion pricing for vehicular traffic networks; we consider day-to-day as well as within-day time scales in the formulation of a dynamic optimal toll problem with equilibrium constraints. Second, we study a non-cooperative differential game between service providers using a demand learning mechanism. Third, we provide a robust optimal control formulation of a dynamic pricing and inventory control problem in the presence of demand uncertainty.

 
Advisor
SchoolTHE PENNSYLVANIA STATE UNIVERSITY
SourceDAI/B 70-02, p. , Apr 2009
Source TypeDissertation
SubjectsIndustrial engineering; Operations research
Publication Number3346332
Adobe PDF Access the complete dissertation:
 

» Find an electronic copy at your library.
  Use the link below to access a full citation record of this graduate work:
  http://gateway.proquest.com/openurl%3furl_ver=Z39.88-2004%26res_dat=xri:pqdiss%26rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation%26rft_dat=xri:pqdiss:3346332
  If your library subscribes to the ProQuest Dissertations & Theses (PQDT) database, you may be entitled to a free electronic version of this graduate work. If not, you will have the option to purchase one, and access a 24 page preview for free (if available).

About ProQuest Dissertations & Theses
With over 2.3 million records, the ProQuest Dissertations & Theses (PQDT) database is the most comprehensive collection of dissertations and theses in the world. It is the database of record for graduate research.

The database includes citations of graduate works ranging from the first U.S. dissertation, accepted in 1861, to those accepted as recently as last semester. Of the 2.3 million graduate works included in the database, ProQuest offers more than 1.9 million in full text formats. Of those, over 860,000 are available in PDF format. More than 60,000 dissertations and theses are added to the database each year.

If you have questions, please feel free to visit the ProQuest Web site - http://www.proquest.com - or call ProQuest Hotline Customer Support at 1-800-521-3042.