Semi-Markov dynamic programming approach to competitive bidding with state space reduction considerations (Q1093524)

An infinite horizon sum-Markov dynamic programming model is formulated to compute the optimal bidding strategy for a firm using multiple limited resources with idle costs, sequentially bidding in each period for one of the multiple types of projects with different durations and resource requirements. An oligopolistic market with generally stable environmental conditions, in which the lowest bidder secures the project, is considered. Previous bid results are assumed to be known prior to submitting a subsequent bid.