Optimal auction with a general distribution: virtual valuation without densities

We characterize the optimal auction in an independent private values framework for a completely general distribution of valuations. We do this introducing a new concept: the generalized virtual valuation. To show the wider applicability of this concept we present two examples showing how to extend the classical models of Mussa and Rosen and Baron and Myerson for arbitrary distributions

Optimal auctions with multidimensional types and the desirability of exclusion

Within the context of a single-unit, independent private values auction model, we show that if bidder types are multidimensional, then under the optimal auction exclusion of some bidder types will occur. A second contribution of the paper is methodological in nature. In particular, we identify conditions under which an auction model with multidimensional types can be reduced to a model with one dimensional types without loss of generality. Reduction results of this type have achieved the status of folklore in the mechanism design literature. Here, we provide a proof of the reduction result for auctions.

Reserve price commitments in auctions

It is well known that the optimal auction-one that maximizes the seller's expected revenue-can be implemented using a standard auction format with a suitably chosen reserve price. This reserve price is above the seller's value of retaining the object and the mechanism requires a commitment not to sell the object below the reserve. This commitment is what makes the reserve valuable to the seller. However, in practice, a reserve price commits the seller to sell the object if the reserve is reached, but does not commit her to withhold the object from sale if bidding falls short of the reserve. In this note we investigate whether reserve prices remain valuable for the seller when she may negotiate with the highest bidder if the reserve is not met. We show that the value of the reserve price may be completely undermined if the seller is a sufficiently weak bargainer. (c) 2004 Elsevier B.V. All rights reserved.

Abstract types and distributions in independent private value auctions

In this note, in an independent private values auction framework, I discuss the relationship between the set of types and the distribution of types. I show that any set of types, finite dimensional or not, can be extended to a larger set of types preserving incentive compatibility constraints, expected revenue and bidder’s expected utilities. Thus for example we may convexify a set of types making our model amenable to the large body of theory in economics and mathematics that relies on convexity assumptions. An interesting application of this extension procedure is to show that although revenue equivalence is not valid in general if the set of types is not convex these mechanism have underlying distinct allocation mechanism in the extension. Thus we recover in these situations the revenue equivalence.

Hybrid Auctions I: Theory

In this paper we examine the properties of a hybrid auction that combines a sealed bid and an ascending auction. In this auction, each bidder submits a sealed bid. Once the highest bid is known, the bidder who submitted it is declared the winner if her bid is higher than the second highest by more than a predetermined amount or percentage. If at least one more bidder submitted a bid su¢ciently close to the highest bid (that is, if the di¤erence between this bid and the highest bid is smaller than the predetermined amount or percentage) the quali…ed buyers compete in an open ascending auction that has the highest bid of the …rst stage as the reserve price. Quali…ed bidders include not only the highest bidder in the …rst stage but also those who bid close enough to her. We show that this auction generates more revenue than a standard auction. Although this hybrid auction does not generate as much revenue as the optimal auction, it is ex-post e¢cient.

Optimal Choice of a Firm in Conducting Auction

Силвия К. Баева, Цветана Хр. Недева - Важен аспект в системата на Министерството на регионалното развитие и благоустройство е работата по Оперативна програма “Регионално развитие” с приоритетна ос “Устойчиво и интегрирано градско развитие” по операция “Подобряване на физическата среда и превенция на риска”. По тази програма са включени 86 общини. Финансовият ресурс на тази операция е на стойност 238 589 939 евро, от които 202 801 448 евро са европейско финансиране [1]. Всяка от тези 86 общини трябва да реши задачата за възлагане на обществена поръчка на определена фирма по тази операция. Всъщност, тази задача е задача за провеждане на общински търг за избор на фирма-изпълнител. Оптималният избор на фирма-изпълнител е много важен. Задачата за провеждане на търг ще формулираме като задача на многокритериалното вземане на решения, като чрез подходящо изграждане на критерии и методи може да се трансформира до задача на еднокритериалната оптимизация.

An auction theoretical approach to fiscal wars

I examine a situation where a firm chooses to locate a new factory in one of several jurisdictions. The value of the factory may differ among jurisdictions and it depends on the private information held by each jurisdiction. Jurisdictions compete for the location of the new factory. This competition may take the form of expenditures already incurred on infrastructure, commitments to spend on infrastructure, tax incentives or even cash payments. The model combines two elements that are usually considered separately; competition is desirable because we want the factory to be located in the jurisdiction that values it the most, but competition in itself is wasteful. I show that the expected total amount paid to the firm under a large family of arrangements is the same. Moreover, I show that the ex-ante optimal mechanism that is, the mechanism that guarantees that the firm chooses the jurisdiction with the highest value for the factory, minimizes the total expected payment to the firm, and balances the budget in an ex-ante sense - can be implemented by running a standard auction and subsidizing participation.

Meeting technologies and optimal trading mechanisms in competitive search markets

In a market in which sellers compete by posting mechanisms, we study how the properties of the meeting technology affect the mechanism that sellers select. In general, sellers have incentive to use mechanisms that are socially efficient. In our environment, sellers achieve this by posting an auction with a reserve price equal to their own valuation, along with a transfer that is paid by (or to) all buyers with whom the seller meets. However, we define a novel condition on meeting technologies, which we call “invariance,” and show that the transfer is equal to zero if and only if the meeting technology satisfies this condition.

An auction theoretical approach to fiscal wars

