Summary

The FCC's Office of Plans and Policy (OPP) and Wireless Telecommunications Bureau (WTB) -- in conjunction with the Stanford Institute for Economic Policy Research and National Science Foundation -- presented the Conference on Combinatorial Bidding on October 26-28, 2001. This conference, conducted at the Aspen Institute's Wye Woods Conference Centers in Queenstown, Maryland, provided a forum for some of the nation's experts in the economic science of auctions and the FCC's auctions program managers to share information, present papers, and discuss the FCC's auctions processes.

Related Links

Agenda

 
Friday October 26
4:00 p.m. Check-In
7:00 p.m. Dinner
Saturday October 27
7:30 - 8:15 Breakfast
8:15 - 8:30 Opening
8:30 - 10:00
Lawrence Ausubel and Paul Milgrom
Ascending Auctions with Package Bidding (pdf) (140 KB)
Discussant(s): Charles Kahn, Robert Weber
10:00 - 10:30 Break
10:30 - 12:00 Tradeoffs in Combinatorial Auction Design
Aleksandar Pekec and Michael Rothkopf
Tradeoffs in Combinatorial Auction Design (pdf) (130 KB)
Discussant(s): Robert Forsythe, Dan Levin, Daniel Vincent
12:00 - 1:30 Lunch - Keynote speech
David Sappington, Chief Economist FCC
1:30 - 2:00 FCC 700 MHz Auction Design and Software
Craig Bomberger, FCC
Package Bidding System Screenshots (pdf) (1.92 MB)
2:00 - 3:00 Issues in Scaling Up the 700 MHz Auction Design
Karla Hoffman, FCC
Issues in Scaling Up the 700 MHz Auction Design (pdf) (1.17 MB)
3:00 - 3:30 Discussion
Discussant(s): Craig Bomberger, Karla Hoffman, Evan Kwerel, Walter Strack, Karen Wrege
3:30 - 4:00 Break
4:00 - 5:00 Market Clearing Technology for Markets with Expressive Bidding
Tuomas Sandholm
Discussant(s): Martin Durbin, Kevin Leyton-Brown
6:00 - 7:00 Reception
7:00 - 9:00 Dinner
Sunday October 28
7:30 - 8:30 Breakfast
8:30 - 10:00 Balanced Budget Mechanism Design for Combinatorial Exchanges
David Parkes, Jayant Kalagnanam and Marta Eso
Balanced Budget Mechanism Design for Combinatorial Exchanges (pdf) (217 KB)
Discussant(s): Robert Rosenthal, Charles Zheng
10:00 - 10:30 Break
10:30 - 12:00 Panel Discussion: What is the Best Feasible Mechanism for Auctioning FCC Spectrum Licenses?
Moderator: Evan Kwerel
Discussant(s): Peter Cramton, Karla Hoffman, John Kagle, Paul Milgrom
12:00 - 12:15 Closing
12:15 - 1:30 Lunch

Papers

Ascending Auctions with Package Bidding

Lawrence M. Ausubel, University of Maryland and Paul Milgrom, Stanford University
6/7/2001

Balanced Budget Mechanism Design for Combinatorial Exchanges

David Parkes, Harvard University, with Jayant Kalagnanam and Marta Eso, IBM
10/23/2001

Balanced Budget Mechanism Design for Combinatorial Exchanges

David Parkes, Harvard University, with Jayant Kalagnanam and Marta Eso, IBM
10/23/2001

Response to Prof. Milgrom and Prof. Ausubel's Comments on the Second Wye River Package Bidding Conference

Kevin Leyton-Brown
1/25/2002

Comments on the Second Wye River Package Bidding Conference

Paul Milgrom and Larry Ausubel
12/14/2001

Theory, Experiment, and Federal Communication Commission Spectrum Auctions

Jeffrey Banks, Mark Olson, David Porter, Stephen Rassenti and Vernon Smith

CABOB: A Fast Optimal Algorithm for Combinatorial Auctions, International Joint Conference on Artificial Intelligence (IJCAI), Seattle, WA (pages 1102-1108)

Sandholm, T., Suri, S., Gilpin, A., and Levine, D.

Side Constraints and Non-Price Attributes in Markets, International Joint Conference on Artificial Intelligence (IJCAI), Workshop on Distributed Constraint Reasoning, Seattle, WA, August 4th (pages 55-61)

Sandholm, T. and Suri, S.

Winner Determination in Combinatorial Auction Generalizations, International Conference on Autonomous Agents, Workshop on Agent-based Approaches to B2B, Montreal, Canada, May 28th (pages 35-41)

Sandholm, T., Suri, S., Gilpin, A., and Levine, D.

Improved Algorithms for Optimal Winner Determination in Combinatorial Auctions and Generalizations, National Conference on Artificial Intelligence (AAAI), Austin, TX, July 31-August 2 (pages 90-97)

Sandholm, T. and Suri, S.

Algorithm for Optimal Winner Determination in Combinatorial Auctions, First appeared as an invited talk at the First International Conference on Information and Computation Economies, Charleston, SC, Oct. 25-28, 1998. Extended version appeared as Washington Univ., Dept. of Computer Science, tech report WUCS-99-01, January 28th, 1999. Conference version appeared at the International Joint Conference on Artificial Intelligence (IJCAI), pp. 542-547, Stockholm, Sweden, 1999.

Sandholm, T.

Presentations

10/27/2001

Ascending Auctions with Package Bidding

Lawrence Ausubel and Paul Milgrom
pdf (140 KB) - Presentation Slides (pdf) (155 KB)
 

Tradeoffs in Combinatorial Auction Design

Aleksandar Pekec and Michael Rothkopf
pdf (130 KB)
 

Package Bidding System Screenshots

Craig Bomberger, FCC
pdf (1.92 MB)
 

Issues in Scaling Up the 700 MHz Auction Design

Karla Hoffman, FCC
pdf (1.17 MB)
 
 
10/28/2001

Balanced Budget Mechanism Design for Combinatorial Exchanges

David Parkes, Jayant Kalagnanam and Marta Eso
Balanced Budget Mechanism Design for Combinatorial Exchanges (pdf) (217 KB) - Complete Paper (pdf) (425 KB)

Bureau/Office: 
Tags: 

Updated: 
Friday, July 23, 2004