A Dynamic Axiomatic Approach to First-Price Auctions

The first-price auction is popular in practice for its simplicity and transparency. Moreover, its potential virtues grow in complex settings where incentive compatible auctions may generate little or no revenue. Unfortunately, the first-price auction is poorly understood in theory because equilibrium is not {\em a priori} a credible predictor of bidder behavior. We take a dynamic approach to studying first-price auctions: rather than basing performance guarantees solely on static equilibria, we study the repeated setting and show that robust performance guarantees may be derived from simple axioms of bidder behavior. For example, as long as a loser raises her bid quickly, a standard first-price auction will generate at least as much revenue as a second-price auction. We generalize this dynamic technique to complex pay-your-bid auction settings and show that progressively stronger assumptions about bidder behavior imply progressively stronger guarantees about the auction's performance. Along the way, we find that the auctioneer's choice of bidding language is critical when generalizing beyond the single-item setting, and we propose a specific construction called the {\em utility-target auction} that performs well. The utility-target auction includes a bidder's final utility as an additional parameter, identifying the single dimension along which she wishes to compete. This auction is closely related to profit-target bidding in first-price and ascending proxy package auctions and gives strong revenue guarantees for a variety of complex auction environments. Of particular interest, the guaranteed existence of a pure-strategy equilibrium in the utility-target auction shows how Overture might have eliminated the cyclic behavior in their generalized first-price sponsored search auction if bidders could have placed more sophisticated bids

A dynamic mechanism and surplus extraction under ambiguity

We study the question of auction design in an IPV setting characterized by ambiguity. We assume that the preferences of agents exhibit ambiguity aversion; in particular, they are represented by the epsilon-contamination model. We show that a simple variation of a discrete Dutch auction can extract almost all surplus. This contrasts with optimal auctions under IPV without ambiguity as well as with optimal static auctions with ambiguity—in all of these, types other than the lowest participating type obtain a positive surplus. An important point of departure is that the modified Dutch mechanism is dynamic rather than static, establishing that under ambiguity aversion—even when the setting is IPV in all other respects—a dynamic mechanism can have additional bite over its static counterparts. A further general insight is that the standard revelation principle does not automatically extend to environments not characterized by subjective expected utility

A Dynamic Mechanism and Surplus Extraction Under Ambiguity

In the standard independent private values (IPV)model, each bidder’s beliefs about the values of any other bidder is represented by a unique prior. In this paper we relax this assumption and study the question of auction design in an IPV setting characterized by ambiguity: bidders have an imprecise knowledge of the distribution of values of others, and are faced with a set of priors. We also assume that their preferences exhibit ambiguity aversion; in particular, they are represented by the epsilon-contamination model. We show that a simple variation of a discrete Dutch auction can extract almost all surplus. This contrasts with optimal auctions under IPV without ambiguity as well as with optimal static auctions with ambiguity - in all of these, types other than the lowest participating type obtain a positive surplus. An important point of departure is that the modified Dutch mechanism we consider is dynamic rather than static, establishing that under ambiguity aversion – even when the setting is IPV in all other respects – a dynamic mechanism can have additional bite over its static counterparts.Ambiguity Aversion; Epsilon Contamination; Modified Dutch Auction; Dynamic Mechanism; Surplus Extraction

Appraising Diversity with an Ordinal Notion of Similarity: An Axiomatic Approach

This paper provides an axiomatic characterization of two rules for comparing alternative sets of objects on the basis of the diversity that they offer. The framework considered assumes a finite universe of objects and an a priori given ordinal quadernary relation that compares alternative pairs of objects on the basis of their ordinal dissimilarity. Very few properties of this quadernary relation are assumed (beside completeness, transitivity and a very natural form of symmetry). The two rules that we characterize are the maxi-max criterion and the lexi-max criterion. The maxi-max criterion considers that a set is more diverse than another if and only if the two objects that are the most dissimilar in the former are weakly as dissimilar as the two most dissimilar objects in the later. The lexi-max criterion is defined as usual as the lexicographic extension of the maxi-max criterion. Some connections with the broader issue of measuring freedom of choice are also provided.Diversity, Measurement, Axioms, Freedom of choice

Competitive Auctions: Theory and Application

The theory of competitive auctions offers a coherent framework for modelling coordination frictions as a non-cooperative game. The theory represents an advancement over cooperative approaches that make exogenous assumptions about how output is divided between buyers and sellers and about the forces that bring buyers and sellers into local markets. Moreover, unlike price posting models, which fix the terms of trade prior to matching, competitive auction models have a bidding process that allocates the good (or service) to the highest valuation bidder at a price equal to the second highest valuation. Therefore, the competing auction model is more robust to problems in which there are heterogenous valuations. This paper develops the theory of competitive auctions and applies it to a number of practical problems in microeconomics, labor economics, industrial organization, investment theory and monetary economics.

Competitive Auctions: Theory and Application

The theory of competitive auctions offers a coherent framework for modelling coordination frictions as a non-cooperative game. The theory represents an advancement over cooperative approaches that make exogenous assumptions about how output is divided between buyers and sellers and about the forces that bring buyers and sellers into local markets. Moreover, unlike price posting models, which fix the terms of trade prior to matching, competitive auction models have a bidding process that allocates the good (or service) to the highest valuation bidder at a price equal to the second highest valuation. Therefore, the competitive auction model is more robust to problems in which there are heterogenous valuations. This paper develops the theory of competitive auctions and applies it to a number of practical problems in microeconomics, labor economics, industrial organization, investment theory and monetary economics.

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