Market design

From Wikipedia, the free encyclopedia
Jump to: navigation, search

In his 2008, Nemmers Prize lecture,[1] Paul Milgrom gave the following definition of Market Design

Market design is a kind of economic engineering, utilizing laboratory research, game theory, algorithms, simulations, and more. Its challenges inspire us to rethink longstanding fundamentals of economic theory.

He outlined that two broad theoretical and practical efforts defined the field: auction theory and matching theory. Milgrom has contributed to both and also, in many respects, to their synthesis. A third component of Market design is Simplifying Participants’ Message.

Milgrom advised the FCC on the design of the auction of bandwidth for cellular communications.

Auction Theory[edit]

Early research on auctions focused on two special cases: common value auctions in which buyers have private signals of an items true value and private value auctions in which values are identically and independently distributed. Milgrom and Weber (1982) present a much more general theory of auctions with positively related values. Each of n buyers receives a private signal . Buyer i’s value is strictly increasing in and is an increasing symmetric function of . If signals are independently and identically distributed, then buyer i’s expected value is independent of the other buyers’ signals. Thus, the buyers’ expected values are independently and identically distributed. This is the standard private value auction. For such auctions the revenue equivalence theorem holds. That is, expected revenue is the same in the sealed first-price and second-price auctions.

Milgrom and Weber assumed instead that the private signals are “affiliated”. With two buyers, the random variables and with probability density function are affiliated if

, for all and all .

Applying Bayes’ Rule it follows that , for all and all .

Rearranging this inequality and integrating with respect to it follows that

, for all and all. (1)

It is this implication of affiliation that is critical in the discussion below.

For more than two symmetrically distributed random variables, let be a set of random variables that are continuously distributed with joint probability density function f(v) . The n random variables are affiliated if

for all and in where .

Revenue Ranking Theorem (Milgrom and Weber[2])

Suppose each of n buyers receives a private signal . Buyer i’s value is strictly increasing in and is an increasing symmetric function of . If signals are affiliated, the equilibrium bid function in a sealed first-price auction is smaller than the equilibrium expected payment in the sealed second price auction.

The intuition for this result is as follows: In the sealed second-price auction the expected payment of a winning bidder with value v is based on their own information. By the revenue equivalence theorem if all buyers had the same beliefs, there would be revenue equivalence. However, if values are affiliated, a buyer with value v knows that buyers with lower values have more pessimistic beliefs about the distribution of values. In the sealed high-bid auction such low value buyers therefore bid lower than they would if they had the same beliefs. Thus the buyer with value v does not have to compete so hard and bids lower as well. Thus the informational effect lowers the equilibrium payment of the winning bidder in the sealed first-price auction.

Equilibrium bidding in the sealed first- and second-price auctions: We consider here the simplest case in which there are two buyers and each buyer’s value depends only on his own signal. Then the buyers’ values are private and affiliated. In the sealed second-price (or Vickrey auction), it is a dominant strategy for each buyer to bid his value. If both buyers do so, then a buyer with value v has an expected payment of

(2) .

In the sealed first-price auction, the increasing bid function B(v) is an equilibrium if bidding strategies are mutual best responses. That is, if buyer 1 has value v, their best response is to bid b = B(v) if they believes that their opponent is using this same bidding function. Suppose buyer 1 deviates and bids b = B(z) rather than B(v) . Let U(z) be their resulting payoff. For B(v) to be an equilibrium bid function, U(z) must take on its maximum at x = v. With a bid of b = B(z) buyer 1 wins if

, that is, if .

The win probability is then so that buyer 1’s expected payoff is

.

Taking logs and differentiating by z,

. (3)

The first term on the right hand side is the proportional increase in the win probability as the buyer raises his bid from to . The second term is the proportional drop in the payoff if the buyer wins. We have argued that, for equilibrium, U(z) must take on its maximum at z = v . Substituting for z in (3) and setting the derivative equal to zero yields the following necessary condition.

. (4)

Proof of the revenue ranking theorem

Buyer 1 with value x has conditional p.d.f. . Suppose that he naively believes that all other buyers have the same beliefs. In the sealed high bid auction he computes the equilibrium bid function using these naive beliefs. Arguing as above, condition (3) becomes

. (3’)

Since x > v it follows by affiliation (see condition (1)) that the proportional gain to bidding higher is bigger under the naive beliefs that place higher mass on higher values. Arguing as before, a necessary condition for equilibrium is that (3’) must be zero at x = v. Therefore, the equilibrium bid function satisfies the following differential equation.

. (5)

