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

Secure Implementation Experiments: Do Strategy-proof Mechanisms Really Work?

Strategy-proofness, requiring that truth-telling is a dominant strategy, is a standard concept used in social choice theory. Saijo et al. (2003) argue that this concept has serious drawbacks. In particular, many strategy-proof mechanisms have a continuum of Nash equilibria, including equilibria other than dominant strategy equilibria. For only a subset of strategy-proof mechanisms do the set of Nash equilibria and the set of dominant strategy equilibria coincide. For example, this double coincidence occurs in the Groves mechanism when preferences are single-peaked. We report experiments using two strategy-proof mechanisms. One of them has a large number of Nash equilibria, but the other has a unique Nash equilibrium. We found clear differences in the rate of dominant strategy play between the two.Experiment, Laboratory, Secure Implementation, Groves-Clarke, Pivotal, Learning

Boundedly rational versus optimization-based models of strategic thinking and learning in games

The paper is a comment on the article by R. Harstad and R. Selten and considers the tradeoff between bounded rationality and optimization models in the game-theoretic context. The author shows that in most of the models elements of opimization are still retained and that it is thus more productive to further improve the optimization-based modeling rather than to abandon them altogether in favour of bounded rationality

Mean Field Equilibria for Competitive Exploration in Resource Sharing Settings

We consider a model of nomadic agents exploring and competing for time-varying location-specific resources, arising in crowdsourced transportation services, online communities, and in traditional location based economic activity. This model comprises a group of agents, and a set of locations each endowed with a dynamic stochastic resource process. Each agent derives a periodic reward determined by the overall resource level at her location, and the number of other agents there. Each agent is strategic and free to move between locations, and at each time decides whether to stay at the same node or switch to another one. We study the equilibrium behavior of the agents as a function of dynamics of the stochastic resource process and the nature of the externality each agent imposes on others at the same location. In the asymptotic limit with the number of agents and locations increasing proportionally, we show that an equilibrium exists and has a threshold structure, where each agent decides to switch to a different location based only on their current location's resource level and the number of other agents at that location. This result provides insight into how system structure affects the agents' collective ability to explore their domain to find and effectively utilize resource-rich areas. It also allows assessing the impact of changing the reward structure through penalties or subsidies.Comment: 17 pages, 1 figure, 1 table, to appear in proceedings of the 25th International World Wide Web Conference(WWW2016

Descending Price Optimally Coordinates Search

Investigating potential purchases is often a substantial investment under uncertainty. Standard market designs, such as simultaneous or English auctions, compound this with uncertainty about the price a bidder will have to pay in order to win. As a result they tend to confuse the process of search both by leading to wasteful information acquisition on goods that have already found a good purchaser and by discouraging needed investigations of objects, potentially eliminating all gains from trade. In contrast, we show that the Dutch auction preserves all of its properties from a standard setting without information costs because it guarantees, at the time of information acquisition, a price at which the good can be purchased. Calibrations to start-up acquisition and timber auctions suggest that in practice the social losses through poor search coordination in standard formats are an order of magnitude or two larger than the (negligible) inefficiencies arising from ex-ante bidder asymmetries.Comment: JEL Classification: D44, D47, D82, D83. 117 pages, of which 74 are appendi

Multi-Unit Auctions to Allocate Water Scarcity Simulating Bidding Behaviour with Agent Based Models

Multi-unit auctions are promising mechanisms for the reallocation of water. The main advantage of such auctions is to avoid the lumpy bid issue. However, there is great uncertainty about the best auction formats when multi-unit auctions are used. The theory can only supply the structural properties of equilibrium strategies and the multiplicity of equilibria makes comparisons across auction formats difficult. Empirical studies and experiments have improved our knowledge of multi- unit auctions but they remain scarce and most experiments are restricted to two bidders and two units. Moreover, they demonstrate that bidders have limited rationality and learn through experience. This paper constructs an agent-based model of bidders to compare the performance of alternative auction formats under circumstances where bidders submit continuous bid supply functions and learn over time to adjust their bids to improve their net incomes. We demonstrate that under the generalized Vickrey, simulated bids converge towards truthful bids as predicted by the theory and that bid shading is the rule for the uniform and discriminatory auctions. Our study allows us to assess the potential gains from agent-based modelling approaches in the assessment of the dynamic performance of multi-unit procurement auctions. Some recommendations on the desirable format of water auctions are provided.Multi-unit auctions, Learning, Multi-agent models, Water allocation

Secure Implementation Experiments: Do Strategy-proof Mechanisms Really Work?

Strategy-proofness, requiring that truth-telling is a dominant strategy, is a standard concept used in social choice theory. Saijo et al. (2003) argue that this concept has serious drawbacks. In particular, announcing one's true preference may not be a unique dominant strategy, and almost all strategy-proof mechanisms have a continuum of Nash equilibria. For only a subset of strategy-proof mechanisms do the set of Nash equilibria and the set of dominant strategy equilibria coincide. For example, this double coincidence occurs in the Groves mechanism when preferences are single-peaked. We report experiments using two strategy-proof mechanisms where one of them has a large number of Nash equilibria, but the other has a unique Nash equilibrium. We found clear differences in the rate of dominant strategy play between the two.