234
Views
10
CrossRef citations to date
0
Altmetric
Original Articles

An assessment of four popular auction mechanisms in the siting of NIMBY facilities: some experimental evidence

&
Pages 841-852 | Published online: 11 Apr 2011
 

Abstract

The issue of locating locally unfriendly but socially beneficial facilities such as landfills and power stations is an important public policy concern in many countries. Local residents in the area where such facilities are to be located tend to exhibit strong opposition, no doubt due to the asymmetric distribution of the costs and benefits of such not-in-my-backyard (NIMBY) facilities. A potentially useful mechanism for the siting of such facilities is by compensation auctions, which attempt to incorporate the market mechanism into the decision making process. In such auctions, communities name the compensation they require to host such facilities, and the community demanding the least amount of compensation gets to host the facility. This research attempts to evaluate the performance of such compensation auctions using laboratory exepriments. Four popular auction formats are evaluated: first- and second-price and all-pay first-and second-price sealed-bid auctions. The latter two formats correspond to the compensation auctions with penalty payments proposed by Kunreuther and Kleindorfer (Citation1986) and Quah and Tan (Citation1998), who claim that these auctions are more efficient as they restrains strategic (or over) bidding. Our results, however, contradict this claim. We show that the first-and second-price auctions without penalty payments are in fact more efficient, in that they tend to minimize social costs, and truthful bidding is more likely.

Acknowledgement

We thank James Ang for his very able research assistance, and Alvin Eng, Lee Wei-Bing and Lee Weilin for their help in conducting the experiments. Research funding from the National University of Singapore is gratefully acknowledged.

Notes

1 Subjects in the all-pay auction formats took significantly longer to submit their bids, as a result fewer rounds were completed within the alloted time.

2 For details, see Appendix A which lists the complete instructions for the second-price auction.

3 Ties were broken randomly by the program using a random number generator.

4 Both outliers came from the same player, bidder number 6 in rounds 9 and 11 in Session 4. His costs in these rounds were e$1297 and e$1294. Frustrated by the high costs assigned to him, he put in bids of e$1600 and e$12940, respectively.

5 With the exception of one outlier in session 4, round 13, where Bidder 6 submitted a bid of 1 when his cost is very low, all the other five outliers involve extremely high bids when the bidders’ costs were high.

6 The test statistic follows a Chi-square distribution with 2 degrees of freedom.

7 The classic correction for heteroscedasticity is the HC0 estimator proposed by White (Citation1980). MacKinnon and White (Citation1985) discussed three improvements, HC1, HC2 and HC3. Long and Ervin (Citation2000), in a comprehensive evaluation, conclude that HC3 is the best among all HC estimators they evaluated.

8 The robust SEs also provide a remedy for any potential nonnormality problem of the error terms, since normality assumption is required only for hypothesis testing. The robust SE estimates thus ensures that the t-tests we perform below using the SE are valid.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.