摘要

In this paper, we present a new performance model and an analysis for its optimal allocation in a sequential Internet auction system with a set reserve price. In the sequential Internet auction system, a seller wants to sell a given amount, of items through sequential auctions on the Internet. The seller has a reserve price for each item. For each auction, the seller should allocate a quantity of items from the total available items to be auctioned. The buyers arrive according to a Poisson process and bid honestly. We first, consider the model to be a Markov decision process and present its performance analysis. In the analysis, we show that the result is no difference whether the reserve price is or public. Then we show that in the monotonous properties of the optimal policy, a greater number of items will be allocated if there are more items held or there are fewer horizons remaining. Finally, numerical results are given.