Applied Mathematics

Volume 2, Issue 10 (October 2011)

ISSN Print: 2152-7385   ISSN Online: 2152-7393

Google-based Impact Factor: 0.58  Citations  

Joint Bidding under Capacity Constraints

HTML  Download Download as PDF (Size: 176KB)  PP. 1279-1291  
DOI: 10.4236/am.2011.210178    6,198 Downloads   9,556 Views  

Affiliation(s)

.

ABSTRACT

In this paper we analyze the anticompetitive effects of concentration of ownership in auction markets. We compare two different auction formats with uniform price. In the first, the price equals the highest accepted bid, whereas in the second the price equals the lowest rejected bid. For the former, and for a two-unit, two-plants, two-firms model, we find an equilibrium where all plants (all firms) bid according to a common bidding function. The concentration of the ownership has the same effect on the bidding behavior as eliminating one plant. However, the expected price is lower than the one expected in such three independent plant scenario. More surprisingly (and special to this 2 × 2 × 2 case), the equilibrium is efficient. In the latter, alternative auction format, firms bids asymmetrically for its two plants. Hence, the equilibrium is inefficient. Also, with this format, we show that the market price may be arbitrarily large. Thus, and contrary to some plausible expectation base in received auction theory, a (sealed-bid) auction format in which the price for a bidder is unrelated to his bid becomes less efficient than one in which the price may coincide with that bidder’s bid, when one admits that several bidders may coordinate (through ownership) their bids. The results add to a literature that favors more winner’s-bid pricing rules.

Share and Cite:

B. De Otto-López, "Joint Bidding under Capacity Constraints," Applied Mathematics, Vol. 2 No. 10, 2011, pp. 1279-1291. doi: 10.4236/am.2011.210178.

Cited by

No relevant information.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.