Computer-aided verification in mechanism design

In mechanism design, the gold standard solution concepts are dominant strategy incentive compatibility and Bayesian incentive compatibility. These solution concepts relieve the (possibly unsophisticated) bidders from the need to engage in complicated strategizing. While incentive properties are simple to state, their proofs are specific to the mechanism and can be quite complex. This raises two concerns. From a practical perspective, checking a complex proof can be a tedious process, often requiring experts knowledgeable in mechanism design. Furthermore, from a modeling perspective, if unsophisticated agents are unconvinced of incentive properties, they may strategize in unpredictable ways. To address both concerns, we explore techniques from computer-aided verification to construct formal proofs of incentive properties. Because formal proofs can be automatically checked, agents do not need to manually check the properties, or even understand the proof. To demonstrate, we present the verification of a sophisticated mechanism: the generic reduction from Bayesian incentive compatible mechanism design to algorithm design given by Hartline, Kleinberg, and Malekian. This mechanism presents new challenges for formal verification, including essential use of randomness from both the execution of the mechanism and from the prior type distributions. As an immediate consequence, our work also formalizes Bayesian incentive compatibility for the entire family of mechanisms derived via this reduction. Finally, as an intermediate step in our formalization, we provide the first formal verification of incentive compatibility for the celebrated Vickrey-Clarke-Groves mechanism

Simplicity-Expressiveness Tradeoffs in Mechanism Design

A fundamental result in mechanism design theory, the so-called revelation principle, asserts that for many questions concerning the existence of mechanisms with a given outcome one can restrict attention to truthful direct revelation-mechanisms. In practice, however, many mechanism use a restricted message space. This motivates the study of the tradeoffs involved in choosing simplified mechanisms, which can sometimes bring benefits in precluding bad or promoting good equilibria, and other times impose costs on welfare and revenue. We study the simplicity-expressiveness tradeoff in two representative settings, sponsored search auctions and combinatorial auctions, each being a canonical example for complete information and incomplete information analysis, respectively. We observe that the amount of information available to the agents plays an important role for the tradeoff between simplicity and expressiveness

Complexity Theory, Game Theory, and Economics: The Barbados Lectures

This document collects the lecture notes from my mini-course "Complexity Theory, Game Theory, and Economics," taught at the Bellairs Research Institute of McGill University, Holetown, Barbados, February 19--23, 2017, as the 29th McGill Invitational Workshop on Computational Complexity. The goal of this mini-course is twofold: (i) to explain how complexity theory has helped illuminate several barriers in economics and game theory; and (ii) to illustrate how game-theoretic questions have led to new and interesting complexity theory, including recent several breakthroughs. It consists of two five-lecture sequences: the Solar Lectures, focusing on the communication and computational complexity of computing equilibria; and the Lunar Lectures, focusing on applications of complexity theory in game theory and economics. No background in game theory is assumed.Comment: Revised v2 from December 2019 corrects some errors in and adds some recent citations to v1 Revised v3 corrects a few typos in v

Speculation in Second-Price Auctions with Resale

This paper contributes to the literature on second-price auctions with resale. We add speculators---bidders with value zero---to the standard symmetric independent private values environment. There always exists a continuum of inefficient equilibria that are profitable for a speculator. With no reserve price in the initial auction, speculation can enhance the initial seller's expected revenue. On the other hand, speculation can harm the initial seller even if she chooses an optimal reserve price. Our results are valid for English auctions as well.speculation, second-price auction, resale

Trading mechanism selection with budget constraints

We present an equilibrium search model of competing mechanisms where some buyers are budget constrained. Absent budget constraints, the existing literature capitulates that if buyers differ in their valuations then in the unique equilibrium all sellers hold second price auctions (e.g. McAfee (1993)) whereas if buyers are homogeneous then sellers are indifferent across a large number of payoff-equivalent mechanisms (e.g. Eeckhout and Kircher (2010)). We show that these results are not robust to the presence of budget constrained buyers; merely lowering the budgets of a few buyers renders the auction equilibrium as well as payoff equivalence unsustainable. If buyers differ only slightly in terms of their ability to pay then sellers prefer fixed price trading; otherwise they prefer auctions.Trading Mechanisms, Budget Constraints, Competitive Search

Affiliation, equilibrium existence and the revenue ranking of auctions

We consider private value auctions where bidders’ types are dependent, a case usually treated by assuming affiliation. We show that affiliation is a restrictive assumption in three senses: topological, measure-theoretic and statistical (affiliation is a very restrictive characterization of positive dependence). We also show that affiliation’s main implications do not generalize for alternative definitions of positive dependence. From this, we propose new approaches to the problems of pure strategy equilibrium existence in first-price auctions (PSEE) and the characterization of the revenue ranking of auctions. For equilibrium existence, we slightly restrict the set of distributions considered, without loss of economic generality, and offer a complete characterization of PSEE. For revenue ranking, we obtain a characterization of the expected revenue differences between second and first price auctions with general dependence of types