Auction Experiments and Simulations of Milk Quota Exchanges

Since 2000 Germany has a fairly unique market mechanism to trade milk quotas between dairy farms. The two major features are: (1) a quasi auctioning system that produces excess demands which are covered by state reserves free of charge and (2) a price band is used to exclude high price bids. For both features an experimental design is developed to study their impact in comparison to a regular seller’s sealed bid double auction. Results show that both treatments lead to significant misallocations. These are due the direct impact of regulations and due to an imperfect adjustment of bidding functions towards them. The major goal of the market design to reduce quota prices is reached, however, at significant trade losses.Double Auction, Experiment, Milk Quota, Germany, Institutional and Behavioral Economics, Research Methods/ Statistical Methods, L11, D44, Q13,

Auction Experiments and Simulations of Milk Quota Exchanges

Since 2000 Germany has introduced a fairly unique market mechanism to trade milk quotas between dairy farms. The two major features are: (1) a quasi auctioning system that produces excess demands which are covered by state reserves free of charge and (2) a price band that is used to exclude highest bids. For both features an experimental design is developed to study the impact in reference to a regular seller’s sealed bid double auction. Results show that both treatments lead to significant misallocations. These are due to the direct impact of regulations and due to an imperfect adjustment of bidding functions. The major goal of the market design to reduce quota prices is reached, however, at significant trade losses.Livestock Production/Industries,

Prediction Markets: Alternative Mechanisms for Complex Environments with Few Traders

Double auction prediction markets have proven successful in large-scale applications such as elections and sporting events. Consequently, several large corporations have adopted these markets for smaller-scale internal applications where information may be complex and the number of traders is small. Using laboratory experiments, we test the performance of the double auction in complex environments with few traders and compare it to three alternative mechanisms. When information is complex we find that an iterated poll (or Delphi method) outperforms the double auction mechanism. We present five behavioral observations that may explain why the poll performs better in these settings

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

Explorations in Evolutionary Design of Online Auction Market Mechanisms

This paper describes the use of a genetic algorithm (GA) to find optimal parameter-values for trading agents that operate in virtual online auction “e-marketplaces”, where the rules of those marketplaces are also under simultaneous control of the GA. The aim is to use the GA to automatically design new mechanisms for agent-based e-marketplaces that are more efficient than online markets designed by (or populated by) humans. The space of possible auction-types explored by the GA includes the Continuous Double Auction (CDA) mechanism (as used in most of the world’s financial exchanges), and also two purely one-sided mechanisms. Surprisingly, the GA did not always settle on the CDA as an optimum. Instead, novel hybrid auction mechanisms were evolved, which are unlike any existing market mechanisms. In this paper we show that, when the market supply and demand schedules undergo sudden “shock” changes partway through the evaluation process, two-sided hybrid market mechanisms can evolve which may be unlike any human-designed auction and yet may also be significantly more efficient than any human designed market mechanism

A Grey-Box Approach to Automated Mechanism Design

Auctions play an important role in electronic commerce, and have been used to solve problems in distributed computing. Automated approaches to designing effective auction mechanisms are helpful in reducing the burden of traditional game theoretic, analytic approaches and in searching through the large space of possible auction mechanisms. This paper presents an approach to automated mechanism design (AMD) in the domain of double auctions. We describe a novel parametrized space of double auctions, and then introduce an evolutionary search method that searches this space of parameters. The approach evaluates auction mechanisms using the framework of the TAC Market Design Game and relates the performance of the markets in that game to their constituent parts using reinforcement learning. Experiments show that the strongest mechanisms we found using this approach not only win the Market Design Game against known, strong opponents, but also exhibit desirable economic properties when they run in isolation.Comment: 18 pages, 2 figures, 2 tables, and 1 algorithm. Extended abstract to appear in the proceedings of AAMAS'201

Evolutionary Optimization of ZIP60: A Controlled Explosion in Hyperspace

The “ZIP” adaptive trading algorithm has been demonstrated to out-perform human traders in experimental studies of continuous double auction (CDA) markets. The original ZIP algorithm requires the values of eight control parameters to be set correctly. A new extension of the ZIP algorithm, called ZIP60, requires the values of 60 parameters to be set correctly. ZIP60 is shown here to produce significantly better results than the original ZIP (called “ZIP8” hereafter), for negligable additional computational costs. A genetic algorithm (GA) is used to search the 60-dimensional ZIP60 parameter space, and it finds parameter vectors that yield ZIP60 traders with mean scores significantly better than those of ZIP8s. This paper shows that the optimizing evolutionary search works best when the GA itself controls the dimensionality of the search-space, so that the search commences in an 8-d space and thereafter the dimensionality of the search-space is gradually increased by the GA until it is exploring a 60-d space. Furthermore, the results from ZIP60 cast some doubt on prior ZIP8 results concerning the evolution of new ‘hybrid’ auction mechanisms that appeared to be better than the CDA

Vernon Smith's Insomnia and the Dawn of Economics as Experimental Science

This is a commentary on Vernon Smith's contributions to experimental economicsexperimental economics, auctions, public goods, markets, Vernon Smith, ultimatum game, dictator games

Environmental analysis for application layer networks

Die zunehmende Vernetzung von Rechnern über das Internet lies die Vision von Application Layer Netzwerken aufkommen. Sie umfassen Overlay Netzwerke wie beispielsweise Peer-to-Peer Netzwerke und Grid Infrastrukturen unter Verwendung des TCP/IP Protokolls. Ihre gemeinsame Eigenschaft ist die redundante, verteilte Bereitstellung und der Zugang zu Daten-, Rechen- und Anwendungsdiensten, während sie die Heterogenität der Infrastruktur vor dem Nutzer verbergen. In dieser Arbeit werden die Anforderungen, die diese Netzwerke an ökonomische Allokationsmechanismen stellen, untersucht. Die Analyse erfolgt anhand eines Marktanalyseprozesses für einen zentralen Auktionsmechanismus und einen katallaktischen Markt. --Grid Computing