Tragedy of the common canal

This paper uses laboratory experiments to investigate the effects of alternative solutions to a common-pool resource with a unidirectional flow. The focus is on the comparative economic efficiency of communications, bilateral “Coasian” bargaining, auctions and price-based allocations. All treatments improve allocative efficiency relative to a baseline environment. Communication and bilateral bargaining are not generally as effective as market allocations. An exogenously imposed, optimal fee results in the greatest efficiency gain, followed by auction allocations that determine the usage fee endogenously.externalities, experiments, auctions, Coasian bargaining, common pool resource

Bundling Equilibrium in Combinatorial auctions

This paper analyzes individually-rational ex post equilibrium in the VC (Vickrey-Clarke) combinatorial auctions. If $\Sigma$ is a family of bundles of goods, the organizer may restrict the participants by requiring them to submit their bids only for bundles in $\Sigma$. The $\Sigma$-VC combinatorial auctions (multi-good auctions) obtained in this way are known to be individually-rational truth-telling mechanisms. In contrast, this paper deals with non-restricted VC auctions, in which the buyers restrict themselves to bids on bundles in $\Sigma$, because it is rational for them to do so. That is, it may be that when the buyers report their valuation of the bundles in $\Sigma$, they are in an equilibrium. We fully characterize those $\Sigma$ that induce individually rational equilibrium in every VC auction, and we refer to the associated equilibrium as a bundling equilibrium. The number of bundles in $\Sigma$ represents the communication complexity of the equilibrium. A special case of bundling equilibrium is partition-based equilibrium, in which $\Sigma$ is a field, that is, it is generated by a partition. We analyze the tradeoff between communication complexity and economic efficiency of bundling equilibrium, focusing in particular on partition-based equilibrium

Collusion through communication in auctions

We study the extent to which communication can serve as a collusion device in one-shot first- and second-price sealed-bid auctions. In an array of laboratory experiments we vary the amount of interactions (communication and/or transfers without commitment) available to bidders. We find that communication alone leads to statistically significant but limited price drops. When, in addition, bidders can exchange transfers, revenues decline substantially, with over 70% of our experimental auctions culminating in the object being sold for approximately the minimal price. Furthermore, the effects of communication and transfers are similar across auction formats. We contrast these results with those generated in repeated auctions. By and large, repeated auctions yield lower collusion and lower efficiency levels

Collusion through communication in auctions

We study the extent to which communication can serve as a collusion device in one-shot first- and second-price sealed-bid auctions. In an array of laboratory experiments we vary the amount of interactions (communication and/or transfers without commitment) available to bidders. We find that communication alone leads to statistically significant but limited price drops. When, in addition, bidders can exchange transfers, revenues decline substantially, with over 70% of our experimental auctions culminating in the object being sold for approximately the minimal price. Furthermore, the effects of communication and transfers are similar across auction formats. We contrast these results with those generated in repeated auctions. By and large, repeated auctions yield lower collusion and lower efficiency levels

Auctions with Severely Bounded Communication

We study auctions with severe bounds on the communication allowed: each bidder may only transmit t bits of information to the auctioneer. We consider both welfare- and profit-maximizing auctions under this communication restriction. For both measures, we determine the optimal auction and show that the loss incurred relative to unconstrained auctions is mild. We prove non-surprising properties of these kinds of auctions, e.g., that in optimal mechanisms bidders simply report the interval in which their valuation lies in, as well as some surprising properties, e.g., that asymmetric auctions are better than symmetric ones and that multi-round auctions reduce the communication complexity only by a linear factor

Evaluating eREVERSE auctions (EeRA): A research note

This eGISE network paper seeks to evaluate issues relating to the implementation of electronic reverse auctions (eRA) within local government procurement processes. The adoption of an eRA invites pre-qualified suppliers to compete with each other for a specified good or service. Consequently, there is a unique opportunity for the buyer to receive a reduced cost through the successful bidder. However, the literature identifies a number of adverse effects within these arrangements depending upon the nature of the buyer/supplier relationship. The objectives of the research involves identifying a set of business scenarios to demonstrate the impact of different eRA strategies in this respect. This will be achieved through a structured case analysis approach to enable qualitative data to be modelled through a visual toolset simulation. It is believed the outcome of the investigation will provide valuable insights into the complexities associated with the eProcurement process