An Experimental Comparison of Linear and Nonlinear Price Combinatorial Auctions

Published Online:https://doi.org/10.1287/isre.1090.0267

References

  • Adomavicius D., Gupta A. Toward comprehensive real-time bidder support in iterative combinatorial auctions. Inform. Systems Res. (2005) 16(2):169–185LinkGoogle 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., Cramton 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
  • Banker R. D., Kauffman R. J. 50th anniversary article: The evolution of research on information systems: A fiftieth-year survey of the literature in management science. Management Sci. (2004) 50(3):281–298LinkGoogle Scholar
  • Banks J., Ledyard J., Porter D. Allocating uncertain and unresponsive resources: An experimental approach. RAND J. Econom. (1989) 20:1–25CrossrefGoogle Scholar
  • Banks J., Olson M., Porter D., Rassenti S., Smith V. Theory, experiment and the FCC spectrum auctions. J. Econom. Behav. Organ. (2003) 51:303–350CrossrefGoogle Scholar
  • Bapna R., Goes P., Gupta A. A theoretical and empirical investigation of multi-item on-line auctions. Inform. Tech. Management (2000) 1(1–2Google Scholar
  • Bapna R., Goes P., Gupta A. Insights and analyses of online auctions. Comm. ACM (2001) 44(11):42–50CrossrefGoogle Scholar
  • Bichler M., Shabalin P., Pikovsky A. A computational analysis of linear-price iterative combinatorial auctions. Inform. Systems Res. (2009) 20(1):33–59LinkGoogle Scholar
  • Brunner C., Goeree J. K., Holt C. A., Ledyard J. An experimental test of flexible combinatorial spectrum auction formats. Amer. Econom. J.: Microeconom. (2009) . ForthcomingGoogle Scholar
  • Chen Y., Takeuchi K. Multi-Object Auctions with Package Bidding: An Experimental Comparison of Vickrey and iBEA. Games Econom. Behav. (2008) . ForthcomingGoogle Scholar
  • Cramton P. Money out of thin air: The nationwide narrowband PCS auction. J. Econom. Management Strategy (1995) 4(2):267–343CrossrefGoogle Scholar
  • Cramton P., Schwartz J. A. Collusive bidding in the FCC spectrum auctions. J. Regulatory Econom. (2000) 17(3):229–252CrossrefGoogle Scholar
  • de Vries S., Schummer J., Vohra R. On ascending Vickrey auctions for heterogeneous objects. J. Econom. Theory (2007) 132:95–118CrossrefGoogle 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
  • Fan M., Stallaert J., Whinston A. Decentralized mechanism design for supply chain organizations using auction market. Inform. Systems Res. (2003) 14(1):1–22LinkGoogle Scholar
  • Goeree J. K., Holt C. A. Hierarchical package bidding: A paper and pencil combinatorial auction. Games Econom. Behav. (2009) . ForthcomingGoogle Scholar
  • Greene W. H.Econometric Analysis (2003) (Prentice Hall, Upper Saddle River, NJ) Google Scholar
  • Isaac R., James D. Robustness of the incentive compatible combinatorial auction. Experiment. Econom. (2000) 3:31–53CrossrefGoogle Scholar
  • Isaac M., Salmon T., Zillante A. A theory of jump bidding in ascending auctions. J. Econom. Behav. Organ. (2007) 62:144–164CrossrefGoogle Scholar
  • Kagel J. H., Levin D. Individual bidder behavior in first-price private value auctions. Econom. Lett. (1985) 19:125–128CrossrefGoogle Scholar
  • Kazumori E. Auctions with package bidding: An experimental study. (2005) . Technical report, The Center for Advanced Research in Finance, The University of Tokyo, TokyoGoogle Scholar
  • Kelly F., Steinberg R. A combinatorial auction with multiple winners for universal service. Management Sci. (2000) 46(4):586–596LinkGoogle 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–434LinkGoogle Scholar
  • Ledyard J., Porter D., Rangel A. Experiments testing multiobject allocation mechanisms. J. Econom., Management, Strategy (1997) 6:639–675CrossrefGoogle Scholar
  • Milgrom P. R., Weber R. J. A theory of auctions and competitive bidding. Econometrica (1982) 50(5):1089–1122CrossrefGoogle Scholar
  • Parkes D., Ungar L. H. Iterative combinatorial auctions: Theory and practice. Proc. 17th National Conf. Artificial Intelligence (AAAI-17) and the 12th Conf. Innovative Applications Artificial Intelligence (2000) (AAAI Press/MIT Press, Menlo Park, CA) Google Scholar
  • Plott C., Salmon T. The simultaneous ascending auction: Dynamics of price adjustment in experiments and in the U.K. 3G spectrum auction. (2002) . Social Science Working Paper 1155. California Institute of Technology, Pasadena, CAGoogle Scholar
  • Porter D., Rassenti S., Roopnarine A., Smith V. Combinatorial auction design. Proc. National Acad. Sci. USA (2003) 100:11153–11157CrossrefGoogle Scholar
  • Rassenti S., Smith V. L., Bulfin R. L. A combinatorial auction mechanism for airport time slot allocations. Bell J. Econom. (1982) 13:402–417CrossrefGoogle Scholar
  • Roth A. Laboratory experimentation in economics: A methodological overview. Econom. J. (1988) 98:974–1031Google Scholar
  • Rothkopf M. H. Decision analysis: The right tool for auctions. Decision Anal. (2007) 4/3:167–172LinkGoogle Scholar
  • Sargent T. J.Bounded Rationality and Macroeconomics (1993) (Oxford University Press, New York) Google Scholar
  • Schneider S., Shabalin P., Bichler M. On the robustness of non-linear personalized price combinatorial auctions. Eur. J. Oper. Res. (2008) . ForthcomingGoogle Scholar
  • Vickrey W. Counterspeculation, auctions, and competitive sealed tenders. J. Finance (1961) 1(3):8–37CrossrefGoogle Scholar
  • Xia M., Koehler G. J., Whinston A. B. Pricing combinatorial auctions. Eur. J. Oper. Res. (2004) 154(1):251–270CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.