A Computational Analysis of Bundle Trading Markets Design for Distributed Resource Allocation

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

References

  • Adomavicius G., Gupta A. Toward comprehensive real-time bidder support in iterative combinatorial auctions. Inform. Systems Res. (2005) 16(2):169–185LinkGoogle Scholar
  • Albrecht M. Supply chain coordination mechanisms: New approaches for collaborative planning. Lecture Notes in Economics and Mathematical Systems (2009) 1st ed.(Springer, New York) Google Scholar
  • Amihud Y., Mendelson H. Dealership market: Market making with inventory. J. Financial Econom. (1980) 8(1):31–53CrossrefGoogle Scholar
  • Ausubel L. M. An efficient ascending-bid auction for multiple objects. Amer. Econom. Rev. (2004) 94(5):1452–1475CrossrefGoogle Scholar
  • Ba S., Stallaert J., Whinston A. B. Research commentary: Introducing a third dimension in information systems design—The case for incentive alignment. Inform. Systems Res. (2001a) 12(3):225–239LinkGoogle Scholar
  • Ba S., Stallaert J., Whinston A. B. Optimal investment in knowledge within a firm using a market mechanism. Management Sci. (2001b) 47(9):1203–1219LinkGoogle Scholar
  • Bertsekas D. P. A distributed algorithm for the assignment problem. (1979) . MIT Lab, Information and Decision Systems Report, Massachusetts Institute of Technology, Cambridge, MAGoogle Scholar
  • Bertsekas D. P. The auction algorithm: A distributed relaxation method for the assignment problem. Ann. Oper. Res. (1988) 14:105–123CrossrefGoogle Scholar
  • Bertsekas D. P., Tsitsiklis J. N.Introduction to Linear Optimization (1997) (Athena Scientific, Belmont, MA) Google Scholar
  • Bichler M., Shabalin P., Pikovsky A. A computational analysis of linear price iterative combinatorial auction formats. Inform. Systems Res. (2009) 20(1):33–59LinkGoogle Scholar
  • Bikhchandani S., Mamer J. W. Competitive equilibrium in an exchange economy with indivisibles. J. Econom. Theory (1997) 74(2):385–413CrossrefGoogle Scholar
  • Bikhchandani S., Ostroy J. M. The package assignment model. J. Econom. Theory (2002) 107(2):337–406CrossrefGoogle Scholar
  • Chu L. Y. Truthful bundle/multiunit double auctions. Management Sci. (2009) 55(7):1184–1198LinkGoogle Scholar
  • Cramton P. The FCC spectrum auctions: An early assessment. J. Econom. Management Strategy (1997) 6(3):431–495CrossrefGoogle Scholar
  • Cramton P., Shoham Y., Steinberg R.Combinatorial Auctions (2006) (The MIT Press, Cambridge, MA) Google Scholar
  • Dantzig G. B., Wolfe P. The decomposition principle for linear programs. Oper. Res. (1960) 8(1):101–111LinkGoogle Scholar
  • Demange G., Gale D., Sotomayor M. Multi-item auctions. J. Political Econom. (1986) 94(4):863–872CrossrefGoogle Scholar
  • De Vries S., Schummer J., Vohra R. On ascending Vickrey auctions for heterogeneous objects. J. Econom. Theory (2007) 132(1):95–118CrossrefGoogle Scholar
  • Fan M., Stallaert J., Whinston A. B. Decentralized mechanism design for supply chain organizations using auction market. Inform. Systems Res. (2003) 14(1):1–22LinkGoogle Scholar
  • Friedman D., Sunder S.Experimental Methods: A Premier for Economists (1994) (Cambridge University Press, Cambridge, UK) CrossrefGoogle Scholar
  • Gallien J., Wein L. M. A smart market for industrial procurement with capacity constraints. Management Sci. (2005) 51(1):76–91LinkGoogle Scholar
  • Guo Z., Koehler G. J., Whinston A. B. A market-based optimization algorithm for distributed systems. Management Sci. (2007) 53(8):1345–1358LinkGoogle Scholar
  • Harris L.Trading and Exchanges: Market Microstructure for Practitioners (2002) (Oxford University Press, Oxford, UK) Google Scholar
  • Hogan W. W., Read E. G., Ring B. J. Using mathematical programming for electricity spot pricing. Internat. Trans. Oper. Res. (1996) 3(3/4):209–221CrossrefGoogle Scholar
  • Kelso A. S., Crawford V. P. Job matching, coalition formation, and gross substitutes. Econometrica (1982) 50(6):1483–1504CrossrefGoogle Scholar
  • Kothari A., Sandholm T., Suri S. Solving combinatorial exchanges: Optimality via a few partial bids. Proc. Third Internat. Joint Conf. Autonomous Agents and Multiagent Systems (AAMAS'04) (2004) 3New YorkGoogle Scholar
  • Leonard H. B. Elicitation of honest preferences for the assignment of individuals to positions. J. Political Econom. (1983) 91(3):461–479CrossrefGoogle Scholar
  • Lubin B., Juda A. I., Cavallo R., Lahaie S., Shneidman J., Parkes D. C. ICE: An expressive iterative combinatorial exchange. J. Artificial Intelligence Res. (2008) 33:33–77CrossrefGoogle Scholar
  • Makridakis S. G., Wheelwright S. C., McGee V. E.Forecasting (1983) (John Wiley & Sons Inc., Hoboken, NJ) Google Scholar
  • Marschak T., Hendershott T. Organization structure. Handbooks in Information Systems (2006) 1(Elsevier, Amsterdam) 201–284Google Scholar
  • Mas-Colell A., Whinston M. D., Green J. R.Microeconomic Theory (1995) (Oxford University Press, Oxford, UK) Google Scholar
  • McAfee R. P. Efficient allocation with continuous quantities. J. Econom. Theory (1991) 53(1):51–74CrossrefGoogle Scholar
  • McAfee R. P. A dominant strategy double auction. J. Econom. Theory (1992) 56(2):434–450CrossrefGoogle Scholar
  • McCabe K., Rassenti S., Smith V. Auction design for composite goods: The natural gas industry. J. Econom. Behav. Organ. (1990) 14(9):127–149CrossrefGoogle Scholar
  • McCabe K., Rassenti S., Smith V. Smart computer-assisted markets. Science (1991) 254(5031):534–538CrossrefGoogle Scholar
  • Meeus L., Verhaegen K., Belmans R. Block order restrictions in combinatorial electric energy auctions. Eur. J. Oper. Res. (2009) 196(3):1202–1206CrossrefGoogle Scholar
  • Myerson R. B., Satterthwaite M. A. Efficient mechanisms for bilateral trading. J. Econom. Theory (1983) 29(2):265–281CrossrefGoogle Scholar
  • Nisan N., Ronen A. Algorithmic mechanism design. Games Econom. Behav. (2001) 35(1/2):166–196CrossrefGoogle Scholar
  • O'Hara M.Market Microstructure Theory (1995) (Blackwell Publishing, Malden, MA) Google Scholar
  • Parkes D. C. iBundle: An efficient ascending price bundle auction. Proc. ACM Conf. Electronic Commerce (1999) (ACM Press, New York) 148–157CrossrefGoogle Scholar
  • Parkes D. C., Cramton P., Shoham Y., Steinberg R. Iterative combinatorial auctions. Combinatorial Auctions (2006) (MIT Press, Cambridge, MA) 41–78Chapter 2Google Scholar
  • Parkes D. C., Ungar L. H. Iterative combinational auctions: Theory and practice. 17th National Conf. Artificial Intelligence (AAAI) (2000) 74–81Google Scholar
  • Pekec A., Rothkopf M. H. Combinatorial auction design. Management Sci. (2003) 49(11):1485–1503LinkGoogle Scholar
  • Raffensperger J. F., Mark W. M., Read E. G. A deterministic smart market model for ground water. Oper. Res. (2009) 57(6):1333–1346LinkGoogle Scholar
  • Rassenti S. J., Smith V. L., Bluffing R. L. A combinatorial auction mechanism for airport time slot allocation. Bell J. Econom. (1982) 13(2):402–417CrossrefGoogle Scholar
  • Roberts S. W. Control chart tests based on geometric moving averages. Technometrics (1959) 1:239–250CrossrefGoogle Scholar
  • Rothkopf M. H. Thirteen reasons why the Vickrey-Clarke-Groves process is not practical. Oper. Res. (2007) 55(2):191–197LinkGoogle Scholar
  • Rothkopf M. H., Pekec A., Harstad R. M. Computationally manageable combinational auctions. Management Sci. (1998) 44(8):1131–1147LinkGoogle Scholar
  • Sandholm T., Boutilier C., Cramton P., Shoham Y., Steinberg R. Preference elicitation in combinatorial auctions. Combinatorial Auctions (2006) (MIT Press, Cambridge, MA) . Chapter 10Google Scholar
  • Scheffel T., Pikovsky A., Bichler M., Guler K. An experimental comparison of linear and nonlinear price combinatorial auctions. Inform. Systems Res. (2010) 22(2):346–368LinkGoogle Scholar
  • Shapley L. S., Shubik M. The assignment game I: The core. Internat. J. Game Theory (1972) 1(1):111–130CrossrefGoogle Scholar
  • Sheffi Y. Combinatorial auctions in the procurement of transportation services. Interfaces (2004) 34(4):245–252LinkGoogle Scholar
  • Thomas P., Teneketzis D., Mackie-Mason J. K. A market-based approach to optimal resource allocation in integrated-services connection-oriented networks. Oper. Res. (2002) 50(4):603–616LinkGoogle Scholar
  • Xia M., Stallaert J., Whinston A. B. Solving the combinatorial double auction problem. Eur. J. Oper. Res. (2005) 164(1):239–251CrossrefGoogle 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.