A branch-and-price algorithm and new test problems for spectrum auctions

Management Science

Volumn 51, Issue 3, 2005, Pages 391-406

  Günlük, Oktay ^a   Ladányi, Lászlo ^a   De Vries, Sven ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

Branch and price; Combinatorial auctions; Spectrum auctions; Test problems

Indexed keywords

BRANCHED-AND-PRICE; COMBINATORIAL AUCTIONS; SPECTRUM AUCTION; TEST PROBLEMS;

COMPUTATIONAL METHODS; COSTS; DECISION MAKING; INTERNET; MATHEMATICAL MODELS; PROBLEM SOLVING; VALUE ENGINEERING;

ALGORITHMS;

EID: 18144418209     PISSN: 00251909     EISSN: None     Source Type: Journal    
DOI: 10.1287/mnsc.1040.0332     Document Type: Article

References (49)

1. Anbil, R., J. J. Forrest, W. R. Pulleyblank. 1998. Column generations and the airline crew pairing problem. Doc. Math. J. DMV Extra Volume ICM III 677-686.
2. Ausubel, L. M., P. C. Cramton. 2002. Demand reduction and inefficiency in multi-unit auctions. Manuscript, University of Maryland, College Park, MD, www.ausubel.com/auction-papers/demand-reduction.pdf.
3. Ausubel, L. M., P. C. Cramton, R. McAfee, J. McMillan. 1997. Synergies in wireless telephony: Evidence from the broadband PCS auction. J. Econom. Management Strategy 6(3) 497-527.
4. Barnhart, C., E. L. Johnson, G. L. Nemhauser, M. W. P. Savelsbergh, P. H. Vance. 1998. Branch and price: Column generation for solving huge integer programs. Oper. Res. 46(3) 316-329.
5. Bikhchandani, S., C. Huang. 1993. The economics of treasury securities markets. J. Econom. Perspect. 7 117-134.
6. Bikhchandani, S., J. M. Ostroy. 2002. The package assignment model. J. Econom. Theory 107(2) 377-406.
7. Boutilier, C. 2002. Solving concisely expressed combinatorial auction problems. Proc. 18th National Conf. Artificial Intelligence 14th Conf. Innovative Applications Artificial Intelligence, Edmonton, Alberta, Canada. AAAI Press, Menlo Park, CA, 359-366.
8. Bowman, R. J. 2001. Home Depot: An experiment in LTL carrier management. Manuscript, http://www.supplychainbrain. com/archives/7.01.homedepot.htm?adcode= 5.
9. Bykowsky, M. M., R. J. Cull, J. O. Ledyard. 2000. Mutually destructive bidding: The FCC auction design problem. J. Regulatory Econom. 17 205-228.
10. Cramton, P. C. 1995. Money out of thin air: The nationwide narrowband PCS auction. J. Econom. Management Strategy 4(2) 267-343.
11. Cramton, P. C. 1997. The FCC spectrum auctions: An early assessment. J. Econom. Management Strategy 6(3) 431-495.
12. Cramton, P. C. 2002. Spectrum auctions. Martin Cave, Sumit Majumdar, Ingo Vogelsang, eds. Handbook of Telecommunications Economics. Elsevier Science B.V., Amsterdam, The Netherlands, 605-639.
13. Davenport, A. J., C. An, E. Ng, G. Hohner, G. Reid, H. Soo, J. R. Kalagnanam, J. Rich. 2003. Combinatorial and quantity-discount procurement auctions benefit Mars, Incorporated and its suppliers. Interfaces 33(1) 23-35.
14. de Vries, S., R. V. Vohra. 2003. Combinatorial auctions: A survey. INFORMS J. Comput. 15(3) 284-309.
15. Dietrich, B., J. J. Forrest. 2000. A method for determining the set of winning bids in a combinatorial auction. Patent filed, YOR92000047US1, IBM Research Center, Yorktown Heights, New York.
16. Dietrich, B., J. J. Forrest. 2002. A column generation approach for combinatorial auctions. Brenda Dietrich, Rakesh V. Vohra, eds. Mathematics of the Internet: E-Auction and Markets. The IMA Volumes in Mathematics and Its Applications, Vol. 127. Springer-Verlag, New York, 15-26.
17. Elmaghraby, W., P. Keskinocak. 2000. Technology for transportation bidding at the Home Depot. Case study, Georgia Institute of Technology, Atlanta, GA.
18. Elmaghraby, W., P. Keskinocak. 2002. Combinatorial auctions in procurement. Technical report, The Logistics Institute - Asia Pacific, National University of Singapore, Singapore, http://www.tliap.nus.edu.sg/.
19. Elmaghraby, W., P. Keskinocak. 2003. Technology for transportation bidding at the Home Depot. Terry P. Harrison, Hau L. Lee, John J. Neale, eds. The Practice of Supply Chain Management, Ch. 15. International Series in Operations Research and Management Science, Vol. 62. Kluwer, New York.
20. Epstein, R., L. Henríquez, J. Catalán, G. Y. Weintraub, C. Martínez. 2002. A combinational auction improves school meals in Chile. Interfaces 32(6) 1-14.
21. Federal Communications Commission. 1995. Round-by-round results. FCC, Washington, D.C., ftp://ftp.fcc.gov/pub/Auctions/PCS/Broadband/MTA/index.html.
22. Federal Communications Commission. 2000. Auction of licenses in the 747-762 and 777-792 MHz bands scheduled for September 6, 2000: Comment sought on modifying the simultaneous multiple round auction design to allow combinatorial (package) bidding. FCC, Washington, D.C., http://wireless.fcc.gov/auctions/31/ releases/da001075.pdf.
23. Federal Communications Commission. 2001. On package bidding. FCC, Washington, D.C., http://wireless.fcc.gov/auctions/about/auctiondesigns.html.
24. Fujishima, Y., K. Leyton-Brown, Y. Shoham. 1999. Taming the computational complexity of combinatorial auctions: Optimal and approximate approaches. Proc. Internat. Joint Conf. Artificial Intelligence, Stockholm, Sweden. Morgan Kaufmann, San Francisco, CA, 548-553.
25. Günlük, O., L. Ladányi, S. de Vries. 2003. Hard Problems, http://www.m9.ma.tum.de/~devries/fcc_supplement.
26. ILOG. 1997. Using the CPLEX Callable Library. CPLEX Division, Incline Village, NV, http://www.cplex.com.
27. Jackson, C. L. 1976. Technology for spectrum markets. Ph.D. thesis, Department of Electrical Engineering, MIT, Cambridge, MA.
28. Klemperer, P. 1999. Auction theory: A guide to the literature. J. Econom. Surveys 13(3) 227-286.
29. Ledyard, J. O., M. Olson, D. Porter, J. A. Swanson, D. P. Torma. 2002. The first use of a combined-value auction for transportation services. Interfaces 32(5) 4-12.
30. Leyton-Brown, K. 2002. Response to Professor Milgrom and Professor Ausubel's "Comments on the Second Wye River package bidding conference." FCC, Washington, D.C., http://wireless.fcc.gov/auctions/ conferences/combin2001/papers/FCC-Comments.pdf.
31. Leyton-Brown, K., E. Nudelman, G. Andrew, J. McFadden, Y. Shoham. 2003. A portfolio approach to algorithm selection. Proc. 18th Internat. Joint Conf. Artificial Intelligence (IJCAI), Acapulco, Mexico. Morgan Kaufmann, San Francisco, CA, 1542-1543.
32. Leyton-Brown, K., E. Nudelman, Y. Shoham. 2002. Learning the empirical hardness of optimization problems: The case of combinatorial auctions. Pascal Van Hentenryck, ed. Principles and Practice of Constraint Programming - CP 2002. LNCS, Vol. 2470. Springer, New York, 556-572, http://link.springer.de/link/ service/series/0558/bibs/2470/24700556.htm.
33. Leyton-Brown, K., M. Pearson, Y. Shoham. 2000a. Towards a universal test suite for combinatorial auction algorithms. Proc. ACM Conf. Electronic Commerce (EC-00), Minneapolis, MN. ACM, New York, 66-76.
34. Leyton-Brown, K., Y. Shoham, M. Tennenholtz. 2000b. An algorithm for multi-unit combinatorial auctions. Proc. 17th National Conf. Artificial Intelligence 12th Conf. Innovative Appl. Artificial Intelligence, Austin, TX. AAAI Press, Menlo Park, CA, 56-61.
35. Lougee-Heimer, R., F. Barahona, B. Dietrich, J. Fasano, J. J. Forrest, R. Harder, L. Ladányi, T. Pfender, T. Ralphs, M. Saltzman, K. Scheinberg. 2001. The COIN-OR initiative: Open-source software accelerates operations research progress. OR/MS Today 28 20-22.
36. McMillan, J. 1994. Selling spectrum rights. J. Econom. Perspect. 8(3) 145-162.
37. Milgrom, P. R. 1995. Auctioning the radio spectrum. Auction Theory for Privatization. Cambridge University Press, Cambridge, UK.
38. Moreton, P. S., P. T. Spiller. 1998. What's in the air: Interlicense synergies in the Federal Communications Commission's broadband personal communication service spectrum auction. J. Law Econom. XLI 677-716.
39. Nemhauser, G. L., L. A. Wolsey. 1988. Integer and Combinatorial Optimization. John Wiley, New York.
40. Nisan, N. 2000. Bidding and allocation in combinatorial auctions. Proc. ACM Conf. Electronic Commerce (EC-00), Minneapolis, MN, 1-12.
41. Parker, M., J. Ryan. 1994. A column generation algorithm for band-width packing. Telecomm. Systems 2 185-196.
42. Ralphs, T. K., L. Ladányi. 2001. COIN/BCP User's Manual. http://www.coin-or.org/Presentations/bcp-man.pdf.
43. Rassenti, S. J., V. L. Smith, R. L. Bulfin. 1982. A combinatorial auction mechanism for airport time slot allocation. Bell J. Econom. 13(2) 402-417.
44. Rothkopf, M. H., A. Pekec, R. M. Harstad. 1998. Computationally manageable combinatorial auctions. Management Sci. 44(8) 1131-1147.
45. Ryan, D. M., B. Foster. 1981. An integer programming approach to scheduling. A. Wren, ed. Computer Scheduling of Public Transport: Urban Passenger Vehicle and Crew Scheduling. North-Holland, Amsterdam, The Netherlands, 269-280.
46. Sandholm, T. W. 2002. Algorithm for optimal winner determination in combinatorial auctions. Artificial Intelligence 135(1-2) 1-54.
47. Sandholm, T. W., S. Suri, A. Gilpin, D. Levine. 2001. CABOB: A fast optimal algorithm for combinatorial auctions. Internat. Joint Conf. Artificial Intelligence, (IJCAI), Seattle, WA. Morgan Kaufmann, San Francisco, CA.
48. Wolfstetter, E. 1996. Auctions: An introduction. J. Econom. Surveys 10(4) 367-420.
49. Wolfstetter, E. 1999. Topics in Microeconomics: Industrial Organization, Auctions, and Incentives. Cambridge University Press, Cambridge, UK.