Two rules of a sealed ceiling bid and their analysis by mathematical programming techniques

DOI10.1016/J.CAMWA.2005.10.019MaRDI QIDQ2477237zbMATH OpenOpenAlexFDO

Authors A. S. Belen'kij

Publication date 13 March 2008

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.camwa.2005.10.019

zbMATH Keywords

linear programmingminimax problemsnonlinear programmingpolyhedral setssealed ceiling bids

Mathematics Subject Classification ID

Nonlinear programming (90C30) Auctions, bargaining, bidding and selling, and other market models (91B26)

Recommendations

• A competitive-bidding strategy
• A model of rational competitive bidding
• Simple probability models for project contracting
• Optimal constrained bidding
• On the regulation of procurement bids

Cites work

• A 2-person game on a polyhedral set of connected strategies
• A noncooperative game on polyhedral sets
• A Theory of Auctions and Competitive Bidding
• scientific article; zbMATH DE number 3793774 (Why is no real title available?)
• scientific article; zbMATH DE number 3356467 (Why is no real title available?)

Cited in

(2)

• Simple probability models for project contracting
• A competitive-bidding strategy

This page was built for publication: Two rules of a sealed ceiling bid and their analysis by mathematical programming techniques

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2477237)