Auctions and Mechanisms
摘要
This chapter introduces mechanism design—the reverse engineering of games to achieve desired outcomes. It begins with a deep dive into auction theory, explaining how different formats (first-price, second-price, ascending-bid) elicit different bidding behaviours. Case studies include IPL player auctions, spectrum sales, and internet ad word markets. The model of all-pay auctions, where one bidder wins the object but every bidder foregoes their entire bid amount, is used to explain the over-allocation of resources in electoral contests. The chapter also applies the same model in the winner-takes-all industries of the Internet to argue that the increase in social resources flowing to such industries and the cosy handshake between such industries and elected representatives explain the rapid increase in the money expended in elections. It ends with a discussion of matching mechanisms, especially the Gale–Shapley algorithm, and how they could revolutionize future labour markets.