A Computational Analysis of Linear Price Iterative Combinatorial Auction Formats

References

• Adomavicius D., Gupta A. Toward comprehensive real-time bidder support in iterative combinatorial auctions. Inform. Systems Res. (2005) 16(2):169–185Link, Google Scholar
• An N., Elmaghraby W., Keskinocak P. Bidding strategies and their impact on revenues in combinatorial auctions. J. Revenue Pricing Management (2005) 3(4):337–357Crossref, Google Scholar
• Anandalingam G., Day R. W., Raghavan S. The landscape of electronic market design. Management Sci. (2005) 51(3):316–327Link, Google Scholar
• Ausubel L. An efficient dynamic auction for heterogeneous commodities. Amer. Econom. Rev. (2006) 96(3):602–629Crossref, Google Scholar
• Ausubel L., Milgrom P. Ascending auctions with package bidding. Frontiers Theoret. Econom. (2002) 1:1–42Google Scholar
• Ausubel L., Milgrom P., Cramton P., Shoham Y., Steinberg R. Ascending proxy auctions. Combinatorial Auctions (2006a) (MIT Press, Cambridge, MA) Google Scholar
• Ausubel L., Milgrom P., Cramton P., Shoham Y., Steinberg R. The lovely but lonely Vickrey auction. Combinatorial Auctions (2006b) (MIT Press, Cambridge, MA) Google Scholar
• Ausubel L., Crampton P., Milgrom P., Cramton P., Shoham Y., Steinberg R. The clock-proxy auction: A practical combinatorial auction design. Combinatorial Auctions (2006) (MIT Press, Cambridge, MA) Google Scholar
• Bichler M., Davenport A., Hohner G., Kalagnanam J., Cramton P., Shoham Y., Steinberg R. Industrial procurement auctions. Combinatorial Auctions (2006) (MIT Press, Cambridge, MA) Google Scholar
• Bikhchandani S., Ostroy J. M. The package assignment model. J. Econom. Theory (2002) 107(2):377–406Crossref, Google Scholar
• Bikhchandani S., Ostroy J. M., Cramton P., Shoham Y., Steinberg R. From the assignment model to combinatorial auctions. Combinatorial Auctions (2006) (MIT Press, Cambridge, MA) Google Scholar
• Carlsson P., Andersson A. A flexible model for tree-structured multi-commodity markets. J. Electronic Commerce Res. (2007) 7(1):337–357Crossref, Google Scholar
• Cramton P. Ascending auctions. Eur. Econom. Rev. (1998) 42(3–5):745–756Crossref, Google Scholar
• Cramton P., McMillan R., Milgrom P., Miller B., Mitchell B., Vincent D., Wilson R. Simultaneous ascending auctions with package bidding. (1998) . Report to the Federal Communications Commission, Charles River and AssociatesGoogle Scholar
• Cramton P., Shoham Y., Steinberg R.Combinatorial Auctions (2006) (MIT Press, Cambridge, MA) Google Scholar
• Day R. Expressing preferences with price-vector agents in combinatorial auctions. (2004) . Ph.D. thesis, University of Maryland, College Park, MDGoogle Scholar
• de Vries S., Schummer J., Vohra R. On ascending Vickrey auctions for heterogeneous objects. J. Econom. Theory (2007) 132(1):95–118Crossref, Google Scholar
• Drexl A., Jornsten K., Knof D. Non-linear anonymous pricing in combinatorial auctions. (2005) . Working paper, Christian-Albrechts-Universität, Kiel, GermanyCrossref, Google Scholar
• Dunford M., Hoffman K., Menon D., Sultana R., Wilson T. Testing linear pricing algorithms for use in ascending combinatorial auctions. (2007) . Technical report, George Mason University, Fairfax, VAGoogle Scholar
• Elmaghraby W., Keskinocak P. Technology for transportation bidding at the Home Depot. Kluwer's Internatioal Series in Operations Research and Management Science (2002) (Kluwer Academic Publishers, Dordrecht, The Netherlands) Google Scholar
• Fan M., Stallaert J., Whinston A. Decentralized mechanism design for supply chain organizations using auction market. Inform. Systems Res. (2003) 14(1):1–22Link, Google Scholar
• Federal Communications Commission Auction of licenses in the 747–762 and 777–792 MHz bands scheduled for June 19, 2002. (2002) . Technical report, Federal Communications Commission, Public Notice (DA 02-260), Washington, D.C.Google Scholar
• Hoffman K., Menon D., Heever A. A bidder aid tool for dynamic package creation in the FCC spectrum auctions. (2005) . Working paper, George Mason University, Fairfax, VAGoogle Scholar
• Jones J., Koehler G. A heuristic for winner determination in rule-based combinatorial auctions. INFORMS J. Comput. (2005) 17(4):475–489Link, Google Scholar
• Kelly F., Steinberg R. A combinatorial auction with multiple winners for universal service. Management Sci. (2000) 46(4):586–596Link, Google Scholar
• Kelso A. S., Crawford V. P. Job matching, coalition formation, and gross substitute. Econometrica (1982) 50:1483–1504Crossref, Google Scholar
• Kwasnica T., Ledyard J. O., Porter D., DeMartini C. A new and improved design for multiobjective iterative auctions. Management Sci. (2005) 51(3):419–434Link, Google Scholar
• Kwon R. H., Anandalingam G., Ungar L. H. Iterative combinatorial auctions with bidder-determined combinations. Management Sci. (2005) 51(3):407–418Link, Google Scholar
• Lehmann D., Mueller R., Sandholm T., Cramton P., Shoham Y., Steinberg R. The winner determination problem. Combinatorial Auctions (2006) (MIT Press, Cambridge, MA) 297–317Google Scholar
• Leyton-Brown K., Nudelman E., Shoham Y., Cramton P., Shoham Y., Steinberg R. Empirical hardness models for combinatorial auctions. Combinatorial Auctions (2006) (MIT Press, Cambridge, MA) 478–504Google Scholar
• Leyton-Brown K., Pearson M., Shoham Y. Towards a universal test suite for combinatorial auction algorithms. ACM Conf. Electronic Commerce (EC-2000) (2000) (ACM SIGecom, New York) 66–76Crossref, Google Scholar
• Milgrom P. R., Weber R. J. A theory of auctions and competitive bidding. Econometrica (1982) 50(5):1089–1122Crossref, Google Scholar
• Mishra D., Parkes D. Ascending price Vickrey auctions for general valuations. J. Econom. Theory (2007) 132(1):335–366Crossref, Google Scholar
• Nemhauser G. L., Wolsey L. A.Integer and Combinatorial Optimization (1988) (John Wiley and Sons, Inc., New York) Wiley-Interscience Series in Discrete Mathematics and OptimizationCrossref, Google Scholar
• Nisan N. Bidding and allocations in combinatorial auctions. ACM Conf. Electronic Commerce (EC-2000) (2000) (ACM SIGecom, New York) 1–12Crossref, Google Scholar
• Parkes D. Iterative combinatorial auctions: Achieving economic and computational efficiency. (2001) . Ph.D. thesis, University of Pennsylvania, PhiladelphiaGoogle Scholar
• Parkes D., Cramton P., Shoham Y., Steinberg R. Iterative combinatorial auctions. Combinatorial Auctions (2006) (MIT Press, Cambridge, MA) Google Scholar
• Parkes D., Ungar L. H. Iterative combinatorial auctions: Theory and practice. 17th National Conf. Artificial Intelligence (AAAI-00) (2000) (AAAI Press, Menlo Park, CA) 74–81Google Scholar
• Pikovsky A., Bichler M. Information feedback and decision support in interative combinatorial auctions. Wirtschaftsinformatik (2005) (Springer, Bamberg, Germany) 329–348[Also available at http://ibis.in.tum.de/staff/pikovsky/index.htm.]Google Scholar
• Plummer C. L. Bidder response to combinatorial auctions in truckload procurement. (2003) . Master's thesis, Massachusetts, Institute of Technology, Cambridge, MAGoogle Scholar
• Porter D., Rassenti S., Roopnarine A., Smith V. Combinatorial auction design. Proc. National Acad. Sci. (PNAS) (2003) 100:11153–11157Crossref, Google Scholar
• Rassenti S., Smith V. L., Bulfin R. L. A combinatorial auction mechanism for airport time slot allocations. Bell J. Econom. (1982) 13:402–417Crossref, Google Scholar
• Rothkopf M. H., Pekeč A., Harstad R. M. Computationally manageable combinatorial auctions. Management Sci. (1998) 44(8):1131–1147Link, Google Scholar
• Sandholm T., Boutilier C., Cramton P., Shoham Y., Steinberg R. Preference elicitation in combinatorial auctions. Combinatorial Auctions (2006) (MIT Press, Cambridge, MA) 233–263Google Scholar
• Schoenherr T., Mabert V. A. Bundling for B2B procurement auctions: Current state and best practices. Internat. J. Integrated Supply Management (2006) 2(3):189–213Crossref, Google Scholar
• Shabalin P., Laqua B., Pikovsky A. Improved rules for the resource allocation design. Proc. 9th IEEE Internat. Conf. E-Commerce Tech. (2007) (IEEE, Washington, D.C.) 232–330Crossref, Google Scholar
• Song J., Regan A. C. Combinatorial auctions for transportation service procurement: The carrier perspective. Transportation Res. Record (2002) 1833:40–46Crossref, Google Scholar
• Sureka A., Wurman P. Applying metaheuristic techniques to search the space of bidding strategies in combinatorial auctions. Genetic Evolutionary Comput. Conf. (2005) (ACM, New York) 2097–2103Crossref, Google Scholar
• Wurman P., Wellman M. Akba: A progressive, anonymous-price combinatorial auction. ACM Conf. Electronic Commerce (2000) (ACM, New York) 21–29Crossref, Google Scholar
• Xia Mu, Koehler G. J., Whinston A. B. Pricing combinatorial auctions. Eur. J. Oper. Res. (2004) 154(1):251–270Crossref, Google Scholar