Timeline of Auctions and Market Design

Designing rules for allocating scarce resources, from the medical residency match in 1952 to auction theory, school choice, kidney exchange, and the economic sciences prize of 2020.

Category
Social Sciences
Tags
economics mathematics institutions computing
Events
18 events 1952 – 2020
Generated
by gpt-6
  1. 1952: A centralized match assigns medical internships

    The first national match coordinated hospital internships for graduating medical students in the United States. A centralized procedure addressed problems created by hospitals making offers increasingly early and applicants facing pressure to accept before comparing alternatives.

    https://en.wikipedia.org/wiki/National_Resident_Matching_Program
  2. 1961: Vickrey analyzes auction incentives

    William Vickrey analyzed sealed-bid auctions in which the highest bidder paid the second-highest bid. Under private-value assumptions, bidding one's own value was a dominant strategy, creating a benchmark for incentive-compatible auction design.

    https://en.wikipedia.org/wiki/Vickrey_auction
  3. 1962: Gale and Shapley propose deferred acceptance

    David Gale and Lloyd Shapley described an algorithm for matching two groups without a pair who would both prefer one another to their assigned partners. The deferred-acceptance procedure established a constructive solution to the stable matching problem.

    https://en.wikipedia.org/wiki/Gale%E2%80%93Shapley_algorithm
  4. 1971: Oil-lease analysis names the winner's curse

    Edward Capen, Robert Clapp, and William Campbell described the danger of winning an auction because one's estimate was overly optimistic. Their analysis of petroleum lease bidding highlighted the distinction between private values and uncertain values shared by bidders.

    https://en.wikipedia.org/wiki/Winner%27s_curse
  5. 1971 – 1973: Clarke and Groves develop incentive-compatible payments

    Edward Clarke and Theodore Groves developed payment rules that aligned truthful reporting with individual incentives in public-choice settings. Together with William Vickrey's earlier work, their contributions became the Vickrey–Clarke–Groves mechanism.

    https://en.wikipedia.org/wiki/Vickrey%E2%80%93Clarke%E2%80%93Groves_mechanism
  6. 1973 – 1975: Impossibility results expose strategic voting

    Allan Gibbard and Mark Satterthwaite independently established limits on deterministic voting rules. With unrestricted preferences and at least three possible outcomes, a nondictatorial rule could not generally guarantee that truthful reporting was always the best strategy.

    https://en.wikipedia.org/wiki/Gibbard%E2%80%93Satterthwaite_theorem
  7. 1981: Myerson derives optimal auction rules

    Roger Myerson analyzed revenue-maximizing auctions under specified assumptions about bidders' independent private values. The work connected allocation rules, incentive constraints, and payments, providing a general framework beyond comparisons of familiar auction formats.

    https://en.wikipedia.org/wiki/Bayesian-optimal_mechanism
  8. 1982: Milgrom and Weber connect information with revenue

    Paul Milgrom and Robert Weber analyzed auctions with affiliated information and both private and common components of value. Their results showed how the information revealed by an auction's rules could affect bidding and expected seller revenue.

    https://en.wikipedia.org/wiki/Linkage_principle
  9. 1984: Roth explains the residency match's stability

    Alvin Roth analyzed the medical residency market and the properties of its matching procedure. The work connected the success of a real institution with stability theory, helping establish market design as an interaction between formal models and institutional detail.

    https://en.wikipedia.org/wiki/Alvin_E._Roth
  10. 1994: The United States auctions spectrum licenses

    The Federal Communications Commission introduced simultaneous multiple-round auctions for radio spectrum licenses. Bidders could observe prices across related licenses and revise their bids over rounds, applying auction theory to a large public allocation problem.

    https://en.wikipedia.org/wiki/Spectrum_auction
  11. 1998: The residency match adopts a redesigned algorithm

    The National Resident Matching Program implemented an applicant-proposing algorithm developed by Alvin Roth and Elliott Peranson. The redesign addressed practical complications including couples seeking compatible placements and different categories of positions.

    https://en.wikipedia.org/wiki/National_Resident_Matching_Program
  12. 2003: Researchers recast school choice as market design

    Atila Abdulkadiroğlu and Tayfun Sönmez analyzed school assignment using mechanisms designed around student preferences and school priorities. Their work showed why an allocation procedure could create incentives to misrepresent preferences even when no money changed hands.

    https://en.wikipedia.org/wiki/School-choice_mechanism
  13. 2003: New York redesigns high-school admissions

    New York City introduced a high-school assignment process based on deferred acceptance. Economists worked with the school system to replace a process that left many students without an initial assignment and encouraged strategic listing of schools.

    https://en.wikipedia.org/wiki/Alvin_E._Roth
  14. 2004: Economists formalize kidney exchange

    Alvin Roth, Tayfun Sönmez, and M. Utku Ünver published an analysis of kidney exchange for incompatible patient-donor pairs. Matching theory helped organize exchanges without buying or selling organs, with medical and logistical constraints shaping feasible matches.

    https://en.wikipedia.org/wiki/Kidney_paired_donation
  15. 2005: Boston adopts a new school assignment mechanism

    Boston adopted a deferred-acceptance procedure to replace its school assignment mechanism. The change reduced incentives for families to rank schools strategically instead of stating their preferences, connecting theoretical concerns with the design of a public service.

    https://en.wikipedia.org/wiki/School-choice_mechanism
  16. 2012: Matching theory receives the economic sciences prize

    Alvin Roth and Lloyd Shapley shared the economic sciences prize for stable allocation theory and market design. The award connected mathematical results about matching with practical work on institutions such as school admissions and residency assignments.

    https://en.wikipedia.org/wiki/List_of_Nobel_Memorial_Prize_laureates_in_Economic_Sciences
  17. 2017: A spectrum incentive auction reallocates broadcast capacity

    The Federal Communications Commission completed an incentive auction that combined purchases of television broadcasters' spectrum rights with sales of wireless licenses. The process linked a reverse auction, a forward auction, and technical constraints on repacking broadcast stations.

    https://en.wikipedia.org/wiki/2016_United_States_wireless_spectrum_auction#Broadcast_incentive_auction
  18. 2020: Auction theory receives the economic sciences prize

    Paul Milgrom and Robert Wilson shared the economic sciences prize for auction theory and new auction formats. The recognition highlighted research on private information and common values alongside designs used to allocate resources such as radio spectrum.

    https://en.wikipedia.org/wiki/List_of_Nobel_Memorial_Prize_laureates_in_Economic_Sciences