Market clearing sealed-bid auctions for non-identical objects with single-unit demands

We consider a version of the cooperative buyer-seller market game of Shapley and Shubik (1972). For this market we propose a c1ass of sealed- bid auctions where objects are sold simultaneously at a market c1earing price rule. We ana1yze the strategic games induced by these mechanisms under the complete information approach. We show that these noncooperative games can be regarded as a competitive process for achieving a cooperative outcome: every Nash equilibrium payoff is a core outcome of the cooperative market game. Precise answers can be given to the strategic questions raised.

Elicited bid functions in (a)symmetric first-price auctions

We report on a series of experiments that examine bidding behavior in first-price sealed bid auctions with symmetric and asymmetric bidders. To study the extent of strategic behavior, we use an experimental design that elicits bidders' complete bid functions in each round (auction) of the experiment. In the aggregate, behavior is consistent with the basic equilibrium predictions for risk neutral or homogenous risk averse bidders (extent of bid shading, average seller's revenues and deviations from equilibrium). However, when we look at the extent of best reply behavior and the shape of bid functions, we find that individual behavior is not in line with the received equilibrium models, although it exhibits strategic sophistication.

A decision- theoretic model for M&A sale processes

A Work Project, presented as part of the requirements for the Award of a Masters Double Degree in Economics and International Business from the NOVA – School of Business and Economics and Insper Instituto de Ensino e Pesquisa

Uma análise dos leilões de partilha de produção do pré-sal através de simulação computacional

O presente trabalho consiste na aplicação da simulação computacional como método de aprofundamento do estudo de mecanismos de leilões aplicados na alocação do direito de exploração das reservas de petróleo da camada do pré-sal. A camada do pré-sal está localizada na costa brasileira e apresenta um grande potencial em termos de reserva de óleo e gás. A função lance aplicada para os participantes criados computacionalmente foi estimada com base em dados experimentais e segue uma função exponencial. A simulação possibilita reproduzir o modelo de leilão considerando todas as características e parâmetros dos experimentos sem incorrer no custo da realização de novas sessões de leilão com participantes reais. Os leilões estudados foram o leilão de valores privados de 1° preço e o leilão de valores privados de 2° preço. Através dos resultados obtidos identificou-se que o leilão de valores privados de 1° preço é menos arriscado que o leilão de valores privados de 2° preço; no leilão com simetria, o Princípio de Equivalência de Receita é válido; a eficiência observada é menor em leilões assimétricos; o leilão de 2° preço comparado com o de 1° preço apresenta um tradeoff entre a eficiência e a receita do governo; e que considerando o aprendizado dos participantes, não se observam alterações significativas nas estatísticas analisadas à medida que os participantes se tornam mais experientes.

Nonparametric Identication and Structural Estimation of Auction Models

Thesis (Ph.D.)--University of Washington, 2016-06

Provable Security for Cryptocurrencies

The past several years have seen the surprising and rapid rise of Bitcoin and other “cryptocurrencies.” These are decentralized peer-to-peer networks that allow users to transmit money, tocompose financial instruments, and to enforce contracts between mutually distrusting peers, andthat show great promise as a foundation for financial infrastructure that is more robust, efficientand equitable than ours today. However, it is difficult to reason about the security of cryptocurrencies. Bitcoin is a complex system, comprising many intricate and subtly-interacting protocol layers. At each layer it features design innovations that (prior to our work) have not undergone any rigorous analysis. Compounding the challenge, Bitcoin is but one of hundreds of competing cryptocurrencies in an ecosystem that is constantly evolving. The goal of this thesis is to formally reason about the security of cryptocurrencies, reining in their complexity, and providing well-defined and justified statements of their guarantees. We provide a formal specification and construction for each layer of an abstract cryptocurrency protocol, and prove that our constructions satisfy their specifications. The contributions of this thesis are centered around two new abstractions: “scratch-off puzzles,” and the “blockchain functionality” model. Scratch-off puzzles are a generalization of the Bitcoin “mining” algorithm, its most iconic and novel design feature. We show how to provide secure upgrades to a cryptocurrency by instantiating the protocol with alternative puzzle schemes. We construct secure puzzles that address important and well-known challenges facing Bitcoin today, including wasted energy and dangerous coalitions. The blockchain functionality is a general-purpose model of a cryptocurrency rooted in the “Universal Composability” cryptography theory. We use this model to express a wide range of applications, including transparent “smart contracts” (like those featured in Bitcoin and Ethereum), and also privacy-preserving applications like sealed-bid auctions. We also construct a new protocol compiler, called Hawk, which translates user-provided specifications into privacy-preserving protocols based on zero-knowledge proofs.

