Algorithms play an increasingly important role in economic situations. These situations are often strategic, where the artificial intelligence may or may not be cooperative. We study the deter-minants and forms of algorithmic cooperation in the infinitely repeated prisoner's dilemma. We run a...

I study auctions in which firms bid for licenses that reduce their marginal costs in a post-auction downstream market. When there are three or more firms, I show that the Vickrey--Clarke--Groves (VCG) auction maximizes consumer surplus in dominant strategies if and only if it maximizes producer...

We show how to bid in first-price auctions when a bidder knows her own value but not how others will bid. To do this we introduce a novel and general method for how to make choices in strategic settings without assuming common knowledge or equilibrium behavior. Accordingly, first eliminate...

The Combinatorial Clock Auction (CCA) has been frequently used in recent spectrum auctions. It combines a dynamic clock phase with subsequent VCG pricing in order to maximize price discovery and efficiency. We inquire into the role of the clock when bidders have lexicographic preferences for...

Algorithms play an increasingly important role in economic situations. These situations are often strategic, where the artificial intelligence may or may not be cooperative. We study the deter-minants and forms of algorithmic cooperation in the infinitely repeated prisoner’s dilemma. We run a...

Algorithms play an increasingly important role in economic situations. Often these situations are strategic, where the artificial intelligence may or may not be cooperative. We study the determinants and forms of algorithmic cooperation in the infinitely repeated prisoner's dilemma. We run a...