Auctions with options for re-auction

We examine the role of seller bidding and reserve prices in an infinitely repeated independent-private-value (IPV) ascending-price auction. The seller has a single object that she values at zero. At the end of any auction round, she may either sell to the highest bidder or pass-in the object and hold a new auction next period. New bidders are drawn randomly in each round. The ability to re-auction motivates a notion of reserve price as the option value of retaining the object for re-auctioning. Even in the absence of a mechanism with which to commit to a reserve price, the optimal “secret” reserve is shown to exceed zero. However, despite the infinite repetition, there may be significant value to the seller from a binding reserve price commitment: the optimal binding reserve is higher than the optimal “secret” reserve, and may be substantially so, even with very patient players. Furthermore, reserve price commitments may even be socially preferable at high discount factors. We also show that the optimal “phantom” bidding strategy for the seller is revenue-equivalent to a commitment to an optimal public reserve price.

Trust and Reputation in Internet Auctions

Exchange between anonymous actors in Internet auctions corresponds to a one-shot prisoner's dilemma-like situation. Therefore, in any given auction the risk is high that seller and buyer will cheat and, as a consequence, that the market will collapse. However, mutual cooperation can be attained by the simple and very efficient institution of a public rating system. By this system, sellers have incentives to invest in reputation in order to enhance future chances of business. Using data from about 200 auctions of mobile phones we empirically explore the effects of the reputation system. In general, the analysis of nonobtrusive data from auctions may help to gain a deeper understanding of basic social processes of exchange, reputation, trust, and cooperation, and of the impact of institutions on the efficiency of markets. In this study we report empirical estimates of effects of reputation on characteristics of transactions such as the probability of a successful deal, the mode of payment, and the selling price (highest bid). In particular, we try to answer the question whether sellers receive a "premium" for reputation. Our results show that buyers are willing to pay higher prices for reputation in order to diminish the risk of exploitation. On the other hand, sellers protect themselves from cheating buyers by the choice of an appropriate payment mode. Therefore, despite the risk of mutual opportunistic behavior, simple institutional settings lead to cooperation, relatively rare events of fraud, and efficient markets.

The implications of internet auctions for small to medium sized enterprises (SMEs) in Great Britain

DUE TO COPYRIGHT RESTRICTIONS ONLY AVAILABLE FOR CONSULTATION AT ASTON UNIVERSITY LIBRARY AND INFORMATION SERVICES WITH PRIOR ARRANGEMENT

Temporary and Permanent Buyout Prices in Online Auctions

Increasingly used in online auctions, buyout prices allow bidders to instantly purchase the item listed. We distinguish two types: a temporary buyout option disappears if a bid above the reserve price is made; a permanent one remains throughout the auction or until it is exercised. In a model featuring time-sensitive bidders with uniform valuations and Poisson arrivals but endogenous bidding times, we focus on finding temporary and permanent buyout prices maximizing the seller's discounted revenue, and examine the relative benefit of using each type of option in various environments. We characterize equilibrium bidder strategies in both cases and then solve the problem of maximizing seller's utility by simulation. Our numerical experiments suggest that buyout options may significantly increase a seller’s revenue. Additionally, while a temporary buyout option promotes early bidding, a permanent option gives an incentive to the bidders to bid late, thus leading to concentrated bids near the end of the auction.

A winner determination algorithm for multi-unit combinatorial auctions with reserve prices

Combinatorial auction mechanisms have been used in many applications such as resource and task allocation, planning and time scheduling in multi-agent systems, in which the items to be allocated are complementary or substitutable. The winner determination in combinatorial auction itself is a NP-complete problem, and has attracted many attentions of researchers world wide. Some outstanding achievements have been made including CPLEX and CABOB algorithms on this topic. To our knowledge, the research into multi-unit combinatorial auctions with reserve prices considered is more or less ignored. To this end, we present a new algorithm for multi-unit combinatorial auctions with reserve prices, which is based on Sandholm's work. An efficient heuristic function is developed for the new algorithm. Experiments have been conducted. The experimental results show that auctioneer agent can find the optimal solution efficiently for a reasonable problem scale with our algorithm.

