| Abstract |
[Truncated abstract] Procurement of environmental services from private landholders is one of the main mechanisms of present-day environmental policies. In 1986, under its Conservation Reserve Program (CRP), the US Department of Agriculture (USDA) pioneered the use of auctions to pay landholders to provide environmental services. The auctions offered significant advantages in terms of efficiency and cost minimization by revealing private information on opportunity costs and the biodiversity resources held by landholders (Shoemaker 1988). Auctions are now used in the European Union and Australia as part of conservation programs. Almost all of the conservation auctions have targeted multiple environmental services. Typically, environmental indices (EIs) are used to combine the benefits of multiple projects into an overall environmental benefit score in the selection of successful projects. However, auctions relying on the reduction of all benefits to a simple summary measure are not necessarily the best way to offer incentives. In particular, higher flexibility and efficiency can be achieved by allowing bidders to offer different combinations of conservation benefits or practices in auctions. In this regard, combinatorial auctions allow bidders to express their preferences for combination of projects and are an attractive alternative. In combinatorial auctions, bidders can submit bids on individual items as well as on bundles of items, thus taking advantage of the cost complementarities in their valuations of bundles. Moreover, landholders are likely to be able to vary the level of services for individual targets. Therefore, technically, these types of auctions are multiple unit combinatorial auctions. |
|
However, the number of bundles or packages that a bidder can explore in these auctions may be large making bid selection and pricing too complex for the bidder. Therefore, these auctions are often run as iterative auctions involving a series of rounds that progressively lead to a final allocation. A key element in each round is the provision of price feedback to guide bidders in subsequent rounds. Item pricing feedback schemes have been widely researched for combinatorial auctions on unique items (where packages consist of one or more unique items but not multiple amounts of any item). Although item price schemes have performed reasonably well in a variety of auction markets, they have not yet been thoroughly tested for multiple unit combinatorial auctions. In this thesis, we extend several notable item price feedback algorithms to the case of multiple unit combinatorial auctions for use in conservation auctions. These includes: 1) the Resource Allocation Designs (RAD LP and RAD NLP) which was first proposed by DeMartini et al. (1999); 2) Smoothed Anchoring scheme, which has been explored by the US Federal Communications Commission (FCC) (Hoffman 2006); 3) the Nucleolus based algorithms (Nuc and ConsNuc) of Dunford et al. (2007), and 4) the DEA based algorithm proposed by Aparicio et al. (2008)... |
