I study a mechanism design problem of allocating a single good to an agent when the mechanism is followed by a post-mechanism game (aftermarket) played between the agent and a third-party. The aftermarket is beyond the direct control of the designer. However, she can influence the information...

The procurement of complex projects is often plagued by large cost overruns. One important reason for these additional costs are flaws in the initial design. If the project is procured with a price-only auction, sellers who spotted some of the flaws have no incentive to reveal them early. Each...

We provide an introduction to the recent developments in dynamic mechanism design, with a primary focus on the quasilinear case. First, we describe socially optimal (or efficient) dynamic mechanisms. These mechanisms extend the well-known Vickrey-Clark-Groves and D'Aspremont-Gérard-Varet...

Mechanism design is a subfield of game theory that aims to design games whose equilibria have desired properties such as achieving high efficiency or high revenue. Algorithmic mechanism design is a subfield that lies on the border of mechanism design and computer science and deals with mechanism...

Economic articles are published very slowly. We believe this results from the poor incentives referees face. We recommend that an auction market replace the current, push system for submitting papers and demonstrate that our proposed market has a stable, Pareto-improving equilibrium. Besides the...

Surrounding the passage of Dodd-Frank, a noted author argues that existing market manipulation statutes cannot effectively prosecute manipulation cases because the statutes prohibit fraud, not market power. This is incorrect. While traditional economic theory can explain the incentives...

This paper provides a new look at the well-known trade-off between efficiency and equality with an agent-based model. By way of a computer program, our study simulates the interactions of agents producing and trading goods within different market structures and looks at the resulting production...

Double auctions with profit-motivated human traders as well as quot;zero-intelligencequot; programmed traders have previously been shown to converge to Pareto optimal allocations in partial equilibrium settings. We show that these results remain robust in two-good general equilibrium settings...

We consider a pure exchange economy repeated for an indefinite number of periods from a fixed endowment and posit a learning rule which directs convergence to competitive equilibrium. In each period trade converges to an allocation in the contract set, where agents interpret the current (common)...

The epsilon-intelligent competitive equilibrium algorithm is a decentralized alternative to Walrus' tatonnement procedure for markets to arrive at competitive equilibrium. We build on the Gode-Spear-Sunder zero-intelligent algorithm in which random generation of bids and offers from agents'...