Appealing to the revenue equivalence theorem, if all buyers have values that are independent draws from the same distribution then the expected payment of the winner is the same in the two auctions. Therefore, . Thus, to complete the proof we need to establish that . Appealing to (1), it follows from (4) and (5) that for all v < x.

Therefore, for any v in the interval [0,x]

.

Suppose that . Since the equilibrium bid of a buyer with value 0 is zero, there must be some y < x such that

and .

But this is impossible since we have just shown that over such an interval, is decreasing. Since it follows that the winner bidder’s expected payment is lower in the sealed high-bid auction.

Ascending auctions with package bidding

Milgrom has also contributed to the understanding of combinatorial auctions. In work with Larry Ausubel (Ausubel and Milgrom, 2002), auctions of multiple items, which may be substitutes or complements, are considered. They define a mechanism, the “ascending proxy auction,” constructed as follows. Each bidder reports his values to a proxy agent for all packages that the bidder is interested in. Budget constraints can also be reported. The proxy agent then bids in an ascending auction with package bidding on behalf of the real bidder, iteratively submitting the allowable bid that, if accepted, would maximize the real bidder’s profit (value minus price), based on the reported values. The auction is conducted with negligibly small bid increments. After each round, provisionally winning bids are determined that maximize the total revenue from feasible combinations of bids. All of a bidder’s bids are kept live throughout the auction and are treated as mutually exclusive. The auction ends after a round occurs with no new bids. The ascending proxy auction may be viewed either as a compact representation of a dynamic combinatorial auction or as a practical direct mechanism, the first example of what Milgrom would later call a “core selecting auction.”

They prove that, with respect to any reported set of values, the ascending proxy auction always generates a core outcome, i.e. an outcome that is feasible and unblocked. Moreover, if bidders’ values satisfy the substitutes condition, then truthful bidding is a Nash equilibrium of the ascending proxy auction and yields the same outcome as the Vickrey-Clarke-Groves (VCG) mechanism. However, the substitutes condition is robustly a necessary as well as a sufficient condition: if just one bidder’s values violate the substitutes condition, then with appropriate choice of three other bidders with additively-separable values, the outcome of the VCG mechanism lies outside the core; and so the ascending proxy auction cannot coincide with the VCG mechanism and truthful bidding cannot be a Nash equilibrium. They also provide a complete characterization of substitutes preferences: Goods are substitutes if and only if the indirect utility function is submodular.

Ausubel and Milgrom (2006a, 2006b) exposit and elaborate on these ideas. The first of these articles, entitled “The Lovely but Lonely Vickrey Auction,” made an important point in market design. The VCG mechanism, while highly attractive in theory, suffers from a number of possible weaknesses when the substitutes condition is violated, making it a poor candidate for empirical applications. In particular, the VCG mechanism may exhibit: low (or zero) seller revenues; non-monotonicity of the seller’s revenues in the set of bidders and the amounts bid; vulnerability to collusion by a coalition of losing bidders; and vulnerability to the use of multiple bidding identities by a single bidder. This may explain why the VCG auction design, while so lovely in theory, is so lonely in practice.

Additional work in this area by Milgrom together with Larry Ausubel and Peter Cramton has been particularly influential in practical market design. Ausubel, Cramton and Milgrom (2006) together proposed a new auction format that is now called the “combinatorial clock auction” (CCA), which consists of a clock auction stage followed by a sealed-bid supplementary round. All of the bids are interpreted as package bids; and the final auction outcome is determined using a core selecting mechanism. The CCA was first used in the United Kingdom’s 10–40 GHz spectrum auction of 2008. Since then, it has become a new standard for spectrum auctions: it has been utilized for major spectrum auctions in Austria, Denmark, Ireland, the Netherlands, Switzerland and the UK; and it is slated to be used in forthcoming auctions in Australia and Canada.

At the 2008 Nemmers Prize conference Vijay Krishna[3] and Larry Ausubel[4] highlighted Milgrom's contributions to auction theory and their subsequent impact on auction design.

Matching Theory[edit]

Milgrom has also contributed to the understanding of matching market design. In work with John Hatfield (Hatfield and Milgrom, 2005), he shows how to generalize the stable marriage matching problem to allow for “matching with contracts”, where the terms of the match between agents on either side of the market arise endogenously through the matching process. They show that a suitable generalization of the deferred acceptance algorithm of David Gale and Lloyd Shapley finds a stable matching in their setting; moreover, the set of stable matchings forms a lattice, and similar vacancy chain dynamics are present.

