Analysis of Ausubel auctions by means of evolutionary computation

IEEE Congress on Evolutionary Computation. Edimburgo, 2-5 September 2005The increasing use of auctions has led to a growing interest in the subject. A recent method used for carrying out examinations on auctions has been the design of computational simulations. The aim of this paper is to develop a genetic algorithm to find bidders' optimal strategies for a specific dynamic multi-unit auction. The algorithm provides the bidding strategy (defined as the action to be taken under different auction conditions) that maximizes the bidder's payoff. The algorithm is tested under several experimental environments, number of bidders and quantity of lots auctioned. The results suggest that the approach leads to strategies that outperform canonical strategies

Effects of a rationing rule on the ausubel auction: a genetic algorithm implementation

The increasing use of auctions as a selling mechanism has led to a growing interest in the subject. Thus both auction theory and experimental examinations of these theories are being developed. A recent method used for carrying out examinations on auctions has been the design of computational simulations. The aim of this article is to develop a genetic algorithm to find automatically a bidder optimal strategy while the other players are always bidding sincerely. To this end a specific dynamic multiunit auction has been selected: the Ausubel auction, with private values, dropout information, and with several rationing rules implemented. The method provides the bidding strategy (defined as the action to be taken under different auction conditions) that maximizes the bidder's payoff. The algorithm is tested under several experimental environments that differ in the elasticity of their demand curves, number of bidders and quantity of lots auctioned. The results suggest that the approach leads to strategies that outperform sincere bidding when rationing is needed.Publicad

Auctioning Bulk Mobile Messages

The search for enablers of continued growth of SMS traffic, as well asthe take-off of the more diversified MMS message contents, open up forenterprises the potential of bulk use of mobile messaging , instead ofessentially one-by-one use. In parallel, such enterprises or valueadded services needing mobile messaging in bulk - for spot use or foruse over a prescribed period of time - want to minimize totalacquisition costs, from a set of technically approved providers ofmessaging capacity.This leads naturally to the evaluation of auctioning for bulk SMS orMMS messaging capacity, with the intrinsic advantages therein such asreduction in acquisition costs, allocation efficiency, and optimality.The paper shows, with extensive results as evidence from simulationscarried out in the Rotterdam School of Management e-Auction room, howmulti-attribute reverse auctions perform for the enterprise-buyer, aswell as for the messaging capacity-sellers. We compare 1- and 5-roundauctions, to show the learning effect and the benefits thereof to thevarious parties. The sensitivity will be reported to changes in theenterprise's and the capacity providers utilities and prioritiesbetween message attributes (such as price, size, security, anddelivery delay). At the organizational level, the paper also considersalternate organizational deployment schemes and properties for anoff-line or spot bulk messaging capacity market, subject to technicaland regulatory constraints.MMS;EMS;Mobile commerce;SMS;multi-attribute auctions

A theoretical and computational basis for CATNETS

The main content of this report is the identification and definition of market mechanisms for Application Layer Networks (ALNs). On basis of the structured Market Engineering process, the work comprises the identification of requirements which adequate market mechanisms for ALNs have to fulfill. Subsequently, two mechanisms for each, the centralized and the decentralized case are described in this document. These build the theoretical foundation for the work within the following two years of the CATNETS project. --Grid Computing

Theoretical and Computational Basis for Economical Ressource Allocation in Application Layer Networks - Annual Report Year 1

This paper identifies and defines suitable market mechanisms for Application Layer Networks (ALNs). On basis of the structured Market Engineering process, the work comprises the identification of requirements which adequate market mechanisms for ALNs have to fulfill. Subsequently, two mechanisms for each, the centralized and the decentralized case are described in this document. --Grid Computing

An empirical examination of repeated auctions for biodiversity conservation contracts

The European Union’s Council Regulation on support for rural development by the European Agricultural Fund for Rural Development has introduced auctioning as a new instrument for granting agri-environmental payments and awarding conservation contracts for the recent multi-annual budgetary plan. This paper therefore deals with the conception and results of two case study auctions for conservation contracts. Results of two field experiments show much differentiated bid prices in the model-region and budgetary cost-effectiveness gains of up to 21% in the first auction and up to 36% in the repeated auction. Besides these promising results, some critical aspects as well as lessons to be learned will also be discussed in this paper to improve the design and performance of upcoming conservation auctions.agri-environmental policy, discriminatory-price auction, multi-unit auction, ecological services, plant biodiversity, experimental economics

postbid market interaction and auction choice

We study the influence of product market competition on the first-price sealed auction and the English ascending auction with independent cost types. Bidders, valuing the license basing on the information released in the first stage license bidding game and the possible game they will play in the product market, care about not only whether they can win and thus how much to bid, but also the information released in the auction when they win. As in the English ascending auction, all bidders are able to constantly adjust their belief about their potential rival’s cost distribution, and the higher the bid goes, the lower the potential rival’s cost, the lower the expected gain from winning a license, thus bidders will keep downgrade the value of license and bid more conservatively and the government will generate lower expected revenue from the English auction than in first-price sealed auction. In particular, if the government uses the English ascending auction while the Bertrand price-cutting game being played in the product market, then all bidders except the two lowest cost type bidder will quit the bidding game sequentially and the expected revenue will be close to zero. Furthermore, as the Bertrand competition is more intensive than the Cournot competition, the government’s expected revenue is lower when the product market game played as a Bertrand gameAuction, Oligopoly

Agent-based transportation planning compared with scheduling heuristics

Here we consider the problem of dynamically assigning vehicles to transportation orders that have di¤erent time windows and should be handled in real time. We introduce a new agent-based system for the planning and scheduling of these transportation networks. Intelligent vehicle agents schedule their own routes. They interact with job agents, who strive for minimum transportation costs, using a Vickrey auction for each incoming order. We use simulation to compare the on-time delivery percentage and the vehicle utilization of an agent-based planning system to a traditional system based on OR heuristics (look-ahead rules, serial scheduling). Numerical experiments show that a properly designed multi-agent system may perform as good as or even better than traditional methods