The Network Revenue Management problem can be formulated as a stochastic dynamic programming problem (DP or the\optimal" solution V *) whose exact solution is computationally intractable. Consequently, a number of heuristics have been proposed in the literature, the most popular of which are the...

We will call a game a reachable (pure strategy) equilibria game if starting from any strategy by any player, by a sequence of best-response moves we are able to reach a (pure strategy) equilibrium. We give a characterization of all finite strategy space duopolies with reachable equilibria. We...

Customer choice behavior, such as 'buy-up' and 'buy-down', is an important phe-nomenon in a wide range of industries. Yet there are few models or methodologies available to exploit this phenomenon within yield management systems. We make some progress on filling this void. Specifically, we...

Many revenue management (RM) industries are characterized by (a) fixed capacities in the short term (e.g., hotel rooms, seats on an airline flight), (b) homogeneous products (e.g., two airline flights between the same cities at similar times), and (c) customer purchasing decisions largely...

Customer choice behavior, such as buy-up and buy-down, is an important phenomenon in a wide range of revenue management contexts. Yet most revenue management methodologies ignore this phenomenon---or at best approximate it in a heuristic way. In this paper, we provide an exact and quite general...

In this paper, we study price competition for an oligopoly in a dynamic setting, where each of the sellers has a fixed number of units available for sale over a fixed number of periods. Demand is stochastic, and depending on how it evolves, sellers may change their prices at any time. This...