Combinatorial Scoring Auctions

This paper is concerned with a combinatorial, multi-attribute procurement mechanism called combinatorial scoring auction. In the setting that we analyze, private information of the suppliers is multi-dimensional. The buyer wants to procure several items at once. Subsets of these items are characterized by a price as well as by a number of non-monetary attributes called quality (e.g. completion time). The suppliers submit offers specifying prices and quality levels for these subsets. These offers are evaluated according to a quasilinear scoring rule. Based on the resulting scores suppliers win contracts for the delivery of certain items. Such a contract only specifies the set of items a supplier has to deliver and a score that he has to meet. The decision about the specific price-quality combination yielding this contracted score is at the discretion of the supplier who aims at optimizing his own profit. We analyze the equilibria in such auctions and show the link between combinatorial scoring auctions and combinatorial price-only auctions. We demonstrate how this link can be used to employ preexisting knowledge about the equilibrium behavior in regular price-only auctions in the strategic analysis of combinatorial scoring auctions. Our results are the multi-item extension to the results of Asker and Cantillon (2007).mathematical economics;

Corruption in Procurement Auctions

We review different kinds of corruption that have been observed in procurement auctions and categorize them. We discuss means to avoid corruption, by choice of preferable auction formats, or with the help of technological tools, such as secure electronic bidding systems. Auctions that involve some soft elements, such as complex bids consisting of technical and financial proposals, are particularly prone to corruption. We do not believe that it is possible to eradicate corruption altogether in such situations, but we discuss means to make it less likely.

Truthful approximation mechanisms for restricted combinatorial auctions

When attempting to design a truthful mechanism for a computationally hard problem such as combinatorial auctions, one is faced with the problem that most efficiently computable heuristics can not be embedded in any truthful mechanism (e.g. VCG-like payment rules will not ensure truthfulness). We develop a set of techniques that allow constructing efficiently computable truthful mechanisms for combinatorial auctions in the special case where each bidder desires a specific known subset of items and only the valuation is unknown by the mechanism (the single parameter case). For this case we extend the work of Lehmann, O'Callaghan, and Shoham, who presented greedy heuristics. We show how to use If-Then-Else constructs, perform a partial search, and use the LP relaxation. We apply these techniques for several canonical types of combinatorial auctions, obtaining truthful mechanisms with provable approximation ratios

The Treasury auction process: objectives, structure, and recent acquisitions

Treasury auctions are designed to minimize the cost of financing the national debt by promoting broad, competitive bidding and liquid secondary market trading. A review of the auction process-from the announcement of a new issue to the delivery of securities-reveals how these objectives have been met. Also highlighted are changes in the auction process that stem from recent advances in information-processing technologies and risk management techniques.Auctions ; Government securities ; Treasury bills ; Treasury notes

An Agent Based Market Design Methodology for Combinatorial Auctions

Auction mechanisms have attracted a great deal of interest and have been used in diverse e-marketplaces. In particular, combinatorial auctions have the potential to play an important role in electronic transactions. Therefore, diverse combinatorial auction market types have been proposed to satisfy market needs. These combinatorial auction types have diverse market characteristics, which require an effective market design approach. This study proposes a comprehensive and systematic market design methodology for combinatorial auctions based on three phases: market architecture design, auction rule design, and winner determination design. A market architecture design is for designing market architecture types by Backward Chain Reasoning. Auction rules design is to design transaction rules for auctions. The specific auction process type is identified by the Backward Chain Reasoning process. Winner determination design is about determining the decision model for selecting optimal bids and auctioneers. Optimization models are identified by Forward Chain Reasoning. Also, we propose an agent based combinatorial auction market design system using Backward and Forward Chain Reasoning. Then we illustrate a design process for the general n-bilateral combinatorial auction market. This study serves as a guideline for practical implementation of combinatorial auction markets design.Combinatorial Auction, Market Design Methodology, Market Architecture Design, Auction Rule Design, Winner Determination Design, Agent-Based System

Buy it now: A hybrid market institution

This paper analyzes seller choices and outcomes in approximately 700 Internet auctions of a relatively homogeneous good. The ‘Buy it Now’ option allows the seller to convert the auction into a posted price market. We use a structural model to control for the conduct of the auction as well as product and seller characteristics. In explaining seller choices, we find that the ‘Buy it Now’ option was used more often by sellers with higher ratings and offering fewer units; and posted prices were more prevalent for used items. In explaining auction outcomes, we find that auctions with a ‘Buy it Now’ price had higher winning bids, ceteris paribus, whether or not the auction ended with the ‘Buy it Now’ offer being accepted, possibly reflecting signaling or bounded rationality. We also find that posting prices, by combining ‘Buy it Now’ and an equal starting price, was an effective strategy for sellers in the sample.Market institutions; posted prices; auctions; e-commerce

An Investigation Report on Auction Mechanism Design

Auctions are markets with strict regulations governing the information available to traders in the market and the possible actions they can take. Since well designed auctions achieve desirable economic outcomes, they have been widely used in solving real-world optimization problems, and in structuring stock or futures exchanges. Auctions also provide a very valuable testing-ground for economic theory, and they play an important role in computer-based control systems. Auction mechanism design aims to manipulate the rules of an auction in order to achieve specific goals. Economists traditionally use mathematical methods, mainly game theory, to analyze auctions and design new auction forms. However, due to the high complexity of auctions, the mathematical models are typically simplified to obtain results, and this makes it difficult to apply results derived from such models to market environments in the real world. As a result, researchers are turning to empirical approaches. This report aims to survey the theoretical and empirical approaches to designing auction mechanisms and trading strategies with more weights on empirical ones, and build the foundation for further research in the field