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

DOI10.1016/j.camwa.2005.10.019zbMath1137.90667OpenAlexW1996557486MaRDI QIDQ2477237

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 programmingnonlinear programmingminimax problemspolyhedral setssealed ceiling bids

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• A 2-person game on a polyhedral set of connected strategies
• A noncooperative game on polyhedral sets
• A Theory of Auctions and Competitive Bidding

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