Abstract

Research on bidder collusion in procurement auctions is reasonably successful in unveiling the mechanisms of collusion among the bidders. But it is relatively weak in forwarding effective practical methods of collusion detection before the winner is declared, because they presuppose the knowledge of collusion in specific auctions. Past studies, however, point out the need for working with bid price-to-reserve price ratios rather than bid prices or winning bid prices, to be free from the problem of heteroscedasticity. They also draw an important inference that the set of collusive data are significantly different from the set of competitive data. On the basis of these basic facts, the current paper outlines a seven-step approach to collusion detection. The approach makes rudimentary statistical analysis of bid price-to-reserve price ratios for all the bidders. The analysis comprises tests of equality of means, medians and variance and tests of skewness, autocorrelation and normality of the ratios. It divides the ratios into two significantly different clusters. The cluster with the higher mean and variance values of the ratios corresponds to collusive bidding with the other cluster corresponding to competitive bidding. The paper proposes the construction of a process control chart to detect occurrence of collusion in an auction immediately after the price bids are opened. The approach is illustrated by applying it to data from procurement auctions for construction projects in a State Department of the Republic of India.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.