The observation that stable matchings are a lattice was a well known result that provided the key to their insight into generalizing the matching model. They observed (as did some other contemporary authors) that the lattice of stable matchings was reminiscent of the conclusion of Tarski’s fixed point theorem, which states that an increasing function from a complete lattice to itself has a nonempty set of fixed points that form a complete lattice. But it wasn’t apparent what was the lattice, and what was the increasing function. Hatfield and Milgrom observed that the accumulated offers and rejections formed a lattice, and that the bidding process in an auction and the deferred acceptance algorithm were examples of a cumulative offer process that was an increasing function in this lattice.

Their generalization also shows that certain package auctions (see the Policy section) can be thought of as a special case of matching with contracts, where there is only one agent (the auctioneer) on one side of the market and contracts include both the items to be transferred and the total transfer price as terms. Thus, two of market design's great success stories, the deferred acceptance algorithm as applied to the medical match, and the simultaneous ascending auction as applied to the FCC spectrum auctions, have a deep mathematical connection. In addition, this work (in particular, the "cumulative offer" variation of the deferred acceptance algorithm) has formed the basis of recently proposed redesigns of the mechanisms used to match residents to hospitals in Japan[5] and cadets to branches in the US Army.[6]

Simplifying Participants’ Messages[edit]

Milgrom has also contributed to the understanding of the effect of simplifying the message space in practical market design. He observed and developed as an important design element of many markets the notion of conflation---the idea of restricting a participant’s ability to convey rich preferences by forcing them to enter the same value for different preferences. An example of conflation arises in Gale and Shapley’s deferred acceptance algorithm for hospital and doctors matching when hospitals are allowed to submit only responsive preferences (i.e., the ranking of doctors and capacities) even though they could be conceivably asked to submit general substitutes preferences. In the Internet sponsored-search auctions, advertisers are allowed to submit a single per-click bid, regardless of which ad positions they win. A similar, earlier idea of a conflated generic-item auction is an important component of the Combinatorial Clock Auction (Ausubel, Cramton and Milgrom, 2006), widely used in spectrum auctions including the UK's recent 800 MHz / 2.6 GHz auction, and has also been proposed for Incentive Auctions.[7] Bidders are allowed to express only the quantity of frequencies in the allocation stage of the auction without regard to the specific assignment (which is decided in a later assignment stage). Milgrom (2010) shows that with a certain “outcome closure property,” conflation adds no new unintended outcome as equilibrium and argued that, by thickening the markets, may intensify price competition and increase revenue.

As a concrete application of the idea of simplifying messages, Milgrom (2009) defines assignment messages of preferences. In assignment messages, an agent can encode certain nonlinear preferences involving various substitution possibilities into linear objectives by allowing agents to describe multiple “roles” that objects can play in generating utility, with utility thus generated being added up. The valuation over a set of objects is the maximum value that can be achieved by optimally assigning them to various roles. Assignment messages can also be applied to resource allocation without money; see, for example, the problem of course allocation in schools, as analyzed by Budish, Che, Kojima, and Milgrom (2013). In doing so, the paper has provided a generalization of the Birkhoff-von Neumann Theorem (a mathematical property about Doubly Stochastic Matrices) and applied it to analyze when a given random assignment can be "implemented" as a lottery over feasible deterministic outcomes.

A more general language, endowed assignment message, is studied by Hatfield and Milgrom (2005). Milgrom provides an overview of these issues in Milgrom (2011).

References[edit]

  1. ^ Milgrom Nemmers Prize Presentation Slides, 2008
  2. ^ Milgrom, Paul and Robert Weber (1982). "A Theory of Auctions and Competitive Bidding". Econometrica (Econometrica, Vol. 50, No. 5) 50 (5): 1089–1122
  3. ^ Krishna's Nemmers Presentation, 2008
  4. ^ Ausubel's Nemmers Presentation, 2008
  5. ^ Kamada Yuichiro; Kojima Fuhito (2010). "Improving Efficiency in Matching Markets with Regional Caps: The Case of the Japan Residency Matching Program". Stanford Institute for Economic Policy Discussion Paper and Kamada, Y., & Kojima, F. (2012). "Stability and Strategy-Proofness for Matching with Constraints: A Problem in the Japanese Medical Match and Its Solution". American Economic Review. 102 (3): 366–370. doi:10.1257/aer.102.3.366. 
  6. ^ Sönmez Tayfun (2013). "Bidding for Army Career Specialties: Improving the ROTC Branching Mechanism". Journal of Political Economy. 121 (1): 186–219. doi:10.1086/669915. 
  7. ^ FCC, Notice of Proposed Rulemaking 12-118, September 28, 2012.

External links[edit]