I examine a situation where a firm has to choose to locate a new factory in one of several jurisdictions and it depends on the private information held by each jurisdiction. Jurisdiction compete for the location of the new factory. This competition may take the form of expenditures already incurred on infraestructure, commitments to spend on infraestructure, tax incentives or even cash payments. The model combines two elements that are usually considered separately; competition is desirable because we want the factory to be located in the jurisdiction that values it the most, but competition in itself is wasteful. I show that expected total amount paid to the firm under a large family of arrangements. Moreover, I show that the ex-ante optimal mechanism that guarantees that the firm chooses the jurisdiction with the highest value for the factory, minimizes the total expected payment to the firm, and balances the budget in an ex-ante sense - can be implemented by running a standard auction and subsidizing participation.

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.

Mid-auction information acquisition

This paper studies a model of a sequential auction where bidders are allowed to acquire further information about their valuations of the object in the middle of the auction. It is shown that, in any equilibrium where the distribution of the final price is atornless, a bidder's best response has a simple characterization. In particular, the optimal information acquisition point is the same, regardless of the other bidders' actions. This makes it natural to focus on symmetric, undominated equilibria, as in the Vickrey auction. An existence theorem for such a class of equilibria is presented. The paper also presents some results and numerical simulations that compare this sequential auction with the one-shot auction. 8equential auctions typically yield more expected revenue for the seller than their one-shot counterparts. 80 the possibility of mid-auction information acquisition can provide an explanation for why sequential procedures are more often adopted.

Essays on Procurement, Scoring Auction, and Quality Manipulation Corruption

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

Agent-orientated auction mechanism and strategy design

Agent-based technology is playing an increasingly important role in today’s economy. Usually a multi-agent system is needed to model an economic system such as a market system, in which heterogeneous trading agents interact with each other autonomously. Two questions often need to be answered regarding such systems: 1) How to design an interacting mechanism that facilitates efficient resource allocation among usually self-interested trading agents? 2) How to design an effective strategy in some specific market mechanisms for an agent to maximise its economic returns? For automated market systems, auction is the most popular mechanism to solve resource allocation problems among their participants. However, auction comes in hundreds of different formats, in which some are better than others in terms of not only the allocative efficiency but also other properties e.g., whether it generates high revenue for the auctioneer, whether it induces stable behaviour of the bidders. In addition, different strategies result in very different performance under the same auction rules. With this background, we are inevitably intrigued to investigate auction mechanism and strategy designs for agent-based economics. The international Trading Agent Competition (TAC) Ad Auction (AA) competition provides a very useful platform to develop and test agent strategies in Generalised Second Price auction (GSP). AstonTAC, the runner-up of TAC AA 2009, is a successful advertiser agent designed for GSP-based keyword auction. In particular, AstonTAC generates adaptive bid prices according to the Market-based Value Per Click and selects a set of keyword queries with highest expected profit to bid on to maximise its expected profit under the limit of conversion capacity. Through evaluation experiments, we show that AstonTAC performs well and stably not only in the competition but also across a broad range of environments. The TAC CAT tournament provides an environment for investigating the optimal design of mechanisms for double auction markets. AstonCAT-Plus is the post-tournament version of the specialist developed for CAT 2010. In our experiments, AstonCAT-Plus not only outperforms most specialist agents designed by other institutions but also achieves high allocative efficiencies, transaction success rates and average trader profits. Moreover, we reveal some insights of the CAT: 1) successful markets should maintain a stable and high market share of intra-marginal traders; 2) a specialist’s performance is dependent on the distribution of trading strategies. However, typical double auction models assume trading agents have a fixed trading direction of either buy or sell. With this limitation they cannot directly reflect the fact that traders in financial markets (the most popular application of double auction) decide their trading directions dynamically. To address this issue, we introduce the Bi-directional Double Auction (BDA) market which is populated by two-way traders. Experiments are conducted under both dynamic and static settings of the continuous BDA market. We find that the allocative efficiency of a continuous BDA market mainly comes from rational selection of trading directions. Furthermore, we introduce a high-performance Kernel trading strategy in the BDA market which uses kernel probability density estimator built on historical transaction data to decide optimal order prices. Kernel trading strategy outperforms some popular intelligent double auction trading strategies including ZIP, GD and RE in the continuous BDA market by making the highest profit in static games and obtaining the best wealth in dynamic games.

Spectrum redistribution for cognitive radios using discriminatory spectrum double auction

With the reformation of spectrum policy and the development of cognitive radio, secondary users will be allowed to access spectrums licensed to primary users. Spectrum auctions can facilitate this secondary spectrum access in a market-driven way. To design an efficient auction framework, we first study the supply and demand pressures and the competitive equilibrium of the secondary spectrum market, considering the spectrum reusability. In well-designed auctions, competition among participants should lead to the competitive equilibrium according to the traditional economic point of view. Then, a discriminatory price spectrum double auction framework is proposed for this market. In this framework, rational participants compete with each other by using bidding prices, and their profits are guaranteed to be non-negative. A near-optimal heuristic algorithm is also proposed to solve the auction clearing problem of the proposed framework efficiently. Experimental results verify the efficiency of the proposed auction clearing algorithm and demonstrate that competition among secondary users and primary users can lead to the competitive equilibrium during auction iterations using the proposed auction framework. Copyright © 2011 John Wiley & Sons, Ltd.