Simultaneous pooled auctions

Suppose a seller wants to sell k similar or identical objects and there are n > k potential buyers. Suppose that each buyer wants only one object. In this case, we suggest the use of a simultaneous auction that would work as follows. Players are asked to submit sealed bids for one object. The individual with the highest bid chooses an object first; the individual with the second-highest bid chooses the next object; and this process continues until the individual with the kth highest bid receives the last object. Each individual pays the equivalent to his or her bid. When objects are identical, we show that the proposed auction generates the same revenue as a first-price sealed-bid sequential auction. When objects are perfectly correlated, there is no known solution for sequential auctions, whereas we can characterize bidding strategies in the proposed auction. Moreover, the proposed auction is optimal (given an appropriately chosen reserve price), and it may be easier and cheaper to run than a sequential auction.

Hybrid Auctions II: Experimental Evidence

In this paper we report the results of an experiment designed to examine the properties of a hybrid auction - a Dutch-Vickrey auction, that combines a sealed bid …rst-price auction with a sealed bid second-price auction. This auction mechanism shares some important features with that used in the sale of the companies constituted through the partial division of the Telebras System - the government-owned Telecom holding in Brazil. We designed an experiment where individuals participate in a sequence of independent …rst-price auctions followed by a sequence of hybrid auctions. Several conclusions emerged from this experimental study. First, ex-post e¢ciency was achieved overwhelmingly by the hybrid auctions. Secondly, although overbidding (with respect to the risk-neutral Bayesian Nash equilibrium) was a regular feature of participants’ bidding behavior in the …rst-price auctions — as it is commonly reported in most experimental studies of …rst-price auctions, it was less frequent in the hybrid auctions. By calibrating the results to allow for risk-averse behavior we were able to account for a signi…cant part of the overbidding. Finally, we compared the revenue generated by the hybrid auction with that generated by a standard …rst-price sealed bid auction and the results were ambiguous.

Hybrid Auctions I: Theory

In this paper we examine the properties of a hybrid auction that combines a sealed bid and an ascending auction. In this auction, each bidder submits a sealed bid. Once the highest bid is known, the bidder who submitted it is declared the winner if her bid is higher than the second highest by more than a predetermined amount or percentage. If at least one more bidder submitted a bid su¢ciently close to the highest bid (that is, if the di¤erence between this bid and the highest bid is smaller than the predetermined amount or percentage) the quali…ed buyers compete in an open ascending auction that has the highest bid of the …rst stage as the reserve price. Quali…ed bidders include not only the highest bidder in the …rst stage but also those who bid close enough to her. We show that this auction generates more revenue than a standard auction. Although this hybrid auction does not generate as much revenue as the optimal auction, it is ex-post e¢cient.

An Experimental Study of Complex-Offer Auctions: Payment Cost Minimization vs. Offer Cost Minimization

A Payment Cost Minimization (PCM) auction has been proposed as an alternative to the Offer Cost Minimization (OCM) auction to be used in wholesale electric power markets with the intention to lower the procurement cost of electricity. Efficiency concerns about this proposal have relied on the assumption of true production cost revelation. Using an experimental approach, I compare the two auctions, strictly controlling for the level of unilateral market power. A specific feature of these complex-offer auctions is that the sellers submit not only the quantities and the minimum prices at which they are willing to sell, but also the start-up fees that are designed to reimburse the fixed start-up costs of the generation plants. I find that both auctions result in start-up fees that are significantly higher than the start-up costs. Overall, the two auctions perform similarly in terms of procurement cost and efficiency. Surprisingly, I do not find a substantial difference between less market power and more market power designs. Both designs result in similar inefficiencies and equally higher procurement costs over the competitive prediction. The PCM auction tends to have lower price volatility than the OCM auction when the market power is minimal but this property vanishes in the designs with market power. These findings lead me to conclude that both the PCM and the OCM auctions do not belong to the class of truth revealing mechanisms and do not easily elicit competitive behavior.

