The Generalized Second Price (GSP) auction is the primary auction used for monetizing the use of the Internet. It is well-known that truthtelling is not a dominant strategy in this auction and that inefficient equilibria can arise. Edelman et al. (2007) [11] and Varian (2007) [36] show that an...

This paper explores information disclosure in matching markets, e. g. the informativeness of transcripts given out by universities. We show that the same amount of information is disclosed in all equilibria. We then demonstrate that if universities disclose the equilibrium amount of information,...

We study trading behavior and the properties of prices in informationally complex markets. Our model is based on the single-period version of the linear-normal framework of Kyle (1985). We allow for essentially arbitrary correlations among the random variables involved in the model: the true...

We study two-sided many-to-one matching markets with interdependent valuations and imperfect information held by one side of the market. The other side has common and known preferences over potential mates. In this setting, pairwise stability does not imply group stability: mechanisms that are...

We introduce a model in which agents in a network can trade via bilateral contracts. We find that when continuous transfers are allowed and utilities are quasi-linear, the full substitutability of preferences is sufficient to guarantee the existence of stable outcomes for any underlying network...

We study trading behavior and the properties of prices in informationally complex markets. Our model is based on the single-period version of the linear-normal framework of Kyle (1985). We allow for essentially arbitrary correlations among the random variables involved in the model: the value of...

We investigate the "generalized second price" auction (GSP), a new mechanism which is used by search engines to sell online advertising that most Internet users encounter daily. GSP is tailored to its unique environment, and neither the mechanism nor the environment have previously been studied...

This paper considers the problem of estimating the distribution of payoffs in a discrete dynamic game, focusing on models where the goal is to learn about the distribution of firms' entry and exit costs. The idea is to begin with non parametric first stage estimates of entry and continuation...

This paper studies matching in vertical networks, generalizing the theory of matching in two-sided markets. It gives sufficient conditions for the existence of stable networks and presents an algorithm for finding two of them. One is the best stable network for the agents on the "upstream" end...

A decision maker needs to schedule several activities that take uncertain time to complete and are only valuable together. Some activities are bound to be finished earlier than others, thus incurring waiting costs. We show how to schedule activities optimally, how to give independent agents...