NONPARAMETRIC ESTIMATION OF ENTRY COST IN FIRST‐PRICE PROCUREMENT AUCTIONS

In this paper, I investigate Samuelson's low‐price auction model with entry costs. The model's equilibrium implies that the distribution of bids is truncated at the threshold for participation. I use the model to estimate the cost of participation in Michigan highway procurement auctions. The null hypothesis of zero entry costs is rejected. Using my empirical results, I then construct an estimate of the optimal auction, which employs regular policy tools such as entry fees. Finally, I demonstrate the savings that the Michigan government could have made on payments if optimal auctions had been employed. Copyright © 2012 John Wiley & Sons, Ltd.     

Behavioral mechanism design: evidence from the modified first-price auctions

This paper tests the behavioral equivalence of a class of strategically-equivalent mechanisms that also do not differ in terms of their procedures. In a private value setting, we introduce a family of mechanisms, so-called Mechanism (α), that generalizes the standard first-price sealed-bid auction. In Mechanism (α), buyers are asked to submit a value which will then be multiplied by α to calculate the bids in the auction. When α =?1, Mechanism (α) is the standard first-price sealed-bid auction. We show that for any α, calculated bids should be identical across mechanisms. We conduct a laboratory experiment to test the behavioral equivalence of this class of mechanisms under different values of α. Even though the procedure and environment do not change across auctions, we do not observe the same bidding behavior across these strategically-equivalent mechanisms. Our research can inform mechanism design literature with respect to the design of optimal mechanisms.     

Online reverse auctions and their role in buyer–supplier relationships

Despite the move in recent years towards supplier partnerships, buying firms need at times to make use of competitive procurement strategies for certain purchases. This study examines the impact of reverse auctions on buyer–supplier relationships through six case studies, analysing primarily the supplier perspective through participant interviews. The authors identify that there are potential benefits for both parties in a reverse auction, which can offer tendering and transactional cost advantages. For buyers, it offers a competitive procurement process. The effect on relationships will depend on the extent to which buyers employ the auction as a price weapon, or whether it is used primarily as a process improvement tool.     

The impact of reserve prices on the perceived bias of expert appraisals of fine art

We examine whether expert appraisals provided to bidders before major art auctions are unbiased indicators of value. Despite a strong grounding in theory, this aspect of optimal auction design has been frequently challenged in previous empirical research, particularly in the market for fine art. We adopt a valuation benchmark that incorporates sellers' reserve prices as well as high bids, and recognize censoring of works that fail to make reserve. Although the auction houses never divulge reserve prices, we exploit the fact that they can be observed indirectly via their impact on buy‐in rates. Using the set of French Impressionist paintings brought to auction from 1985 to 2001, we estimate the distribution of reserve prices, establish their link to a proper valuation benchmark, and isolate the selection bias due to bought‐in works on the perceived market value of fine art works. After controlling for the impact of reserve prices, and considering all works brought to auction, we find no evidence of bias in the experts' pre‐sale estimates. Copyright © 2010 John Wiley & Sons, Ltd.     

Non‐Neutral and Asymmetric Effects of Neutral Ratings: Evidence From eBay

Seller ratings help overcome adverse selection problems in online transactions between strangers. Using eBay data, we find that auction outcomes are sensitive toward not only positive and negative seller ratings but also neutral ratings. We find that (1) buyers utilize neutral ratings to sort among otherwise identical sellers and value their products and (2) contrary to eBay's opinion, depending on whether a seller is top‐notch or not, neutral ratings can be detrimental or beneficial; for sellers with higher proportions of positive ratings, an increase in neutral ratings decreases sales. For sellers with higher proportion of negative ratings, an increase in neutral ratings increases both sales and revenue. Copyright © 2014 John Wiley & Sons, Ltd.     

The equity implications of e‐commerce: A note

We develop a simple model with heterogeneous agents and search frictions to study how increases in matching intensity between buyers and retailers as a result of e‐commerce determine the level of income inequality among retailers. Our findings indicate that a reduction in search frictions leads to higher inequality and induces buyers to purchase goods and services only from specialized retailers.     

Information precision and asymptotic efficiency of industrial markets

