A computational analysis of linear price iterative combinatorial auction formats

Information Systems Research

Volumn 20, Issue 1, 2009, Pages 33-59

  Bichler, Martin ^a   Shabalin, Pasha ^a   Pikovsky, Alexander ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

Allocative efficiency; Computational experiment; Iterative combinatorial auction; Pseudodual prices

Indexed keywords

COMMERCE; COMPUTATIONAL EFFICIENCY; COMPUTATIONAL METHODS; ECONOMICS; EFFICIENCY; GAME THEORY; ITERATIVE METHODS;

ALLOCATIVE EFFICIENCY; COMBINATORIAL AUCTION; COMPUTATIONAL ANALYSIS; COMPUTATIONAL EXPERIMENT; EQUILIBRIUM ANALYSIS; GAME THEORETICAL ANALYSIS; PSEUDODUAL PRICES; REVENUE DISTRIBUTIONS;

COSTS;

EID: 67649548426     PISSN: 10477047     EISSN: 15265536     Source Type: Journal    
DOI: 10.1287/isre.1070.0151     Document Type: Article

References (50)

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