Bidding Strategy: Winning over Key Competitors

Abstract

This paper presents a method by which the probability of winning in the competitive bidding problem can be improved by obtaining additional information concerning a key competitor. The competitive bidding problem as suggested by Friedman consists of describing the bidding behavior of each competitor by developing a probability density function representing the distribution of the ratio of a competitor's bid to “our” cost estimate. This static distribution for a key competitor is improved by maintaining a volume‐time function on competitor k. A function relating the markup of competitor k's static distribution function, thereby improving the calculation for the probability of winning over (defeating) competitor k. Equations for combining the probability of winning over competitor k with the probability of winning over other competitors is also presented.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 44 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.