5 citations · 8 across the 4 of their papers we have counts for
5 papers
Understanding Iterative Combinatorial Auction Designs via Multi-Agent Reinforcement Learning
Greg d'Eon, Neil Newman, Kevin Leyton-Brown
Iterative combinatorial auctions are widely used in high stakes settings such as spectrum auctions. Such auctions can be hard to analyze, making it difficult for bidders to determi…
Matching Papers and Reviewers at Large Conferences
Kevin Leyton-Brown, Mausam, Yatin Nandwani +4
Peer-reviewed conferences, the main publication venues in CS, rely critically on matching highly qualified reviewers for each paper. Because of the growing scale of these conferenc…
Dynamic Weighted Matching with Heterogeneous Arrival and Departure Rates
Natalie Collina, Nicole Immorlica, Kevin Leyton-Brown +2
We study a dynamic non-bipartite matching problem. There is a fixed set of agent types, and agents of a given type arrive and depart according to type-specific Poisson processes. A…
Assessing Economic Outcomes in Simulated Reverse Clock Auctions for Radio Spectrum
Neil Newman, Kevin Leyton-Brown, Paul Milgrom +1
We investigate the economic outcomes that result under simulated bidder behavior in a model of the FCC's reverse auction for radio spectrum. In our simulations, limiting our notion…
Deep Optimization for Spectrum Repacking
Neil Newman, Alexandre Fréchette, Kevin Leyton-Brown
Over 13 months in 2016-17 the FCC conducted an "incentive auction" to repurpose radio spectrum from broadcast television to wireless internet. In the end, the auction yielded $19.8…