kmth price sealed-bid auctions with general independent values and equilibrium linear mark-ups

A generalised bidding model is developed to calculate a bidder’s expected profit and auctioners expected revenue/payment for both a General Independent Value and Independent Private Value (IPV) kmth price sealed-bid auction (where the mth bidder wins at the kth bid payment) using a linear (affine) mark-up function. The Common Value (CV) assumption, and highbid and lowbid symmetric and asymmetric First Price Auctions and Second Price Auctions are included as special cases. The optimal n bidder symmetric analytical results are then provided for the uniform IPV and CV models in equilibrium. Final comments concern implications, the assumptions involved and prospects for further research.

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.

A Multiplicative Homomorphic Sealed-Bid Auction-Based on Goldwasser-Micali Encryption

Instead of the costly encryption algorithms traditionally employed in auction schemes, efficient Goldwasser-Micali encryption is used to design a new sealed-bid auction. Multiplicative homomorphism instead of the traditional additive homomorphism is exploited to achieve security and high efficiency in the auction. The new scheme is the currently known most efficient non-interactive sealed-bid auction with bid privacy.

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.

Strategic Information Acquisition: Applications to Herding and Auctions

The information that the economic agents have and regard relevant to their decision making is often assumed to be exogenous in economics. It is assumed that the agents either poses or can observe the payoff relevant information without having to exert any effort to acquire it. In this thesis we relax the assumption of ex-ante fixed information structure and study what happens to the equilibrium behavior when the agents must also decide what information to acquire and when to acquire it. This thesis addresses this question in the two essays on herding and two essays on auction theory. In the first two essays, that are joint work with Klaus Kultti, we study herding models where it is costly to acquire information on the actions that the preceding agents have taken. In our model the agents have to decide both the action that they take and additionally the information that they want to acquire by observing their predecessors. We characterize the equilibrium behavior when the decision to observe preceding agents' actions is endogenous and show how the equilibrium outcome may differ from the standard model, where all preceding agents actions are assumed to be observable. In the latter part of this thesis we study two dynamic auctions: the English and the Dutch auction. We consider a situation where bidder(s) are uninformed about their valuations for the object that is put up for sale and they may acquire this information for a small cost at any point during the auction. We study the case of independent private valuations. In the third essay of the thesis we characterize the equilibrium behavior in an English auction when there are informed and uninformed bidders. We show that the informed bidder may jump bid and signal to the uninformed that he has a high valuation, thus deterring the uninformed from acquiring information and staying in the auction. The uninformed optimally acquires information once the price has passed a particular threshold and the informed has not signalled that his valuation is high. In addition, we provide an example of an information structure where the informed bidder initially waits and then makes multiple jumps. In the fourth essay of this thesis we study the Dutch auction. We consider two cases where all bidders are all initially uninformed. In the first case the information acquisition cost is the same across all bidders and in the second also the cost of information acquisition is independently distributed and private information to the bidders. We characterize a mixed strategy equilibrium in the first and a pure strategy equilibrium in the second case. In addition we provide a conjecture of an equilibrium in an asymmetric situation where there is one informed and one uninformed bidder. We compare the revenues that the first price auction and the Dutch auction generate and we find that under some circumstances the Dutch auction outperforms the first price sealed bid auction. The usual first price sealed bid auction and the Dutch auction are strategically equivalent. However, this equivalence breaks down in case information is acquired during the 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.