I present a strategic model of a bilateral oligopoly with asymmetric information to examine (i) the validity of the conjecture of price-taking behavior in such markets as the number of agents becomes large and (ii) the effect of the rate that individual information precision decreases with increased number of agents on convergence to price-taking and efficiency. I show that with downstream competition, increasing the number of sellers may make all participants price-takers in the limit, but increasing the number of buyers may not. When the total precision of information in the market is high, price-taking and full social efficiency is achieved in the limit with large numbers of buyers and sellers. However, if the total precision of information in the market is poor, price-taking conjecture may fail and large inefficiencies, including full inefficiency, can occur in the limiting outcome. The rate of decrease of individual information precision with increased number of agents determines the rate of convergence to efficiency, and the convergence is slower than that predicted by single-unit auction models in the literature. I also demonstrate that when the number of sellers or both the number of buyers and the sellers go to infinity, price-taking and information aggregation tend to go together. When the number of buyers goes to infinity, however, information can get aggregated when the agents do not become price-takers in the limit. Albeit, in the latter case, the aggregated information is masked by the noise in the sellers’ signals and the cost variability.     

On the convergence of genetic learning in a double auction market

We study the learning behavior of a population of buyers and a population of sellers whose members are repeatedly randomly matched to engage in a sealed bid double auction. The agents are assumed to be boundedly rational and choose their strategies by imitating successful behavior and adding innovations triggered by random errors or communication with other agents. This process is modelled by a two-population genetic algorithm. A general characterization of the equilibria in mixed population distributions is given and it is shown analytically that only one price equilibria are attractive for the GA dynamics. Simulation results confirm these findings and imply that in cases with random initialization with high probability the gain of trade is equally split between buyers and sellers.     

Bidder collusion at first-price auctions

We show that in simple environments, a bidding ring operating at a first-price sealed-bid auction cannot achieve any gains relative to non-cooperative bidding if the ring is unable to control the bids that its members submit at the auction. This contrasts with results for the case in which the ring can control its members’ bids or prevent all but one of the ring members from participating in the auction. Numerical examples suggest that this result extends to some more complex environments. The analytic results use linear programming techniques that have potential applications to a number of other economic problems.     

Common-value auction versus posted-price selling: an agent-based model approach

Previous theoretical work has compared a private-value auction and posted-price market, and an affiliated-value auction and a posted-price market to determine the selling method preferred by sellers. Much less, however, is known about the seller’s preferred selling method when the buyers have a common value of the item. Our objective is to determine if a first-price auction or a posted-price market provides a seller with the larger expected revenue when buyers have a common value of the item being sold. An agent-based posted-price market and an agent-based first-price common-value auction with a reserve price are developed to compare these selling methods. Holding the buyers’ uncertainty about the value of the item constant, the seller prefers the posted-price market when the seller has no uncertainty about the item’s value. When the seller has an equal level of uncertainty as the buyers, the seller’s expected revenue for each market is similar. As the seller’s uncertainty increases beyond the level of the buyers’ uncertainty, the auction with a reserve price eventually becomes the preferred choice.     

Descending price multi-item auctions

We propose a simultaneous descending price auction mechanism to sell multiple heterogeneous items, each owned by a distinct seller, to a number of buyers. Each buyer has known private valuations on items, and wants at most one item. We show that if the sellers follow a descending price offer procedure and the buyers follow a greedy strategy for accepting the offers, the auction results in a nearly efficient allocation, and terminates close to a competitive equilibrium price vector. The descending price offer strategy of the sellers is close to a Nash equilibrium. However, we show that the buyers are better off waiting in our auction. There is a maximum limit (corresponding to the minimum competitive equilibrium price vector) till which they can wait without running into the risk of not winning any item. If the buyers wait within this limit, the prices can be brought arbitrarily close to a uniquely defined competitive equilibrium price vector.     

Anticipation of Auction Fever: Entry Decision,Reserve Price and the Choice of Auction Design

This paper analyzes the entry decision of rational bidders who expect to experience auction fever in English auctions. It shows that nonparticipation decision reduces seller's expected profit and this effect may outweigh the positive effect of the auction fever. We analyze the choice between English and second‐price sealed‐bid auctions and the optimal reserve price in English auctions. We show that it might be optimal for the seller to set a reserve price below her own valuation of the object. Finally, we show that the order in which bidders place their bids matters and the first bidder always has an advantage. Copyright © 2011 John Wiley & Sons, Ltd.     

Delegation in Multi‐Establishment Firms: Evidence from I.T. Purchasing

