Simultaneous Bidding with a Fixed Charge if Any Bid is Successful
Stephen A. Smith, Michael H. Rothkopf
Abstract
Stephen A. Smith, Michael H. Rothkopf
Abstract
We consider the situation in which a bidder faces a group of simultaneous auctions that carry a single fixed charge, which is incurred if and only if one or more of the auctions are won. In a decision theoretic framework, we analyze the bidder's optimal strategy for three alternative formulations of the problem. If the bidder's only decision is selecting the auctions in which to bid, a simple decision rule is derived that holds regardless of the probabilities of winning. We also obtain necessary conditions for selecting the optimal bid levels. Finally, we present a single state variable dynamic programming formulation for obtaining the optimal amounts to bid in statistically independent auctions.
OpenAlex reports 6 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
We consider the situation in which a bidder faces a group of simultaneous auctions that carry a single fixed charge, which is incurred if and only if one or more of the auctions are won. In a decision theoretic framework, we analyze the bidder's optimal strategy for three alternative formulations of the problem. If the bidder's only decision is selecting the auctions in which to bid, a simple decision rule is derived that holds regardless of the probabilities of winning. We also obtain necessary conditions for selecting the optimal bid levels. Finally, we present a single state variable dynamic programming formulation for obtaining the optimal amounts to bid in statistically independent auctions.
Key concepts: Common value auction, Bidding, Unique bid auction, Variable (mathematics), Mathematical optimization, Dynamic programming, Computer science, Simple (philosophy)