Simple-Offer vs. Complex-Offer Auctions in Deregulated Electricity Markets

In my recent experimental research of wholesale electricity auctions, I discovered that the complex structure of the offers leaves a lot of room for strategic behavior, which consequently leads to anti- competitive and inefficient outcomes in the market. A specific feature of these complex-offer auctions is that the sellers submit not only the quantities and the minimum prices at which they are willing to sell, but also the start-up fees that are designed to reimburse the fixed start-up costs of the generation plants. In this paper, using the experimental method I compare the performance of two complex-offer auctions (COAs) against the performance of a simple-offer auction (SOA), in which the sellers have to recover all their generation costs --- fixed and variable ---through a uniform market-clearing price. I find that the SOA significantly reduces consumer prices and lowers price volatility. It mitigates anti-competitive effects that are present in the COAs and achieves allocative efficiency more quickly.

Hybrid auctions

In this paper we analyze a hybrid auction that combines a first-price and a Vickrey auction. We show that this auction may generate more expected revenue than a standard first-price auction. (C) 2002 Elsevier Science B.V. All rights reserved.

The Complete Information First. Price Auction or the Importance of Being Indivisible

Abstract Despite the popularity of auction theoretical thinking, it appears that no one has presented an elementary equilibrium analysis of the first-price sealed-bid auction mechanism under complete information. This paper aims to remedy that omission. We show that the existence of pure strategy undominated Nash equilibria requires that the bidding space is not "too divisible" (that is, a continuum). In fact, when bids must form part of a finite grid there always exists a "high price equilibrium". However, there might also be "low price equilibria" and when the bidding space is very restrictive the revenue obtained in these "low price equilibria" might be very low. We discuss the properties of the equilibria and an application of auction theoretical thinking in which "low price equilibria" may be relevant. Keywords: First-price auctions, undominated Nash equilibria. JEL Classification Numbers: C72 (Noncooperative Games), D44 (Auctions).

What really matters in auction design

The most important issues in auction design are the traditional concerns of competition policy preventing collusive, predatory, and entry-deterring behaviour. Ascending and uniform-price auctions are particularly vulnerable to these problems, and the Anglo-Dutch auction a hybrid of the sealed-bid and ascending auctions may often perform better. Effective anti-trust policy is also critical. However, everything depends on the details of the context; the circum- stances of the recent U.K. mobile-phone license auction made an ascending format ideal, but this author (and others) correctly predicted the same for- mat would fail in the Netherlands and elsewhere. Auction design is not one size Þts all . We also discuss the 3G spectrum auctions in Germany, Italy, Austria and Switzerland, and football TV-rights, TV franchise and other radiospectrum auctions, electricity markets, and takeover battles.

A JOINT EXPERIMENTAL ANALYSIS OF INVESTOR BEHAVIOR IN IPO PRICING METHODS

This article jointly examines the differences of laboratory versions of the Dutch clock open auction, a sealed-bid auction to represent book building, and a two-stage sealed bid auction to proxy for the “competitive IPO”, a recent innovation used in a few European equity initial public offerings. We investigate pricing, seller allocation, and buyer welfare allocation efficiency and conclude that the book building emulation seems to be as price efficient as the Dutch auction, even after investor learning, whereas the competitive IPO is not price efficient, regardless of learning. The competitive IPO is the most seller allocative efficient method because it maximizes offer proceeds. The Dutch auction emerges as the most buyer welfare allocative efficient method. Underwriters are probably seeking pricing efficiency rather than seller or buyer welfare allocative efficiency and their discretionary pricing and allocation must be important since book building is prominent worldwide.