Leilões eletrônicos reversos multiatributo : uma abordagem de decisão multicritério como instrumento de agregação de valor aos processos de compras do setor público brasileiro

Leilões são instituições seculares utilizadas nas relações comerciais entre indivíduos e organizações. Provêem maior flexibilidade aos processos de determinação de preços e alocação de bens, aumentando o espaço para negociações entre compradores e vendedores. Na Internet, têm sido empregados, de maneira crescente, em atividades de comércio eletrônico B2B e G2B, em sua maioria, através da modalidade de leilão reverso. No entanto, seu aspecto unidimensional reduz as negociações à variável preço, produzindo, muitas vezes, resultados aquém do desejado. No caso brasileiro, o Governo Federal instituiu o Portal Comprasnet, através do qual, as organizações públicas adquirem bens e serviços de fornecedores cadastrados. Dentre as modalidades de licitação disponíveis, destaca-se o Pregão Eletrônico, um mecanismo de leilão eletrônico reverso baseado no atributo preço, através do qual, fornecedores submetem lances decrescentes, na disputa por contratos do setor público. No presente trabalho, o autor propõe uma abordagem de decisão multicritério, baseada na Teoria da Utilidade Multiatributo, como uma alternativa para a adoção de leilões reversos baseados em múltiplos atributos e, consequentemente, para uma maior agregação de valor pelas organizações compradoras do setor público brasileiro.

Generic-branded drug competition and the price for pharmaceuticals in procurement auctions

This paper studies the effects of generic drug’s entry on bidding behavior of drug suppliers in procurement auctions for pharmaceuticals, and the consequences on procurer’s price paid for drugs. Using an unique data set on procurement auctions for off-patent drugs organized by Brazilian public bodies, we surprisingly find no statistically difference between bids and prices paid for generic and branded drugs. On the other hand, some branded drug suppliers leave auctions in which there exists a supplier of generics, whereas the remaining ones lower their bidding price. These findings explain why we find that the presence of any supplier of generic drugs in a procurement auction reduces the price paid for pharmaceuticals by 7 percent. To overcome potential estimation bias due to generic’s entry endogeneity, we exploit variation in the number of days between drug’s patent expiration date and the tendering session. The two-stage estimations document the same pattern as the generalized least square estimations find. This evidence indicates that generic competition affects branded supplier’s behavior in public procurement auctions differently from other markets.

Nonparametric Identication and Structural Estimation of Auction Models

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

Composite auction method for suppressing unreasonable electricity price spikes in a competitive electricity market

The existence of undesirable electricity price spikes in a competitive electricity market requires an efficient auction mechanism. However, many of the existing auction mechanism have difficulties in suppressing such unreasonable price spikes effectively. A new auction mechanism is proposed to suppress effectively unreasonable price spikes in a competitive electricity market. It optimally combines system marginal price auction and pay as bid auction mechanisms. A threshold value is determined to activate the switching between the marginal price auction and the proposed composite auction. Basically when the system marginal price is higher than the threshold value, the composite auction for high price electricity market is activated. The winning electricity sellers will sell their electricity at the system marginal price or their own bid prices, depending on their rights of being paid at the system marginal price and their offers' impact on suppressing undesirable price spikes. Such economic stimuli discourage sellers from practising economic and physical withholdings. Multiple price caps are proposed to regulate strong market power. We also compare other auction mechanisms to highlight the characteristics of the proposed one. Numerical simulation using the proposed auction mechanism is given to illustrate the procedure of this new auction mechanism.

An Optimal Mechanism for Sponsored Search Auctions on the Web and Comparison With Other Mechanisms

