Back to results

Case Western Reserve University School of Graduate Studies

Stochastic Dynamic Optimization and Games in Operations Management

Abstract

dc:description

<p>This dissertation consists of three essays that analyze stochastic dynamic optimization models and game models in operations management.</p><p>Markov decision processes (MDPs) and sequential games are good models of many real sequential decision processes. However, in diverse applications in operations research and economics, the state of the MDP is a vector and the curse of dimensionality obstructs analysis and computations. Several veins of research seek to exorcise this curse. One vein, the domain of the first essay, identifies MDPs with myopic optima, namely sequential decision processes that can be solved via a temporal sequence of static problems. The first essay identifies new classes of MDPs with myopic optima and sequential games with myopic equilibrium points.</p><p>Seasonal fashion goods and seats on specific airline fights exemplify a job lot whose sale as time passes should be managed closely as a deadline approaches. The second essay analyzes a dynamic revenue management model in which firms set prices and hold back inventory for sale later in the season. We concentrate on a model with demand functions that are stochastic, nonstationary, and iso-elastic. If there is only a single firm, the resulting Markov decision process has a myopic optimum that canbe specified nearly explicitly and is easily computed. If there are multiple firms, there is a myopic Markov-perfect equilibrium point that can be computed easily and facilitates the analysis of comparative dynamics.</p><p>A pricing schedule is nonlinear if the resulting revenue is not a linear function of quantity. The third essay presents a dynamic nonlinear pricing model with stochastic demand. We start with a two-segment model for illustrative purposes and derive properties of the model and its optimum which include the existence of a myopic optimum that can be specified nearly explicitly and is easily computed. Furthermore, the optimal policy is a linear decision rule. The essay ends by extending the two- segment model to an arbitrary number of segments and uses numerical examples to compare models with two and three segments.</p>

Degree

thesis:*
Name thesis:degree_name
Doctor of Philosophy
Level thesis:degree_level
doctoral
Discipline thesis:degree_discipline
Operations
Grantor dc:publisher
Case Western Reserve University School of Graduate Studies
Year dc:date
2013

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Wei, Wei
Contributors dc:contributor
  • Sobel, Matthew

Subjects

dc:subject × 9

Rights

dc:rights
Statement dc:rights
  • unrestricted
  • This thesis or dissertation is protected by copyright: all rights reserved. It may not be copied or redistributed beyond the terms of applicable copyright laws.
Language dc:language
English

Identifiers

dc:identifier.*
OAI identifier oai:identifier
oai:etd.ohiolink.edu:case1354751981

Chain of custody

source
Harvested from
OhioLINK
Base URL
etd.ohiolink.edu/acprod/odb_etd/ws/oai/oai
Last updated
2026-07-24
Source record
OAI-PMH GetRecord
citation

Wei, Wei. Stochastic Dynamic Optimization and Games in Operations Management. doctoral thesis, Case Western Reserve University School of Graduate Studies, 2013. http://rave.ohiolink.edu/etdc/view?acc_num=case1354751981