Semi-Markov dynamic programming approach to competitive bidding with state space reduction considerations (Q1093524): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A Computational Algorithm for Multi-Contract Bidding Under Constraints / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Stochastic Model for Bidding / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5588251 / rank | |||
Normal rank | |||
Latest revision as of 11:57, 18 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Semi-Markov dynamic programming approach to competitive bidding with state space reduction considerations |
scientific article |
Statements
Semi-Markov dynamic programming approach to competitive bidding with state space reduction considerations (English)
0 references
1987
0 references
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.
0 references
infinite horizon sum-Markov dynamic programming
0 references
optimal bidding strategy
0 references
multiple limited resources
0 references
oligopolistic market
0 references