In this paper, we first describe a framework to model the sponsored search auction on the web as a mechanism design problem. Using this framework, we describe two well-known mechanisms for sponsored search auction-Generalized Second Price (GSP) and Vickrey-Clarke-Groves (VCG). We then derive a new mechanism for sponsored search auction which we call optimal (OPT) mechanism. The OPT mechanism maximizes the search engine's expected revenue, while achieving Bayesian incentive compatibility and individual rationality of the advertisers. We then undertake a detailed comparative study of the mechanisms GSP, VCG, and OPT. We compute and compare the expected revenue earned by the search engine under the three mechanisms when the advertisers are symmetric and some special conditions are satisfied. We also compare the three mechanisms in terms of incentive compatibility, individual rationality, and computational complexity. Note to Practitioners-The advertiser-supported web site is one of the successful business models in the emerging web landscape. When an Internet user enters a keyword (i.e., a search phrase) into a search engine, the user gets back a page with results, containing the links most relevant to the query and also sponsored links, (also called paid advertisement links). When a sponsored link is clicked, the user is directed to the corresponding advertiser's web page. The advertiser pays the search engine in some appropriate manner for sending the user to its web page. Against every search performed by any user on any keyword, the search engine faces the problem of matching a set of advertisers to the sponsored slots. In addition, the search engine also needs to decide on a price to be charged to each advertiser. Due to increasing demands for Internet advertising space, most search engines currently use auction mechanisms for this purpose. These are called sponsored search auctions. A significant percentage of the revenue of Internet giants such as Google, Yahoo!, MSN, etc., comes from sponsored search auctions. In this paper, we study two auction mechanisms, GSP and VCG, which are quite popular in the sponsored auction context, and pursue the objective of designing a mechanism that is superior to these two mechanisms. In particular, we propose a new mechanism which we call the OPT mechanism. This mechanism maximizes the search engine's expected revenue subject to achieving Bayesian incentive compatibility and individual rationality. Bayesian incentive compatibility guarantees that it is optimal for each advertiser to bid his/her true value provided that all other agents also bid their respective true values. Individual rationality ensures that the agents participate voluntarily in the auction since they are assured of gaining a non-negative payoff by doing so.

Optimal procurement and contracting with research and development

Government procurement of a new good or service is a process that usually includes basic research, development, and production. Empirical evidences indicate that investments in research and development (R and D) before production are significant in many defense procurements. Thus, optimal procurement policy should not be only to select the most efficient producer, but also to induce the contractors to design the best product and to develop the best technology. It is difficult to apply the current economic theory of optimal procurement and contracting, which has emphasized production, but ignored R and D, to many cases of procurement.

In this thesis, I provide basic models of both R and D and production in the procurement process where a number of firms invest in private R and D and compete for a government contract. R and D is modeled as a stochastic cost-reduction process. The government is considered both as a profit-maximizer and a procurement cost minimizer. In comparison to the literature, the following results derived from my models are significant. First, R and D matters in procurement contracting. When offering the optimal contract the government will be better off if it correctly takes into account costly private R and D investment. Second, competition matters. The optimal contract and the total equilibrium R and D expenditures vary with the number of firms. The government usually does not prefer infinite competition among firms. Instead, it prefers free entry of firms. Third, under a R and D technology with the constant marginal returns-to-scale, it is socially optimal to have only one firm to conduct all of the R and D and production. Fourth, in an independent private values environment with risk-neutral firms, an informed government should select one of four standard auction procedures with an appropriate announced reserve price, acting as if it does not have any private information.

Cartéis em leilões: atuação e medidas de combate

Leilão é um procedimento de alocação de recursos com boas propriedades. Apresento a literatura teórica de leilões a qual demonstra, que sob diversas condições, leilões levam à alocação eficiente de recursos e maximização da receita do leiloeiro. Entretanto estes resultados valem apenas se os participantes do leilão não estejam organizados em cartéis. Um Cartel é uma organização que inibe a concorrência entre firmas. A atuação de um cartel pode ou não levar a uma alocação eficiente de recursos, mas a receita do leiloeiro será sempre prejudicada. Analiso a literatura teórica de cartel em leilões de objeto único que caracteriza formas de coordenação do cartel, estratégias de atuação e sua sustentabilidade. Apresento os desafios que o cartel deve superar. Mais ainda, proponho medidas que devem ser tomadas, caso haja suspeita de existência de cartel. O leilão de primeiro preço é o menos suscetível a ação de cartéis, pois nele há incentivo para as firmas desviarem das orientações do cartel. O combate a cartéis é avaliado por meio da taxa de desconto necessária para o cartel existir. Se a taxa de desconto necessária é menor significa um cartel mais difícil de ser sustentado. Demonstro que o preço de reserva randômico é melhor para combater cartéis do que o preço de reserva fixo em leilões de primeiro preço que se repetem.

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.