Recent contributions to a growing theory literature have focused on the tradeoff between adaptation and coordination in determining delegation within firms. Empirical evidence, however, is limited. Using establishment‐level data on decision rights over information technology investments, I find that a high net value of adaptation is strongly associated with delegation, as are local information advantages and firm‐wide diversification; in contrast, a high net value of within‐firm coordination is correlated with centralization. Variation across establishments within firms is widespread: most firms are neither fully centralized nor fully decentralized. Delegation patterns are largely consistent with standard team‐theory predictions; however, certain findings, such as a negative correlation between delegation and firm size, call for a consideration of agency costs as well.     

First price package auction with many traders

This paper studies a first price package auction in which multiple sellers participate in addition to multiple buyers. We generalize the notion of the profit-target strategy which is first introduced as a truthful strategy in a first price package auction with a single seller by Bernheim and Whinston (1986b). We then show that the set of equilibrium payoffs in profit-target strategies is equal to the bidder-optimal core, and is also equal to the set of coalition-proof Nash equilibria. Using this result, we find that any equilibrium payoff vector is weakly Pareto-dominated by the VCG payoff vector for buyers, and that the Walrasian competitive equilibrium payoff vector is weakly Pareto-dominated by some equilibrium payoff vector for buyers, even if goods are substitutes. This contrasts with the first price package auction with a single seller, in which it is shown that if goods are substitutes, then those three outcomes are payoff-equivalent.     

The Bargaining–sales‐delegation Game

This article revisits the managerial delegation literature led by Vickers ( 1985 ), Fershtman and Judd ( 1987 ) and Sklivas ( 1987 ) by introducing a bargaining mechanism between owners and managers over managerial contracts. It shows that the degree of bargaining interacts with the extent of product differentiation in determining whether the sub‐game perfect Nash equilibrium is sales delegation or profit maximisation. In contrast with the classical result, no sales delegation emerges and the typical prisoner's dilemma of the managerial delegation literature is solved. This holds in both contexts of Cournot and Bertrand rivalries. The article also provides results for the more general cases with heterogeneous managerial bargaining power and endogenous decisions of the owners regarding the bargaining power of the manager that should be or not be hired in a firm. Copyright © 2016 John Wiley & Sons, Ltd.     

Learning through Simultaneous Play: Evidence from Penny Auctions

This paper contributes to the emerging empirical literature on penny auctions, a particular type of all‐pay auctions. We focus on the potential learning effects that bidders may experience over time but also (and particularly) across auctions as a result of their auction participation. Using detailed bid‐level information, we find that, similarly to earlier literature, bidders suffer from a sunk cost fallacy, whereby their probability of dropping out of an auction is decreasing in the number of bids they have already placed in that auction. Although we do find that learning through repeated participation alleviates the sunk cost fallacy, participation in simultaneous penny auctions emerges as a much more effective learning mechanism, ultimately contributing toward bidders earning higher individual surpluses.     

Optimal decisions in foreign exchange bidding markets

I characterize optimal bidding decisions in bidding markets where each agent does not perceive she can significantly affect the market outcome. Using a foreign exchange bidding framework to provide a micro-foundation for the shape of a bidder's payoff function, I show that (1) in a discriminatory auction a bidder bids for a price that equals the value of the marginal product of her bid quantity, and (2) in a competitive auction a bidder bids for a price that equals the value of the average product of her bid quantity. An example illustrates the comparative properties of these solutions.     

Optimal allocation mechanisms with single-dimensional private information

We study revenue-maximizing allocation mechanisms for multiple heterogeneous objects when buyers care about the entire allocation, and not just about the ones they obtain. Buyers’ payoff depends on their cost parameter and, possibly, on their competitors’ costs. Costs are independently distributed across buyers, and both the buyers and the seller are risk-neutral. The formulation allows for complements, substitutes and externalities. We identify a number of novel characteristics of revenue-maximizing mechanisms: First, we find that revenue-maximizing reserve prices depend on the bids of other buyers. Second, we find that when non-participation payoffs are type-dependent, revenue-maximizing auctions may sell too often, or they may even be ex-post efficient.     

Fear of losing in a clock auction

We examine bidding behavior in a clock auction in which price is set by the lowest-accepted bid and provisional winners are reported each round (the LABpw auction). This format was used in the India 3G spectrum auction. In the standard theory, the auction performs poorly. In particular it yields lower revenues and is less efficient than the more standard clock auction with exit bids and highest-rejected-bid pricing (the HRB auction). However, the LABpw auction performs well in the lab, achieving higher revenues than the HRB auction. We show how fear of losing provides one motivation for the overbidding that causes higher revenues in the LABpw auction.